TPT
Total:
$0.00
Preview of Searching Algorithms Lesson: Linear, Binary, Jump & Interpolation Search

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────────── ⋆⋅☆⋅⋆ ─────
Preview of Math Project-Based Learning Bundle (Grades 6–8) | Real-World Math Projects

Math Project-Based Learning Bundle (Grades 6–8) | Real-World Math Projects

Looking for engaging, real-world math projects that actually work in middle school classrooms? This Math Project-Based Learning Bundle includes a collection of hands-on math projects designed for Grades 6-8. Each project connects math concepts to meaningful, real-life contexts, helping students build conceptual understanding, problem-solving skills, and confidence in math while having fun! This bundle includes hands-on, real-world math projects designed to build student engagement while reinfor
Preview of AP® Computer Science A: 9 Recursion (Slides)

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
Preview of Algorithm Analysis & Design | Brute Force and Exhaustive Search Complete Lesson

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 +
Preview of Binary Search Tree Complete Lesson  | Operations, Diagrams & Examples included

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 ✨✨ ✏️
Preview of Unit 5.2 - Settlement Patterns -  20 Slide Powerpoint  - AP Human Geography

Unit 5.2 - Settlement Patterns - 20 Slide Powerpoint - AP Human Geography

AP HUMAN GEOGRAPHY — UNIT 5: AGRICULTURE & RURAL LAND USEUNIT 5.2: SETTLEMENT & SURVEY PATTERNS — POWERPOINT PRESENTATIONClear, flexible, and built for real classrooms. This Unit 5.2 PowerPoint presentation includes 20 slides that help students understand how rural settlement patterns and land survey systems shape agricultural landscapes. The lesson focuses on clustered, dispersed, and linear settlements, along with major survey systems and their lasting spatial impacts. Slides are built so te
Preview of MATHS/REASONING - Heptathlon Heroes; using maths to calculate athletic supremacy

MATHS/REASONING - Heptathlon Heroes; using maths to calculate athletic supremacy

MATHS/REASONING - Heptathlon is a notoriously difficult Olympic event to score. Designed as a test of pure athleticism, the event is often criticised for its mathematical formulas used in scoring - does the current model hold up? In this workshop, students will learn; - What a weighted mean is - How weighted decision tables are used - The value of exponents in formulas compared with linear equations using different operations - How to analyse data to measure athletic prowess - How to - How to s
Preview of Data Structures & Algorithms Step-by-step Curriculum Using C++ [Complete Bundle]

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
Preview of Hash Tables Complete Lesson | Operations, Diagrams & Examples included

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
Preview of K-Nearest Neighbors : A Step-by-Step, Beginner-Friendly Machine Learning Lesson

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
Preview of Artificial Neural Networks: Complete Lesson with Examples and Backpropagation

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
Showing 1-11 of 11+ results