| 1 |
********* |
No Class |
|
| |
Mar 31 |
General Info - Introduction - Ch2 pointers,arrays [2.3 2.4 2.5] |
|
| |
Apr 2 |
Ch2 dynamic allocation [2.7] Ch3 interfaces
- strings - files - [3.1 3.3 3.4] makefiles and debugger |
|
| 2 |
Apr 5 |
Ch3 - dynamic allocation, files, |
Lab 1 |
| |
Apr 7 |
Ch 4 - Recursion [4.1 4.2 4.5] |
|
| |
Apr 9 |
Ch5 - Recursion [5.1 5.2 5.3] |
Lab notes |
| 3 |
Apr 12 |
Ch6 - Recursion [6.1 6.2] |
Lab 2 |
| |
Apr 14 |
Ch7 - Algorithmic Analysis sorting, computational complexity [7.1 7.2] |
answers:
- lab2.c
- lab2a.c
- lab2b.c
|
| |
Apr 16 |
Ch7 - Recursive sorting, complexity classes [7.3 7.4] |
|
| 4 |
Apr 19 |
Ch7 - Quicksort, Mathematical Induction [7.5 7.6] |
Lab 3 |
| |
Apr 21 |
Ch8 - Abstract Data Types stacks [8.1 8.2 8.3 8.4] |
- stack.h
- stack.c
|
| |
Apr 23 |
Stacks - Implementation and examples |
|
| 5 |
Apr 26 |
Ch9 Efficiency and ADT's [9.1 9.2 9.3 9.4] |
Lab 4 |
| |
Apr 28 |
Ch9 Linked Lists [9.5] |
|
| |
Apr 30 |
Ch9 More on Linked Lists |
|
| 6 |
May 3 |
Review and exercises |
Lab 5 |
| |
May 5 |
*** midterm *** |
|
| |
May 7 |
Ch 10 Linear structures stacks, queues
[10.1 10.2 ] |
|
| 7 |
May 10 |
Ch 10 Simulations [10.3] |
|
| |
May 12 |
Ch 11 Tables - abstraction, hashing [11.1 11.2] |
|
| |
May 14 |
Hashing table discussion |
|
| 8 |
May 17 |
Ch 11 functions as data, mapping,
iterators, [11.5 11.6] |
Lab 6 |
| |
May 19 |
Ch 12 Recursive lists [12.1 12.2] |
|
| |
May 21 |
Ch12 Iterators; Trees |
|
| 9 |
May 24 |
Ch 13 Trees - exercises [13.1 13.2] |
Lab 7 |
| |
May 26 |
Ch 13 using binary search trees, balanced
trees, [13.2 13.3] |
|
| |
May 28 |
Ch 13 general interface for binary search trees [13.4] |
|
| 10 |
June 1 |
interfaces for trees, a glimpse of object orientation. |
|
| |
June 2 |
review and exercises |
|
| |
June 4 |
review and exercises |
|
| Final |
June 11 |
|
|