Decoding Strategy Chart
7+ results
Filters
Grade
Subject
Format
Resource type
Programs & methods
Algorithm Analysis & Design | Complete Step-by-Step Curriculum
This Curriculum covers algorithm design strategies, mathematical analysis, time and space complexity, growth rates, searching, sorting, graph algorithms, and pattern algorithms, with each unit standing as a complete, self-contained lesson while also fitting into a cohesive full course. ────────── ⋆⋅☆⋅⋆ ────────── Curriculum Structure & Coverage 1. Foundations of Algorithms ✏️ Introduction to Algorithms ✏️ Algorithm definition and characteristics ✏️ Algorithm analysis and design concept
10th - 12th, Adult Education, Higher Education
Computer Science - Technology, Engineering, Instructional Technology
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
Sorting Algorithms II: Counting Sort, Radix Sort, and Merge Sort with Algorithm
This lesson provides a complete foundation in advanced Sorting Algorithms, covering Counting Sort, Radix Sort, and Merge Sort, including step-by-step execution, divide-and-conquer strategy, non-comparison sorting, and time complexity analysis. ────────── ⋆⋅☆⋅⋆ ────────── What’s Included 💡 Full Sorting Algorithms II Slide Deck (PPT + PDF) 💡 Step-by-step visual sorting diagrams💡 Python code implementations💡 Worked sorting examples and traces💡 Ready for in-person, online, or hybrid
9th - 12th, Adult Education, Higher Education
Computer Science - Technology, Engineering, Instructional Technology
Also included in: Algorithm Analysis & Design | Complete Step-by-Step Curriculum
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
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
Merge Sort Complete Lesson | Operations, Diagrams & Examples included
This lesson teaches students how efficient sorting works at scale using Merge Sort, a classic divide-and-conquer algorithm known for its consistent performance. Learners clearly see how an array is recursively divided, how sorted subarrays are merged, and why Merge Sort outperforms basic sorting algorithms—all supported by a complete C++ implementation. ────────── ⋆⋅☆⋅⋆ ────────── 🧠 What Students Will Actually Master ✨✨ ✏️ What Merge Sort is and why it’s efficient ✏️ The Divide & C
9th - 12th, Higher Education
Computer Science - Technology, Engineering, Instructional Technology
AI Literacy & Prompt Writing Lesson | The PROMPT Protocol | Grades 6-12 -No Prep
Your students are already using AI. The real question isn't whether — it's whether anyone has taught them to use it well. The PROMPT Protocol is a done-for-you AI literacy lesson that teaches students a clear, six-step framework for writing prompts that actually work — and for thinking critically about what AI gives back. No tech degree, no accounts to set up, no prep period sacrificed. You read the slides; the framework does the teaching. Print it the period before, or open it in Canva or Googl
7th - 12th, Higher Education
Computer Science - Technology, Informational Text, Other (ELA)
Showing 1-7 of 7+ results
TPT is the largest marketplace for PreK-12 resources, powered by a community of educators.
IXL family of brands