 Instructor: Prof. SungHyuk Cha
 CRN: 22108
 Meeting:
 Textbook: Mark Allen Weiss, Data Structures and Algorithms in Java,
AddisonWesley, 2000
 Course Goals:
The goals of this course are to extend and deepen the student's
knowledge and understanding of algorithms and data structures and
the associated design and analysis techniques.
We examine the basic data structures and investigate
the fundamental algorthms to manipulate them.
 Prerequisites:
CS504 (Advanced Programming) and CS507 (Mathematical Methods in Computer Science)
or equivalents
 Lecture Notes: can be accessed using the http://blackboard.pace.edu.
Blackboard Login Procedures for Registered Students are available
here
 Schedule:
Week  Topic 
1 (9/8)  Ch 1 Introduction & Ch 2 Algorithm
Analysis 
2 (9/15)
 Ch 3 Lists, Stacks, and Queues

3 (9/22)
 Ch 4 Trees

4 (9/29)
 Ch 4 Trees, HW1
due. 
5 (10/6)
 Yom Kipper: No class

6 (10/13)
 Ch 5 Hashing

7 (10/20)
 Review

8 (10/27)
 Midterm Exam

9 (11/3)
 Ch 6 Priority Queues (Heaps)

10 (11/10)
 Ch 7 Sorting

11 (11/17)
 Ch 9 Graph Algorithms

12 (11/24)
 Ch 10 Algorithm Design Techniques 
13 (12/1)
 HW 2
due and presentation

14 (12/8)
 Review 
15 (12/15)
 Final Exam

 
 Evaluation:
 Quizzes (10%): There will be 10minutes quizzes given at
the beginning of most lecture classes. Topics will be those covered
most recently.
Your lowest score on the quizzes will be dropped.
 Homework (30%): There will be two homework
assignments. They will consist of a combination of written problems
and programming asignments.
 Midterm Exam (30%): October 24th
 Final Exam (30%): December 19th
 Course Policies
 All homeworks must be submitted at the beginning of the class.
No late homework will be accepted.
 No makeup for quizzes. One missed quiz is treated as the lowest score.
