CS 4349.002: Advanced algorithm design and analysis [Spring 2019; Tue/Thu 1:00-2:15 PM, ECSS 2.305]

Course Syllabus   Class log   Practice problems   eLearning

Instructor:      Balaji Raghavachari
                 [email protected]
                 ECSS 4.225

Office hours:    Tue/Thu 2:20-3:00 PM, Wed 12:00 noon-2:00 PM, and by appointment.

TA:              Julian Enoch
TA Office hours: Mon 12:00-2:00 PM, Fri 10:00 AM-12:00 noon, at ECSS 2.103B1

Announcements 3/14: Assignment 7 (due Sun, Mar 31, on elearning). 3/6: Assignment 6 (due Sun, Mar 17, on elearning). 2/21: Assignment 5 (due Sun, Mar 3, on elearning). 2/20: Topics for mid-term exam on Tue, Mar 5: Lectures 1-12, Assignments 1-5. Mathematical background, Order notation, Sums of sequences, Recurrences, Iteration, substitution and master methods, Divide and conquer (binary search, power, merge sort and merge, max subarray, quick sort and partition, selection and median), Sorting lower bound, Linear-time sorts, Dynamic programming (RCP, MCM, ASP, LCS, Knapsack). Four hand-written, 8 1/2" x 11" cheat sheets are allowed. No shared cheat sheets at the exam. Write on both sides of the paper (8 pages in all). Exam will be in class. Bring your comet card (UTD ID). 2/13: Assignment 4 (due Sun, Feb 24, on elearning). 2/6: Assignment 3 (due Sun, Feb 17, on elearning). 1/30: Assignment 2 (due Sun, Feb 10, on elearning). 1/29: Final exam: Thu, May 9: 2:00-4:00 PM. 1/23: Assignment 1 (due Sun, Feb 3, on elearning). 1/8: Syllabus Ver 1.2