CS4349.001: Advanced Algorithms Design and Analysis
FALL 2014: TR: 4:00 -- 5:15 @ ECSS 2.203

Instructor: R. Chandrasekaran
Office: ECSS 4.611

Phone: (972) 883-2032

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

email: chandra AT utdallas DOT edu

Teaching Assistant: 


Office & Hours:

email:

Teaching Assistant: 


Office & Hours:

email:

 

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:

  1. Ability to use asymptotic notations, solve recurrences, perform algorithm analysis
  2. Ability to design, analyze, and prove correctness of algorithms based on Divide-and-Conquer techniques
  3. Ability to design, analyze, and prove correctness of algorithms based on Greedy techniques
  4. Ability to design, analyze, and prove correctness of algorithms based on Dynamic Programming techniques
  5. Ability to design, analyse and prove correctness of graph 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%); Exam II:  - (25%); Exam III:  (30%) 

There will be no programming assignments.

Student Responsibilities: