CS344 ALGORITHMS AND DATA STRUCTURES
SPRING
2008
Lecturer: James F.
Lynch
Office: SC381
Office hours: TuTh 10:00AM–11:00AM, 12:15PM–1:00PM,
2:15PM–3:00PM
Telephone: 2682374
email: jlynch@clarkson.edu
Lecture
hours: TuTh 1:00PM–2:15PM,
SC–301
Text: A Practical Introduction to Data Structures and
Algorithm Analysis, 2^{nd} edition
by Clifford A. Shaffer
PrenticeHall, ISBN 0130284467
Book
Homepage
The Complete Collection
of Algorithm Animations
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.
Programming
projects 
24% 
Three
hourly exams: 
51% 
Final
exam: 
25% 
Hourly
exam dates: 
Thursday, February 7 
Thursday, March 6  
Thursday, April 10  
Final
exam date: 
PROGRAMMING
PROJECTS
Program 1: Inventory Control System
SYLLABUS





Introduction


1.3 

Mathematical
foundations 

2.2, 2.6, 2.10, 2.17, 2.22, 2.23,
2.27 

Algorithm
analysis 



Lists,
stacks, and queues 



Lists,
stacks, and queues 



Binary
trees 



Binary
trees 



Searching 



Searching 



Internal
sorting 







Internal
Sorting 



General
Trees 



Graphs 



Graphs 



Review 

