Schedule

This schedule will give you an idea of the order of topics and chapters that will be covered. It may change during the semester depending on how quickly we cover the various topics.

Lecture slides and other handouts can be found in our Shared Drive.

[p1]: assn/hw1.pdf       
[p2]: assn/hw2.pdf       
[p3]: assn/hw3.pdf       
[p4]: assn/hw4.pdf       
[p5]: assn/hw5.pdf       
[p6]: assn/hw6.pdf       
[p7]: assn/hw7.pdf       
[p8]: assn/hw8.pdf       
[lab1]: lab1.pdf 
[lab2]: lab2.pdf 
[lab3]: lab3.pdf
[lab4]: lab4.pdf
[lab5]: lab5.pdf
[lab6]: lab6.pdf
[lab7]: lab7.pdf
[lab8]: lab8.pdf
[lab9]: lab9.pdf
[lab10]: lab10.pdf
[lab11]: lab11.pdf


1.  T  1/20  C++ Fundamentals  |  Ch. 1, Appx. K, Interlude 1  |  Lab A - lab1
    W  1/21  Lab 1: C++ Classes and Objects | | Lab B - lab1                                          
    R  1/22  ADTs and Array-based Implementations  |  Ch. 3  |  

2.  T  1/27  Pointers and Dynamic Memory |  Interlude 2  |  Lab A - lab2, p1 out, q1
    W  1/28  Lab 2: ADT Implementation |  | Lab B - lab2, q1  |  
    R  1/29  Linked Implementations |  Ch. 4  |  

3.  T  2/3   ADT Stacks and ArrayStacks | Ch. 6, 7  |  Lab A - lab3, p2 out, p1 due, q2
    W  2/4   Lab 3: Dynamic Memory |  | Lab B - lab3, q2  |  
    R  2/5   LinkedStacks|    |  

4.  T  2/10  ADT Queues and Linked Queues | Ch. 13, 14  | Lab A - lab3 continued, p3 out, p2 due
    W  2/11  Lab 3: Dynamic Memory - continued | | Lab B - lab3 continued 
    R  2/12  ArrayQueues and Exception  | Interlude 3  |  

5.  T  2/17  ADT Lists  | Ch. 8 ,9   | Lab A - lab4, p4 out, p3 due
    W  2/18  Lab 4: Stacks and Queues |  | Lab B - lab4
    R  2/19  Midterm 1 

6.  T  2/24  Recursion | Ch. 2   | Lab A - lab5, q3 
    W  2/25  Lab 5: Data Structures Zoo | | Lab B - lab5, q3 
    R  2/26  Recursion again |  Ch. 5.3  | p5 out, p4 due
    
7.  T  3/3   Spring Break |    | 
    W  3/4   Spring Break |    |  
    R  3/5   Spring Break |    |  

8.  T  3/10   Asymptotic Efficiency I | Ch. 10   | Lab A - lab6, q4
    W  3/11   Lab 6: Lists and Recursion | | Lab B - lab6, q4
    R  3/12   Asymptotic Efficiency II |    |  

9.  T  3/17   Sorting  | Ch. 11   | Lab A - lab7, q5 
    W  3/18   Lab 7: Algorithmic Efficiency |  | Lab B - lab7, q5  
    R  3/19   Merge Sort  |   |  p6 out, p5 due

10. T  3/24   Quick Sort  |  | Lab A - lab8, q6
    W  3/25   Lab 8: Sorting | | Lab B - lab8, q6    
    R  3/26   OOP and Reuse  | Interlude 5 | 

11. T  3/31   Midterm 2 
    W  4/1    Easter Break 
    R  4/2    Easter Break 
    

12. T  4/7    Trees  |  Ch. 15  |  Lab A - lab9, q7
    W  4/8    Lab 9: Trees  | | Lab B - lab9, q7  |  
    R  4/9    Binary Trees  | Ch. 15, 16 |  p7 out, p6 due

13. T  4/14   Binary Search Trees I |  |   Lab A - lab10, q8
    W  4/15   Lab 10: Trees and Binary Search Trees  | | Lab B - lab10, q8  |  
    R  4/16   Binary Search Trees II   |  

14. T  4/21  Dictionaries and Hashing  | Ch. 18  | no lab, p8 out,  p7 due
    W  4/22  Aacademic conference day | | no lab   
    R  4/23  Hash Table Implementations   |    |  

15. T  4/28  Hashing and Hash Tables, advanced |  | Lab A - lab11, q9  |  
    W  4/29  Lab 11: Dictionaries  |  | Lab B - lab11, q9  |  
    R  4/30  Final exam review session | | p8 due

    	
    M  5/11 Final Exam |  |

NB: Schedule is subject to change.