4349.HON & CS4349.003: Advanced Algorithms Design
4349.HON: TR: 10:00 -- 11:[email protected] 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
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.