CS 4349: 081: Advanced Data Structures and Algorithms
ECSS 2.203  ...... Summer 2006..... MW: 5:00 -- 7:45

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

Phone: (972) 883-2032 E-mail: [email protected]

Office Hours: W: 2:00 -- 4:00
URL: http://www.utdallas.edu/~chandra

Teaching Assistant:

Office & Hours:

Office:

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 - 10%; Exam I - 40% ; Exam II - 50% 
There will be no programming assignments.

Student Responsibilities: