CS 6363-001: Computer Algorithms
ECSS 2.311... Spring 2005 ...... TTR 2:00 -- 3:15

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

 Phone: (972) 883-2032 E-mail: [email protected]
Office Hours: W: 3:00 -- 4:00 & R: 3:30 -- 4:30
URL: http://www.utdallas.edu/~chandra
email: [email protected]

Teaching Assistant: Mehmet Baysan
Office & Hours: M: 3:00 -- 5:00 Open Lab; TR: 4:00 -- 6:00 ECSS 4.409
email: [email protected]

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

Prerequisites: CS 5343 or equivalent (Data structures and algorithms): Abstract data types: lists, stacks, queues, trees, search trees. Hashing. Priority queues: heaps. Sorting and searching. Graphs: representation and algorithms.

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

Topics: Recurrence relations, Order notation. Divide and conquer, greedy methods, dynamic programming, linear programming, and inductive algorithms. Graph algorithms: Search techniques: DFS and BFS, Minimum spanning trees, Shortest path problems, Maximum flow problems, Matchings, NP-completeness, Reductions.

Grades: Assignments -20%; Exam I (40%);  Exam II - (40%) [Review in regular classroom Friday April 22, 3:00 -- 5:00]

There will be no programming assignments.

Student Responsibilities: