CS344 ALGORITHMS AND DATA STRUCTURES
SPRING
2006
Lecturer: James F.
Lynch
Office: SC381
Office hours: MWF 12:00PM–1:00PM and MW
2:00PM–3:00PM
Telephone: 2682374
email: jlynch@clarkson.edu
Teaching
assistant: Eric McGregor
Office: SC450
Office hours:
MWF 10:00AM–11:00AM
email: mcgregre@clarkson.edu
Lecture hours: MWF
11:00AM–11:50AM, SC–348
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: 
Wednesday, February 8 
Wednesday , March 8  
Wednesday , April 12 
PROGRAMMING
PROJECTS
SYLLABUS (TENTATIVE)





Introduction




Mathematical
foundations 

1.2,
2.2 (e), (f), 2.6, 2.10, 2.19, 2.25, 2.28 

Algorithm
analysis 



Lists,
stacks, and queues 



Lists,
stacks, and queues 



Lists,
stacks, and queues 



Binary
trees 



Binary
trees 



Binary
trees 
Ch. 6 






Nonbinary
trees 



Sorting 
Ch. 7 


Sorting,
Graphs 



Graphs 



Graphs 



Review 

