The class slides come with some slight modifications from Prof. Bayliss cs2 and cs3 notes.
More class slides from Prof. Adams' cs2 and cs3 notes.
| Week | Extra Material | Notes |
|---|---|---|
| 1 | Linked List Code | This Linked List implementation uses generics. |
| 3 | Search Sample Code | Iterative versions of linearSearch and binarySearch both using generics. |
| 4 | Recursive Functions | Recursive versions of linearSearch and binarySearch both using generics. |
| 5 | Sort algorithms | Code for the five sort routines discussed in class.
Some information on using heaps |
| Exam | Date/Time | Location | Study Guide | Review Session | Notes |
|---|---|---|---|---|---|
| Exam 1 | March 30th | Bld. 70 Auditorium | |||
| Exam 2 | April. 27th | Bld. 70 Auditorium | |||
| Final | TBA |
| Note Number | Note |
|---|
Phil's home Page