Week 1
Lesson 1
Lecture
-> Number Systems
-> Recursion
-> Branching, ‘What does this Program Do?’
Lesson 2
Practice
-> Conversions between number systems
-> Solving Recursive Functions
-> Predicting output for sections of pseudocode that use branching
-> Official Programming Problem from past ACSL contests
Lesson 3
Final Review and Contest 1
		-> Review and Preparation
		-> ACSL Previous Contest problem sets
Lesson 4
Lecture 2
		-> Prefix and Postfix Notations
		-> Bit-String Flicking
		-> Loops, ‘What does this program do?’
Lesson 5
Practice
		-> Evaluating expressions of different notations
		-> Solving bit-string based expressions
		-> Predicting output for sections of pseudocode that use loops
		-> Official Programming Problem from past ACSL contests
 Week 2
Lesson 6
Final Review and Contest 2
		-> Review and Preparation
		-> ACSL Previous Contest problem sets
Lesson 7
Lecture 3
		-> Booleans, boolean operators and conditionals
		-> Laws of Boolean Algebra
		-> Data Structures: Binary Trees, Stacks, Queues
		-> Arrays, ‘What does this program do?’ 
Lesson 8
 Practice
		--> Evaluating boolean expressions
		-> Building and using binary trees, stacks, and queues
		-> Predicting output for pseudocode using arrays
-> Official Programming Problem from past ACSL contests
Lesson 9
Final Review and Contest 3
		-> Review and Preparation
		-> ACSL Previous Contest problem sets
Lesson 10
Lecture 4
		-> Reading and creating undirected graphs 
		-> Adjacency matrices, cycles, and other graph theory
		-> Boolean Circuits
		-> Strings, ‘What does this program do?’
 Week 3
Lesson 11
 Practice
-> Evaluating factors about directed and undirected graphs
		-> Simplifying expressions for digital circuits using boolean gates
		-> Predicting output for pseudocode using Strings
		-> Official Programming Problem from past ACSL contests
Lesson 12
Final Review 
		-> Review and Preparation
		-> ACSL Previous Contest problem sets
Lesson 13
Review
Review
Lesson 14
Review
Review
Lesson 15
Review
Review