Course
Syllabus
Spring 2008, CIS 3223
Algorithms and Data
Structures
Lectures: Tue, Thu 1:10-2:30PM, (
Lab Times: Fri 10:40
AM - 12:30 PM (Wachman Hall 104)
Instructor: Slobodan
Vucetic
Office: 304 Wachman Hall, Phone: (215) 204-5535, Email: vucetic@ist.temple.edu
Office Hours: 3 – 4:30PM Tuesdays, 10 – 11:30AM
Thursdays. Other hours by appointment
that should be scheduled at least one day in advance.
TA: Vuk Malbasa
Office:
321 Wachman
Hall, Email: vmalbasa@gmail.com
Office Hours: 3 – 4PM Thursdays and 1PM – 2PM Fridays
Course home page: http://www.ist.temple.edu/~vucetic/cis3223spring2008
Prerequisites: Grade of
C or better in C+IN SC 2166 (0166) or Mathematics 3098 (W205) and C+IN SC 2168
(0068); Grade of C or better in Mathematics 1042 (0086).
Description: Students
will learn to analyze algorithms and their associated data structures to
determine their correctness and efficiency. The algorithms studied will include
brute-force, greedy, divide-and-conquer, and back-tracking.
Algorithms using numbers, trees and graphs will be studied. Finally limitations
on algorithms will be introduced.
Textbook:
·
Cormen, Leiserson, Rivest,
& Stein. Introduction to Algorithms, 2nd ed. MIT Press, 2001.
·
Dasgupta, Papadimitriou, & Vazirani. Algorithms.
McGraw-Hill, 2008.
Description: The
following topics will be presented:
·
Mathematical Foundations of Algorithms
·
Divide-and-Conquer Algorithms
·
Data Structures
·
Graph Algorithms
·
Greedy Algorithms
·
Dynamic Programming
·
Network Flow and Linear Programming
·
NP-Complete Problems
Quizzes: There will be a number of 10-minute quizzes during
the course; all will be announced one week in advance.
Grading: Lab Assignments and Homework (30%), Project
(10%) Midterm Exam (20%), Final Exam (30%), Quizzes and Attendance
(10%).
Miscelaneous:
·
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. Students with documented disabilities should
contact Disability Resources and Services at 215-204-1280 in 100 Ritter Hall to
coordinate reasonable accommodations
·
The homework assignments are due in class, on the
specified due date. No late assignments will be accepted unless there are
legitimate circumstances. All assignments are individual, except when
collaboration is explicitly allowed. All the sources used for problem solution
must be acknowledged, e.g. web sites, books, research papers, personal
communication with people, etc. Academic honesty is taken seriously.