Linear Programming Project
11+ results
Filters
Grade
Subject
Resource type
Standard
Audience
Programs & methods
Searching Algorithms Lesson: Linear, Binary, Jump & Interpolation Search
This lesson provides a complete foundation in Searching Algorithms, covering Linear Search, Binary Search, Jump Search, and Interpolation Search, including step-by-step execution, Python implementations, and time complexity analysis. ────────── ⋆⋅☆⋅⋆ ────────── What’s Included 💡 Full Searching Algorithms Slide Deck💡 Visual step-by-step search diagrams💡 Python code implementations💡 Exam-style search problems💡 Ready for in-person, online, or hybrid classrooms────────── ⋆⋅☆⋅⋆ ─────
8th - 12th, Adult Education, Higher Education
Computer Science - Technology, Engineering, Instructional Technology
Also included in: Algorithm Analysis & Design | Complete Step-by-Step Curriculum
AP® Computer Science A: 9 Recursion (Slides)
Overview. These slides are teachable, include multiple short programming activities and are completely editable to your liking. Complete with animations, explanations, code and algorithms covering Recursion, Searching and Sorting algorithms. Objectives: Effectively construct recursive algorithms and describe their advantages in comparison to iterative (for/while loops) ones. Construct basic recursive algorithms (recursive call and base case)Convert iterative algorithms into recursive ones o Fact
10th - 12th, Adult Education, Higher Education
Computer Science - Technology, Informational Text
CCSS
CCRA.L.3
, CCRA.L.4
, CCRA.L.6
Intro to Java: Lesson 4.1 — Searching & Sorting Algorithms
Lesson 4.1 — Searching & Sorting Algorithms (Java) | CSA Worksheet + Teacher GuideLinear Search • Binary Search • Selection Sort • Insertion SortThis complete, classroom-ready worksheet packet is perfect for any Intro to Java or AP Computer Science A class. Students learn four core algorithms essential for understanding data structures and AP CSA exam readiness: linear search, binary search, selection sort, and insertion sort. This resource includes a detailed student worksheet AND a full tea
9th - 12th
Computer Science - Technology
CCSS
RST.9-10.3
, RST.9-10.7
, RST.9-10.10
+17
Algorithm Analysis & Design | Brute Force and Exhaustive Search Complete Lesson
This lesson provides a complete foundation in Brute Force and Exhaustive Search within Algorithm Analysis and Design, covering brute-force strategy, selection sort, bubble sort, linear (sequential) search, brute-force string matching, and exhaustive search for optimization problems including Traveling Salesman Problem, Knapsack Problem, and Assignment Problem. ────────── ⋆⋅☆⋅⋆ ────────── What’s Included 💡 Full Brute Force Slide Deck (PPT + PDF)💡 Full Exhaustive Search Slide Deck (PPT +
10th - 12th, Adult Education, Higher Education
Computer Science - Technology, Engineering, Instructional Technology
Also included in: Algorithm Analysis & Design | Complete Step-by-Step Curriculum
The Consumer Buying Process: Lesson, Slide Presentation, Video, & Activities!
Engage Students: Update Your Marketing Curriculum for the TikTok Generation. Transform your students from passive scrollers into savvy brand strategists who understand the psychology behind the "Scroll." This high-interest lesson modernizes the traditional Consumer Buying Process (Problem Recognition → Evaluation) to reflect the reality of the Digital Age. Instead of outdated linear models, students explore how algorithms, "de-influencers," and latent problem recognition drive the purchasing hab
9th - 12th, Adult Education, Higher Education
Business, Computer Science - Technology
Binary Search Tree Complete Lesson | Operations, Diagrams & Examples included
This lesson gives students a deep, practical understanding of Binary Search Trees, showing how ordered data is stored, searched, traversed, and modified efficiently using a full C++ implementation. Learners move beyond diagrams to see exact algorithms in action—including searching, traversal strategies, and the hardest operation: deletion—building confidence with one of the most important non-linear data structures. ────────── ⋆⋅☆⋅⋆ ────────── 🧠 What Students Will Actually Master ✨✨ ✏️
9th - 12th, Higher Education
Computer Science - Technology, Engineering, Instructional Technology
![Preview of Data Structures & Algorithms Step-by-step Curriculum Using C++ [Complete Bundle]](https://ecdn.teacherspayteachers.com/cdn-cgi/image/format=avif,quality=70,width=525,height=525,onerror=redirect/thumbitem/Complete-Data-Structures-Algorithms-Step-by-Step-Curriculum-15377190-1769843565/750f-15377190-1.jpg)
Data Structures & Algorithms Step-by-step Curriculum Using C++ [Complete Bundle]
Students struggle with Data Structures because most materials are abstract, rushed, and hard to follow. This complete, visual, step-by-step curriculum breaks every concept down using clear diagrams, structured explanations, and worked examples. Each lesson follows a logical teaching sequence that builds real understanding while saving teachers hours of preparation time. ────────── ⋆⋅☆⋅⋆ ────────── WHAT THIS CURRICULUM COVERS🧠 Foundations Introduction to Data Structures, Algorithms & Dynami
10th - 12th, Adult Education, Higher Education
Computer Science - Technology, Engineering, Instructional Technology
Hash Tables Complete Lesson | Operations, Diagrams & Examples included
This lesson teaches students how constant-time data access is achieved using Hash Tables, one of the most powerful and widely used data structures in computer science. Learners understand how keys are transformed into addresses, why collisions occur, and how different collision-resolution strategies work in practice—the same principles used in databases, compilers, and caching systems. ────────── ⋆⋅☆⋅⋆ ────────── 🧠 What Students Will Actually Master ✨✨ ✏️ What a Hash Table is and why
10th - 12th, Higher Education
Computer Science - Technology, Engineering, Instructional Technology
K-Nearest Neighbors : A Step-by-Step, Beginner-Friendly Machine Learning Lesson
This is a complete, ready-to-teach lesson on K-Nearest Neighbors (KNN). Perfect for Data Science, Machine Learning, Artificial Intelligence, and Computer Science courses at the high school, college, university, or bootcamp level. The lesson explains what KNN is, how it works, the full algorithm, distance measures, choosing K, example walkthroughs, and failure cases, all with clear visuals and step-by-step explanations. ────────── ⋆⋅☆⋅⋆ ────────── ✨✨ What This Lesson Covers ✨✨ ✔ What is K-Ne
10th - 12th, Adult Education, Higher Education
Computer Science - Technology, Engineering, Instructional Technology
VEX IQ STEM Lab: Intro to Robotics Mini-Builds | Gear Ratios & Mech. Advantage
Master mechanical motion with your VEX IQ kits! This student-ready worksheet is the perfect companion for hands-on exploration of complex mechanisms. Designed for introductory robotics students, it challenges them to analyze the movement and purpose behind four essential builds. I use this with my 7th graders in my Intro to Robotics classes. What's Covered in this Worksheet:Belt Drives: Analyzing pulley speed, direction, and function.Cam and Follower: Understanding how shape creates specific ou
6th - 8th
Computer Science - Technology, Engineering, Robotics
Artificial Neural Networks: Complete Lesson with Examples and Backpropagation
This lesson provides a complete foundation in Artificial Neural Networks, covering biological vs artificial neurons, perceptron learning, activation functions, multilayer perceptrons, feedforward networks, and backpropagation. ────────── ⋆⋅☆⋅⋆ ────────── What’s Included 💡 Full Artificial Neural Network Slide Deck (PPT + PDF)💡 Visual neuron and network architecture diagrams💡 Step-by-step perceptron learning examples💡 Worked backpropagation calculations💡 Ready for in-person, online
10th - 12th, Higher Education
Computer Science - Technology, Engineering, Instructional Technology
Showing 1-11 of 11+ results
TPT is the largest marketplace for PreK-12 resources, powered by a community of educators.
IXL family of brands