School of Engineering and Applied Science
Department of Computer Science
CSci 131 -- Algorithms and Data Structures I
Fall 2002 Semester
Prof. John Sibert
sibert@seas.gwu.edu

Class meeting times:
Lecture Tue-Thu, 4:10-5:25 PM, Media and Public Affairs 309

class website: http://www.seas.gwu.edu/~csci131/fall02

Course Schedule

Week 1
9/3-5
Chapter 1
Orientation; Abstract data types
Week 2
9/10-12
Chapter 2
ADTs continued
Week 3
9/17-19
Chapter 3
Recursion; "big O"
Week 4
9/24-26
Chapter 8
Linked Structures
Week 5
10/1-3
Chapter 4
Advanced array types
Week 6
10/8-10
Chapter 5
Generic templates
Week 7
10/15
REVIEW FOR MIDTERM EXAM
Come prepared with your own questions
Week 7
10/17
MIDTERM EXAM
Chaps. 1-5 and Chap. 8
Week 8
10/22-24
Sections 6.1 - 6.5
Variant records
Week 9
10/29-31
continued
Week 10
11/5-7
Sections 7.1-7.6
Stacks and Queues
Week 11
11/12-14
Chapter 10
Directed Graphs
Week 12
11/19-21
Sections 11.1-11.8
Binary trees
Week 13
11/26
Sections 12.1-12.3
Priority Queues and Heaps
Week 13
11/28
Thanksgiving no class
Week 14
12/3
Chapter 14
Internal sorts

12/5
 Review
12/17
FINAL EXAM, 4-6 PM
Covers all course material

Required Textbook

The required text is Feldman, Software Construction and Data Structures with Ada 95, Addison-Wesley, published June 1996 (ISBN 0-201-88795-9). Read each chapter before the week it is assigned; there will be a short reading quiz on most Mondays. The book discusses much more than I can cover in class, and I will cover things not in the book. You must come to class prepared!