CS6363: Computer Algorithms

CS 6363-001& 002: Computer Algorithms

001: -- ECSS 2.311... Fall 2007 ...... TR 10:00 -- 11:15

002: ECSS 2.203... Fall 2007 ..... MW 10:30 -- 11:45

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

Phone: (972) 883-2032

Office Hours: TR: 3:00 -- 4:00
URL: http://www.utdallas.edu/~chandra
email: see the above web page

Teaching Assistant:
Office & Hours:
email:

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 (45%); ( Exam II - (45%)

There will be no programming assignments.

Lecture #1
Lecture #2
Lecture #3
Lecture #4
Lecture #5
Lecture #6
Lower Bounds
Lecture #7
Lecture #8
Lecture #9

Page 1
 CS6363: Computer Algorithms

Lecture #10
Lecture #11
Lecture #12
Lecture #13
Lecture #14
Assignment #1
Assignment #2
Assignment #3
Assignment #4
Assignment #5
Assignment #6
Assignment #7
Assignment #8
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.

Page 2