Week 1
Lesson 1
Stacks and Queues (M)
Implement a maze-solving algorithm that uses a stack to backtrack when it hits a dead end. This project can have a visual component, where kids can see how the path is traced and retracted, offering a tangible way to understand how stacks work.
Lesson 2
Maps/Dictionary
Word Frequency Counter: Create a program that reads a text file and uses a map to count how many times each word appears. This can be visualized by creating a histogram at the end?
Word translator
Lesson 3
Runtime Analysis
-Big O
-run time complexity
- big omega - best case
- big theta - 
The Museum of Complexity
Lesson 4
 Recursion
“Power of” recursive function for math. 
Reverse array/string
Lesson 5
Searching and Sorting
Some game that teaches the students when to use certain search and sort algorithms. It will then record the number of steps it takes to solve.
 Week 2
Lesson 6
Pointers 
Pre and Post increment 
Lesson 7
Linked Lists 
Train Car Assembly Game: Create a game where each train car represents a node in a linked list. Kids can add and remove cars, which corresponds to adding and removing nodes. They can also rearrange the cars to understand how nodes can be moved in a list.
Lesson 8
Debugging and Testing
Debugging and Testing
Lesson 9
Review
Review
Lesson 10
Final Projects
Final Projects