Syllabus for CS 4349: Advanced Data Structures and Algorithms

CS 4349: 501: Advanced Algorithms Design and Analysis

ECSS 2.201 ...... Fall 2007..... TR: 5:30 -- 6:45

Instructor: R. Chandrasekaran
Office: ECSN 4.622 (Please Note that this is the OLD building!!!)

Phone: (972) 883-2032

Office Hours: TR: 3:00 -- 4:00 p.m.

URL: http://www.utdallas.edu/~chandra

Teaching Assistant:

Office & Hours:

email:

Textbook: ``Introduction to Algorithms,'' T.H. Cormen, C.E. Leiserson ,R.L. Rivest, and C. Stein, Second
Edition.

Prerequisites: CS 3345 (Data structures and algorithms): Abstract data types: lists, stacks, queues, trees,
search trees. Hashing. Priority queues: heaps. Sorting and searching. Graphs: representation and algorithms.
Running-time analysis of algorithms and order notation.

Course Objectives: Study efficient algorithms for a number of fundamental problems, learn techniques for
designing algorithms using appropriate data structures, prove correctness and analyze running times of
algorithms, .

Topics: Recurrence relations, Order notation. Divide and conquer, greedy methods, dynamic programming,
and inductive algorithms. Graph algorithms: Minimum spanning trees, Shortest path problems, Maximum flow
problems.

Grades: Assignments - 20%; Exam I - 40%; Exam II - 40%

There will be no programming assignments.

Lecture #1
Lecture #2
Lecture #3
Lecture #4
Lecture #5
Sample-Graph
Cheat-Sheet
Lecture #6
Lecture #7
Lecture #8
Lecture #9

Page 1
 Syllabus for CS 4349: Advanced Data Structures and Algorithms

Lecture #10
Lecture #11
Lecture #12
Assignment #1
Assignment #2
Assignment #3
Assignment #4
Assignment #5
Assignment #6
Solution #1
Solution #2
Solution #3
Solution #4
Solution #5
Solution #6

Student Responsibilities:

Assignments are due in class on the specified date. Turn in what is completed by the deadline for partial
credit. No late submissions will be accepted.
All submissions must be your own work. Identical assignments will not be accepted.
Regular class attendance and participation is expected and is the responsibility of each individual. There
is a strong correlation between regular class attendance and good performance. If a student should elect
not to attend a class, (s)he is responsible for any handouts, announcements, reading material and contents
of missed lectures.
You are subject to all rules pertaining to integrity of the University -- see
http://www.utdallas.edu/judicialaffairs/UTDJudicialAffairs-AcademicIntegrity.html

Page 2