Section 001. Spring 2009
Syllabus
Instructor
Dr. Pei Wang
OFFICE: Room 1050, Wachman Hall (Computer Activity Building)
ADDRESS: CIS Department, Temple University, Philadelphia, PA 19122
PHONE: (215)204-9255
EMAIL: pei.wang@temple.edu
Time/Place
Lecture: Tuesday/Thursday 2:40 - 4:00 PM, Tuttleman Learning Center 1A
Office Hours: Tuesday/Thursday 1:10 - 2:30 PM, and by appointment
Lab: Friday 10:40 AM - 12:30 PM, Wachman Hall 104
Prerequisites
Grade of C or better in the CS theory course (C+IN SC 2166 (0166), 3211 (0211), or 3242 (0242)) and in C+IN SC 2168 (0068); Grade of C or better in Mathematics 1042 (0086)
Course Description
Comparative analysis of algorithms and data structures. Data structures include heaps, priority queues, binary and general trees, binary search trees, AVL trees, Red-Black trees, B-trees, and graphs. Algorithms include heapsort, topological sort, breadth-first search, depth-first search, shortest path algorithms, and Greedy algorithms. Students will gain experience working in a group on at least one moderate-size project.
Textbooks
Required:
Dasgupta, Papadimitriou, & Vazirani. Algorithms. McGraw-Hill, 2008
Koffman & Wolfgang. Objects, Abstraction, Data Structures and Design using
Java Version 5.0. John Wiley & Sons, 2005
Recommended:
Cormen, Leiserson, Rivest, & Stein. Introduction to Algorithms, 2nd ed. MIT Press, 2001
Schedule
See course website at
http://www.cis.temple.edu/~pwang/3223-DA/3223-index.htm
Attendance
Attendance to all lectures, labs, and examinations is required.
Grading
- Assignments: 40%
- Mid-term Exam: 25%
- Final Exam: 35%
All of the above must be the student's own work. Plagiarism and academic
cheating will be punished.
Disability Disclosure Statement
Any student who has a need for accommodation based on the impact of
a disability should contact me privately to discuss the specific situation
as soon as possible. Contact Disability Resources and Services at 215-204-1280
in 100 Ritter Annex to coordinate reasonable accommodations for students with
documented disabilities.