School of Engineering and Applied Science
Department of Computer Science
CSci 131 -- Algorithms and Data Structures I
Spring 2001 Semester
Prof. Michael B. Feldman
mfeldman@seas.gwu.edu

Class meeting times:
Lecture Mon-Wed, 2-3:15 PM, Phillips 110
Labs: Tues., 4:10-6 PM (sect. 30), Phillips 306 and 6:10-8 PM (sect. 30), Rome 205
Lab Instructor: Anya Kim
class website: http://www.seas.gwu.edu/~csci131/spring01

Course Schedule

Week 1 1/17 Chapter 1 Abstract data types
Week 2 1/22-1/24 Chapter 2 ADTs continued
Week 3 1/29-1/31 Chapter 3 Recursion; "big O"
Week 4 2/5-2/7 Chapter 8 Linked Structures
Week 5 2/12-2/14 Chapter 4 Advanced array types
Week 6 2/19 PRESIDENTS' DAY - NO CLASS
2/21 Chapter 5 Generic templates
Week 7 2/26-2/28 Generic templates continued
Week 8 3/5 REVIEW FOR MIDTERM EXAM Come prepared with your own questions
3/7 MIDTERM EXAM Open book, covers Chaps. 1-5 and Chap. 8
Week 9 3/12-3-14 Sections 6.1 - 6.5 Variant records
3/19-3/21 SPRING RECESS - NO CLASS
Week 10 3/26-3/28 Sections 7.1-7.6 Stacks and Queues
Week 11 4/2-4/4 Sections 9.7 - 9.11 Sparse Structures
Week 12 4/9-4/11 Chapter 10 Directed Graphs
Week 13 4/16-4/18 Sections 11.1-11.8 Binary trees
Week 14 4/23-4/25 Sections 12.1-12.3 Heaps
Week 15 4/30-5/2 Chapter 14 Internal sorts
5/14 (tentative) FINAL EXAM, 1:30-3:30 PM Open book, 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 during the week it is assigned. 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!