Contact  Textbook  Grading  Objective  Background  Schedule&Materials
Note: TA office hours are held in FL A20 (Fuller basement)
unless otherwise noted.
Twenty three TA office hours per week.
Schedule:
Day  Time  TA 
Monday  810  Ganga 
Monday  13  Luping 
Monday  45  James 
Tuesday  810  Ganga 
Tuesday  111  Rahul 
Tuesday  13  Kim 
Wednesday  811  Luping 
Thursday  89  Ganga 
Thursday  1112  Luping 
Thursday  13  Li 
Thursday  45  Kim 
Thursday  912 midnight in FL B11  Kim 
Friday  23  James 
Section  Time  Place 
B01  W 99:50  FLB11 (zoo lab) 
B02  W 1010:50  FLB11 (zoo lab) 
B03  W 12:0012:50  FLB11 (zoo lab) 
B04  W 1:001:50  FLB11 (zoo lab) 
B05  W 2:002:50  FLB11 (zoo lab) 
B06  W 88:50  FLB11 (zoo lab) 
B07  W 3:003:50  FLB11 (zoo lab) 
B08  W 1111:50  FLB11 (zoo lab) 
B09  W 1010:50  FLB17 (garden lab) 
B10  W 99:50  FLB17 (garden lab) 
B11  W 1111:50  FLB17 (garden lab) 
C++ will be used as the implementation language throughout the course. Certain relevant features of C++ will be pointed out as we go along. However, this is not a course about C++. In particular, you may need to develop the necessary facility in certain features of C++ through additional selfstudy. The homeworks and labs are intended to facilitate this process.
Week  Reading / Assignments (textbook) 
Topics  Materials
PowerPoint slides:

Oct. 2829  section 1.1 sections 2.12.3 
Abstract data types
C++ classes 
PowerPoint slides

Nov. 1  5  sections 2.42.5 chapter 3 section 1.2 sections 4.14.4 appendix F HW1 (due by 5 pm, Nov. 5) Solution to HW1: 
Input/output streams
Operator overloading The List ADT Pointers Dynamic memory Dynamic arrays Dynamic classes 
PowerPoint slides

Nov. 812
Test 1, Nov. 11 
chapter 5
HW2 (due by 5 pm, Nov. 12) 
Linked lists Running time analysis LL vs. dynamic arrays 
PowerPoint slides

Nov. 1519  chapters 6, 7, 8, 9  Template functions Template classes Stacks Queues Recursion 
PowerPoint slides

Nov. 2223  chapter 10  Binary trees  PowerPoint slides

Nov. 29  Dec. 3
Test 2, Dec. 2 
chapters 10, 12
appendix F Langsam et al, 7.2 Test 2 Practice Problems
HW4 (due by 8 pm, Dec. 3) 
Binary tree toolkit AVL trees Binary search Complexity analysis 
PowerPoint slides

Dec. 610  chapters 12, 13
section 14.3 Lab 5
HW5 (due by 5 pm, Dec. 10) 
Hash tables Open addressing Quadratic probing Complexity analysis O(n^{2}) sorting O(n log n) sorting Derived classes 
PowerPoint slides

Dec. 1317
Test 3, Dec. 16 
chapter 15  Graphs 