CS344 DATA STRUCTURES
SPRING 2005
Lecturer: James F.
Lynch
Office: SC381
Office hours: MW 10:00AM11:00AM, TuTh 9:30AM11:30AM
Telephone:
2682374
email: jlynch@clarkson.edu
Teaching assistant: Uday Nayak
email: udaychandra@hotmail.com
Lecture
hours: TuTh 2:30PM3:45PM Snell Hall 112
Text: A Practical Introduction to
Data Structures and Algorithm Analysis, by Clifford A. Shaffer
PrenticeHall, ISBN 0130284467
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





Introduction 



Mathematical foundations 



Algorithm analysis 



Lists, stacks, and queues 



Lists, stacks, and queues 



Binary trees 



Binary trees 



Nonbinary trees 



Internal sorting 



Internal sorting 



File processing and external sorting 



Searching 



Indexing 



Graphs 



Graphs 



Review 

