CS 4349.HON & CS4349.003: Advanced Algorithms Design and Analysis
4349.HON: TR: 10:00 -- 11:15@ ECSS 2.201

Instructor: R. Chandrasekaran
Office: ECSN 4.622 (Please Note that this is the EE side of ECS Complex!!!)

Phone: (972) 883-2032

Office Hours: W 10:00 -- 12:00
URL: http://www.utdallas.edu/~chandra

email: chandra AT utdallas DOT edu

Teaching Assistant: Mr. Suhel Patel
Office & Hours: M: 12:00 --2:30 & T 10:00--12:00 @ ECSS 3.605 [This is for both sections]

email: patel AT utdallas DOT edu

Textbook: ``Introduction to Algorithms,'' T.H. Cormen, C.E. Leiserson ,R.L. Rivest, and C. Stein, Third Edition.

Prerequisites: CS 3345 (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.

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: Order Notation, Recurrence relations. Divide and conquer, greedy methods, dynamic programming. Graph algorithms: Minimum spanning trees, Shortest path problems, Maximum flow problems.

Grades: Assignments -20%; Exam I: (25%) September 23; Exam II:  - (25%) October 28 ; Exam III:  (30%)  December 2 (Firm!).

There will be no programming assignments.

• Lecture #1
• Lecture #2
• Lecture #3
• Lecture #4
• Lecture #5
• Lecture #6
• Lecture #7
• Cheat-Sheet
• Lecture #8
• Lecture #9
• Lecture #10
• Lecture #11
• Lecture #12
• Lecture #13
• Assignment #1
• Schedule-Tournaments
• Assignment #2
• Assignment #3
• Assignment #4
• Assignment #5
• Assignment #6
• Challenge Problems
• Sample-Graph
• Solution #1
• Solution #2
• Solution #3
• Solution #4
• Solution #5
• Solution #6

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.
• You are subject to all rules pertaining to integrity of the University -- see http://www.utdallas.edu/judicialaffairs/UTDJudicialAffairs-AcademicIntegrity.html