Week 1 (jan 8 - jan 12) Chapter 3 - Recursion
- Tuesday: Logistics
- Thursday: Pascal's Triangle, Binary Search, Towers of Hanoi
Week 2 (jan 15 - jan 19) Chapter 4 - ADTs
- Tuesday: List of Integers ADT
- Thursday: Inheritance, Java Interfaces
Week 3 (jan 22 - jan 26) Chapter 5 - Linked Lists
- Tuesday: Java Exceptions
- Thursday: Linked Lists
Week 4 (jan 29 - feb 2) Chapter 7 - Stacks
- Tuesday: Linked Lists cont., Intro to Stacks
- Thursday: Midterm 1
Week 5 (feb 5 - feb 9) Chapter 8 - Queues
- Tuesday: Stacks. cont.
- Thursday: Queues, C pointers
Week 6 (feb 12 - feb 16) Ch. 10
- Tuesday: Memory (C), Arrays/Memory Allocation (C)
- Thursday: Stack vs. Heap, Time efficiency - Search Array (Binary Search)
Week 7 (feb 19 - feb 23)
- Tuesday: Big-O notation, Big-Theta notation
- Thursday: Big-Omega, Evaluation of Bubble sort, Other sorting algorithms
Week 8 (feb 26 - mar 2)
- Tuesday: Binary Search Trees
- Thursday: Midterm 2
Week 9 (mar 5 - mar 9)
- Tuesday: Hash Tables
- Thursday: Dictionaries (C)
Week 10 (mar 12 - mar 16)
Final Exam will be held Wednesday, March 21 4:00–7:00 p.m.