CS344 DATA STRUCTURES
SPRING 2005


Lecturer: James F. Lynch
Office: SC-381
Office hours: MW 10:00AM-11:00AM, TuTh 9:30AM-11:30AM
Telephone: 268-2374
email: jlynch@clarkson.edu

Teaching assistant: Uday Nayak
email: udaychandra@hotmail.com

Lecture hours: TuTh 2:30PM-3:45PM Snell Hall  112
Text: A Practical Introduction to Data Structures and Algorithm Analysis, by Clifford A. Shaffer
          Prentice-Hall, ISBN 0-13-028446-7


OBJECTIVES

The course will teach students how to use the fundamental data structures of computer science in a wide variety of applications. It will also cover methods for analyzing the advantages and disadvantages of different algorithms so that students can decide which algorithm to choose for a particular application.


ASSESSMENT

Grading will be based on homework assignments and exams. Homework assignments will consist of programming projects and written assignments that will serve as preparation for the exams..

Written homework:

5%

Programming projects

25%

Three hourly exams:

45%

Final exam:

25%

Hourly exam dates:

Thursday, February 3

 

Thursday, March 3

 

Thursday, April 7


 



SYLLABUS


Week of


Topics


Text


Exercises


January           2

Introduction

Ch. 1


                      9

Mathematical foundations

Ch. 2

 


                   
16

Algorithm analysis

Ch. 3

 


                    23

Lists, stacks, and queues

Ch. 4

 


                    30

Lists, stacks, and queues

Ch. 4

 


February        6

Binary trees

Ch. 5

 


                    13

Binary trees

Ch. 5

 


                    20

Non-binary trees

Ch. 6

 


                    27

Internal sorting

Ch. 7

 


March            6

Internal sorting

Ch. 7

 


                    13

File processing and external sorting

Ch. 8

 


                    20

Searching

Ch. 9

 


                    27

Indexing

Ch. 10

 


April              3

Graphs

Ch. 11

 


                    10

Graphs

Ch. 11

 


                    17

Review