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: chandra@utdallas.edu

Office Hours: W: 3:00 -- 4:00 & R: 3:30 -- 4:30
URL: http://www.utdallas.edu/~chandra
email: chandra@utdallas.edu

Teaching Assistant: Mehmet Baysan

Office & Hours: M: 3:00 -- 5:00 Open Lab; TR: 4:00 -- 6:00 ECSS 4.409
email: baysan@student.utdallas.edu

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%) - March 3 (in class); Exam II - (40%)

Review Session in ECSS 2.415 3:00 -- ?

Feb 25th
There will be no programming assignments.

l Lecture #1
l Lecture #2
l Lecture #3
l Lecture #4
l Lecture #5
l Lecture #6
l Lower Bounds
l Lecture #7
l Cheat-Sheet
l Lecture #8
l Lecture #9
 l Lecture #10
l Lecture #11
l Lecture #12
l Lecture #13
l Lecture #14
l Assignment #1
l Assignment #2
l Assignment #3
l Assignment #4
l Assignment #5
l Assignment #6
l Assignment #7
l Solution #1
l Solution #2
l Solution #3
l Solution #4
l Solution #5
l Solution #6
l Solution #7
l Sample Graph

Student Responsibilities:

l 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.
l All submissions must be your own work. Identical assignments will not be
accepted.
l 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.