CS507 - Data Structures and Analysis of Algorithms

(Summer Semester 1999)

Text Used

Clifford A. Shaffer: A Practical Introduction  to Data Structures and Algorithm Analysis,Prentice Hall, 1997, (this is the C++ version)

Syllabus

June 9: Data Structures and Algorithms

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

Reading: Chapter 1.

June 16: Analysis of Algorithms

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

click here for Lecture Notes (postscript version)

June 23: 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 14.

June 30: 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 21.
 

click here for Lecture Notes (postscript version)

click here for Lecture Notes (postscript version)

July 7: Trees (continued)

1. General Trees

Graphs

1. Implementations
2. Graph traversals
3. Graph related problems

click here for Lecture Notes (postscript version)

 
REVIEW FOR THE MIDTERM EXAM click here for Sample Exam (postscript version)
Note that this is an actual exam given in a Spring Semester, which is while we haven't covered some of the topics yet.

July 14: MIDTERM EXAM

Note:There will be lecturing after the exam (starting at 7:30 pm). The topic willl be Internal Sorting.

Homework Assignment 3: Problem 7.10 on page 218 of the text book.
Submit:
            1. source code by e-mail
            2. documentation based on the CS documentation template

Due date: July 28.

Homework assignment 1 was due!

July 21: Internal Sorting

1. Quadratic time Sorting
2. Fast Sorting
3. Sorting 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.

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

Due date: August 4.

Homework assignment 2 was due !

click here for Lecture Notes (postscript version)

July 28: 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 was due !

August 4 :

  Advanced Topics (not required for the final)

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

Reading: Chapters 12 and 13.
 

Homework assignment 4 was due !

August 11: FINAL EXAM

• IT WILL BE HANDED OUT AT 6:pm ON MONDAY (Auguust 09) NIGHT IN FL320
• IT WILL BE DUE AT 6pm ON WEDNESDAY NIGHT IN THE SAME CLASSROOM