CS507 - Data Structures and Analysis of Algorithms

(Summer Semester 1998)

Syllabus

Note. Homework assignments will be posted on the day they are supposed to be handed out.

June 3: Data Structures and Algorithms

1. Course objectives
2. Course overview
3. Abstract data types and data structures

Reading: Chapter 1.

June 10: Analysis of Algorithms

1. Mathematical preliminaries
2. Analyzing algorithms
3. Analyzing problems

click here for Lecture Notes (postscript version)

June 17: Fundamental Data Structures

1. Lists
2. Stacks
3. Queues

Reading: Chapter 4.

Homework Assignment 1: Project 4.6 on page 119 of the text book.

Submit:

1. source code by e-mail
2. documentation based on the CS documentation template

Due date: July 8.

June 24: Trees

1. Binary trees - Definition, properties
2. Binary tree traversals
3. Implementations
4. Binary search trees
5. Heaps and priority queues

Reading: Chapters 5.

Homework Assignment 2: Project 5.5 on page 165 of the text book.

Submit:

1. source code by e-mail
2. documentation based on the CS documentation template

.Due date: July 15.

click here for Lecture Notes (postscript version)

REVIEW FOR THE MIDTERM EXAM click here for Sample Exam (postscript version)

July 1: MIDTERM EXAM

July 8:

Trees (continued)

1. General Trees

Graphs

1. Implementations
2. Graph traversals
3. Graph-related problems
Reading: Chapter 6 and 7.
Homework Assignment 3 Problem 7.10 on page 218of the text book.

Submit:

1. source code by e-mail
2. documentation based on the CS documentation template

.Due date: July 22.

click here for Lecture Notes (postscript version)

Homework assignment 1 due !

July 15: Internal Sorting

1. Quadratic-time Sorting
2. Fast Sorting
3. Soring methods not based on comparisons
4. Lower bounds for sorting

Reading: Chapter 8.

Homework Assignment 4: Implement Quicksort for sorting an array of integers, using the median of three method for pivot selection.

click here for Lecture Notes (postscript version)

Homework assignment 2 due !

July 22: Searching and Indexing

1. Searching in lists
2. Hashing
3. Linear indexing
4. Tree indexing
5. B-Trees

Reading: Chapters 10 and 11.

Homework assignment 3 due !

July 29: FINAL EXAM

click here for Sample Exam (postscript version)

August 5: Advanced Topics (not required for the final)

1. Skip lists
2. Memory management
3. Tries
4. Splay trees

Reading: Chapters 12 and 13.