CS 6363-001: Computer Algorithms
 ECSS 2.201... Fall 2009 ...... TR 10:00 -- 11:15

Instructor: R. Chandrasekaran
Office: ECSN 4.622

 Phone: (972) 883-2032 
Office Hours: M: 2:00 -- 4:00
URL: http://www.utdallas.edu/~chandra
email: chandra AT utdallas DOT edu

Teaching Assistants: Mr. Hars Vardhan
Office & Hours: T: 4:00 -- 6:00 at ECSS 3.403; F: 5:00-7:00 at Open Lab

email: harsv AT student DOT utdallas DOT 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 appropriate data structures, prove correctness and analyze running times of algorithms, .

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

Grades: Assignments -10%; Exam I: September 22 (30%); Exam II : October 27 (30%) ; Exam III: Dec 3 (30%)

There will be no programming assignments.

• Lecture #1
• Lecture #2
• Dallas
• Lecture #3
• Lecture #4
• Lecture #5
• Lecture #6
• FFT
• Lower Bounds
• Books
• Lecture #7  
• Lecture #8
• Lecture #9
• Lecture #10
• Lecture #11
• Lecture #12
• Lecture #13
• Lecture #14
• Assignment #1
• Assignment #2
• Assignment #3
• Cheat-Sheet
• Assignment #4
• Assignment #5
• Assignment #6
• Assignment #7
• Solution #1
• Solution #2
• Solution #3
• Solution #4
• Solution #5
• Solution #6
• Solution #7

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.