Gary D. Brown
CIS 11: Data Structures and Algorithms
Spring 2008

Section 4525

Tuesdays & Thursdays 10:30 am to 12:00 pm

Room 2921

Schedule

Topics:

The following major topics will be addressed. There may be some necessary adjustments to the schedule, depending upon the time used by activities, questions, etc.

Week Ending Topic Projects Due* Absolute Deadline**
January 17 Course Introduction    
24 Ch 1 Phases of Software Development Check In***  
31 Ch 2 ADTs and C++ Classes    
February 7 Ch 3 Container Classes    
14 Ch 4 Pointers and Dynamic Arrays A: Ch 2  
22 Ch 5 Linked Lists B: Ch 3  
29 Ch 6 Templates, Iterators & the STL C: Ch 4 A
March 7 Exceptions
Ch 7 Stacks
D: Ch 5 B
14 Ch 8 Queues E: Ch 6
C
21 Exam 1 (Ch 1-8) F: Ch 7 D
April 4 Ch 9 Recursion G: Ch 8 E
11 Ch 10 Trees   F
18 Ch 11 Tree Projects H: Ch 9 G
25 Ch 12 Searching I: Ch 10  
May 2 Ch 13 Sorting J: Ch 11 H
9 Ch 14 Inheritance K: Ch 12 I
16 Ch 15 Graphs L: Ch 13, M: Ch 14**** J
23 May 20: Exam 2 (Ch 9-15) 10:00 a.m. N: Ch 15**** K-N

* Due dates and deadlines are Friday midnight of the week of the indicated ending date. Only projects that compile and run error-free by their due dates will receive credit or, if they do not meet specifications, be eligible for resubmission before the absolute deadline. Trivial submissions will not be considered.

** Resubmissions will not be accepted after their absolute deadlines. No more than three submissions will be allowed.

*** Failure to submit a valid checkin by Friday, midnight will result in a penalty equal to one project and an ineligibilty to submit assignments.

**** Optional.

2008/05/17