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 


1.  W  1/22  C++ Fundamentals  |  Chapter 1, Appendix K, Interlude 1  |  
    R  1/23  Lab 1: C++ Classes and Objects  |  lab1  |  
    F  1/24  More C++ and ADTs  |  Chapter 3  |  
    M  1/27  ADTs and Array-based Implementations  |  Chapter 3  |  p1 out

2.  W  1/29  ArrayBags  |    |  
    R  1/30  Lab 2: ADT Implementation  |  lab2, q1  |  
    F  1/31  Pointers and Dynamic Memory  |  Interlude 2  |  
    M  2/3  Linked Implementations  |  Chapter 4  |  p2 out, p1 due

3.  W  2/5  ADT Stacks and ArrayStacks  |  Chapters 6, 7  |  
    R  2/6  Lab 3: Dynamic Memory  |  lab3  |  
    F  2/7  Stack Applications  |    |  
    M  2/10  LinkedStacks  |    |  p3 out, p2 due

4.  W  2/12  ADT Queues and Linked Queues  |  Chapters 13, 14  |  
    R  2/13  Lab 3 continued  |  q2  |  
    F  2/14  ArrayQueues and Exception  |  Interlude 3  |  
    M  2/17  ArrayQueues  |    |  p4 out, p3 due

5.  W  2/19  ADT Lists  |  Chapter 8  |  
    R  2/20  Lab 4: Stacks and Queues  |  lab4, q3  |  
    F  2/21  Lists continued  |  Chapter 9  |  
    M  2/24  Mid-term 1 Review  |    |  
    T  2/25  (not a class day)  |    |  Mid-term 1

6.  W  2/26  Lists concluded  |    |  
    R  2/27  Lab 5: Data Structures Zoo  |  lab5  |  p4 due
    F  2/28  Recursion  |  Chapter 2  |  
    M  3/3  spring break  |    |  

7.  W  3/5  spring break  |    |  
    R  3/6  spring break  |    |  
    F  3/7  spring break  |    |  
    M  3/10  Recursion again  |  Chapter 5.3  |  

8.  W  3/12  Recursion concluded  |    |  
    R  3/13  Lab 6: Recursion  |  lab6, q4  |  
    F  3/14  Asymptotic Efficiency I  |  Chapter 10  |  
    M  3/17  Asymptotic Efficiency II  |    |  p5 out

9.  W  3/19  Asymptotic Efficiency III  |    |  
    R  3/20  Lab 7: Algorithmic Efficiency  |  lab7, q5  |  
    F  3/21  Sorting  |  Chapter 11  |  
    M  3/24  Simple Sorting Algorithms  |    |  p5 due

10.  W  3/26  Merge Sort  |    |  
    R  3/27  Lab 8: Sorting  |  lab8, q6  |  p6 out
    F  3/28  Quick Sort  |    |  
    M  3/31  OOP and Reuse  |  Interldue 5  |  

11.  W  4/2  Trees  |  Chapter 15  |  
    R  4/3  (no lab?)  |    |  Mid-term 2
    F  4/4  Binary Trees  |  Chapter 15, 16  |  
    M  4/7  Binary Trees, continued  |    |  p6 due

12.  W  4/9  Binary Search Trees  |    |  
    R  4/10  Lab 9: Trees  |  lab9, q7  |  
    F  4/11  Binary Search Trees, continued  |    |  
    M  4/14  Binary Search Trees, concluded  |    |  p7 out

13.  W  4/16  Dictionaries  |    |  
    R  4/17  Easter break  |    |  
    F  4/18  Easter break  |    |  
    M  4/21  Easter break  |    |  

14.  W  4/23  Academic Conferences - no classes  |    |  
    R  4/24  Lab 10: Trees and Binary Search Trees  |  lab10, q8  |  
    F  4/25  Dictionaries and Hashing  |  Chapter 18  |  
    M  4/28  Hash Tables  |    |  p8 out, p7 due

15.  W  4/30  Hash Table Implementations  |    |  
    R  5/1  Lab 11: Dictionaries  |  lab11  |  
    F  5/2  Hashing and Hash Tables, advanced  |    |  
    M  5/5  Finals review  |    |  p8 due
    

NB: Schedule is subject to change.