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.  W  8/27  C++ Fundamentals  |  Chapter 1, Appendix K, Interlude 1  |  
    R  8/28  Lab 1: C++ Classes and Objects  |  lab1  |  

2.  M  9/1  ADTs and Array-based Implementations  |  Chapter 3  |  p1 out
    W  9/3  Pointers and Dynamic Memory  |  Interlude 2  |  
    R  9/4  Lab 2: ADT Implementation  |  lab2, q1  |  

3.  M  9/8  Linked Implementations  |  Chapter 4  |  p2 out, p1 due
    W  9/9  ADT Stacks and ArrayStacks  |  Chapters 6, 7  |  
    R  9/11  Lab 3: Dynamic Memory  |  lab3, q2  |  

4.  M  9/15  LinkedStacks  |   |  p3 out, p2 due
    W  9/17  (no class) | |
    R  9/18  Lab 3 continued  |   |  

5.  M  9/22  ADT Queues and Linked Queues  |  Chapters 13, 14  | p4 out, p3 due 
    W  9/24  ArrayQueues and Exception  |  Interlude 3  |  
    R  9/25  Lab 4: Stacks and Queues  |  lab4, q3  |  

6.  M  9/29  ADT Lists  |  Chapter 8 ,9  |
    T  9/30  Midterm 1: Swords 321, 3pm to 5pm (?) | |  
    W  10/1  Lists continued  |   |  
    R  10/2  Lab 5: Data Structures Zoo  |  lab5  | 
    
7.  M  10/6  Recursion  |  Chapter 2  | p5 out, p4 due
    M  10/8  Recursion again  |  Chapter 5.3  |  
    R  10/9  Lab 6: Lists and Recursion  |  lab6, q4  |  

8.  M  10/13  Fall break  |    |  
    W  10/15  Fall break  |    |  
    R  10/16  Fall break  |    |  

9.  M  10/20  Asymptotic Efficiency I  |  Chapter 10  |  
    W  10/22  Asymptotic Efficiency II  |    |  
    R  10/23  Lab 7: Algorithmic Efficiency  |  lab7, q5  |  

10. M  10/27  Sorting  |  Chapter 11  |  p6 out, p5 due
    W  10/29  Merge Sort  |    |  
    R  10/30  Lab 8: Sorting  |  lab8, q6  | 

11. M  11/3  Quick Sort  |    |  
    W  11/5  OOP and Reuse  |  Interlude 5  |  
    R  11/6  (no lab) | | 
    R  11/6 Midterm 2 (during lab time) | |

12. M  11/10 Trees  |  Chapter 15  |  p7 out, p6 due
    R  11/12   Binary Trees  |  Chapter 15, 16  |  
    R  11/13  Lab 9: Trees  |  lab9, q7  |  

13. M  11/17  Binary Search Trees I |    | 
    W  11/19  Binary Search Trees II  |    |  
    R  11/20  Lab 10: Trees and Binary Search Trees  |  lab10  |  

14. M  11/24  Dictionaries and Hashing  | Chapter 18  | p8 out,  p7 due
    W  11/26  Thanksgiving break  |    |  
    R  11/27  Thanksgiving break  |    |  

15. M  12/1  Hash Table Implementations  |    |  
    W  12/3  Hashing and Hash Tables, advanced  |    |  
    R  12/4  Lab 11: Dictionaries  |  lab11, q8  | p8 due

    	
    M  12/15 Final Exam |  |

NB: Schedule is subject to change.