CS 6363: Computer Algorithms

ECSS 2.415 Fall 2005 MWF 15:00-15:50

August 19, 2005

Instructor: Balaji Raghavachari

Office: ECS 4.611 Phone: (972) 883-2136 E-mail: rbk@utdallas.edu
Office Hours: Mon/Tue/Wed: 1:00-2:20 pm.
URL: http://www.utdallas.edu/~rbk/6363.html
Teaching Assistant: To be announced.
Textbook: “Introduction to Algorithms, 2nd edition,” Cormen, Leiserson, Rivest, and Stein.

Prerequisite. 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. Running-time analysis of algorithms and order notation.
Note: If you don’t satisfy the above prerequisites, you may not register for this course.

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

Topics: Algorithm design techniques: Divide and conquer, Dynamic programming, Greedy
algorithms. Graph algorithms: Search techniques: DFS and BFS, Minimum spanning trees,
Shortest path problems, Transitive closure, Matchings, Maximum flow problems.
NP-completeness, Reductions, Approximation algorithms. Linear Programming: Formulation,
Algorithms, Duality theory.

Grades: Assignments – 10; Midterm exams – 25+25; Final exam – 40. There will be no
programming assignments. Grades are determined from the total points as follows:
(1) 85 or more : A, (2) between 70 and 85 : B, (3) between 60 and 70 : C.

Exam Schedule
Exam Day Time Duration
Midterm September 23 (Friday) 02:30-03:45 pm 75 minutes
Midterm October 28 (Friday) 02:30-03:45 pm 75 minutes
Final November 30 (Wednesday) 02:00 pm-04:00 pm 120 minutes

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.
Solutions copied from the internet will be given zero credit.

• 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.