The course at a glance
CS 206: Introduction to Data Structures
An introduction to the fundamental data structures of computer science: lists, stacks, queues, trees, BSTs, graphs, sets and their accompanying algorithms. Principles of algorithmic analysis and object reasoning and design will be introduced using mathematical techniques for the notions of both complexity and correctness. More practical issues, such as memory management and hashing, will also be covered.
Instructor: Geoffrey Towell , Park 204
E-Mail: gtowell at cs dot brynmawr dot edu
Office hours: T 10:00-11:00AM, W 1:00-2:00PM, or by appointment
Textbook: Data Structures and Algorithms by Goodrich, Tamassia and Goldwasser
TA hours in Park 231
Sun - Thurs 6pm-10pm
One of the following courses (or their equivalents at Haverford or Swarthmore) is required.
Or permission of the instructor.
Thursday 2:25-3:45 Park 231 (Lab attendance is required)
- Sept 5: Lab 01
- Sept 12: Lab 02 The code below is uncommented becase you are not expected to comment code you write in labs.
- Sept 19: Lab 03
- Sept 26: Lab 04
- Sept 3:
- Sept 5:
- Sept 10 Generics (Ch 2 in text):
- Sept 12 Array List (Ch 3 in text):
- Sept 17 Linked List (Ch 3 in text):
- Sept 19 Doubly Linked Lists and Circular Linked Lists (Ch 3 in text):
- Sept 24 Exceptions, Scope, and Restaurants :
- Sept 26 Analysis of Algorithms:
- Oct 1 Stacks:
- Oct 1 Queues: