Syllabus
Dates Lectures Labs Readings 17 Jan - Software Engineering Lab 0: Review Dale chap 1 21 Jan Review next week's lab 24 Jan - Abstraction, ADTs, Lab 1: ADTs Dale chap 2 28 Jan classes 31 Jan - Lists, algm analysis Lab 3: Strings Dale chap 3 4 Feb 7 Feb - Stacks, dynamic arrays, Lab 4: List ADT Dale chap 4 11 Feb pointers, and templates 14 Feb - Implementing stacks and Lab 5: Stack ADT Dale Chaps 4 18 Feb queues, circular arrays 24 Feb Exam I, 6:30 PM, room Williams 202 21 Feb - Implementing lists Lab 6: Queue ADT Dale Chap 5 25 Feb using dynamic allocation 28 Feb - Different types of lists Lab 7: linked Dale Chap 6 3 Mar lists 6 Mar - Spring Break 10 Mar 13 Mar - Recursion, binary search Lab 8: Double linked lists Dale Chap 7 17 Mar 20 Mar - More recursion, quicksort No Lab Dale Chap 7 24 Mar 24 Mar Project I due. 27 Mar - Binary Search Trees Lab 9: Ordered List ADT Dale Chap 8 31 Mar 30 Mar Exam II, 6:30 PM, room Williams 202 3 Apr - BST implmentation Lab 10: Recrursion Dale Chap 8 7 Apr 10 Apr - Heaps, Priority Queues Lab 12: BST ADT Dale Chap 9 14 Apr 17 Apr - Sorting No Lab Dale Chap 10 21 Apr 21 Apr Project II due 24 Apr - Searching Lab 13: Heap ADT Dale Chap 10 28 Apr 5 May Final Exam 7:30 AM (Friday) in 310 Williams
Last Modified: 2 March 2000
THIS PAGE MAINTAINED BY:
John
Barr, Ithaca College