CS 6363.004: Design and analysis of computer algorithms [Spring 2019; Tue/Thu 10:00-11:15 AM, ECSW 1.355]

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:              Yu Lin
                 [email protected]
TA Office hours: Tue/Thu: 11:30 AM - 1:30 PM, ECSS 2.104A1 (open lab)

Announcements 5/2: List of topics for final exam 4/22: Details about Final exam on Thu, May 9 at 11:00 AM 4/10: Assignment 5 (due Sun, Apr 28, on elearning). 3/27: Assignment 4 (due Sun, Apr 14, on elearning). 3/7: Mid-term exam on Thu, March 14: Topics: Contents of Lectures 1-14, Assignments 1-3. Mathematical background, Order notation, Sums of sequences, Approximating sums (Appendix A), Recurrences, Iteration, substitution and master methods, Divide and conquer (binary search, power, multiplication of n-bit integers (Karatsuba), 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), Greedy algorithms (ASP, Huffman). There will be no questions on FFT, Convex hull, Closest pair. Two hand-written, 8 1/2" x 11" cheat sheets are allowed. Write on both sides of the paper (4 pages in all). No shared cheat sheets at the exam. Exam will be in class. Bring your comet card (UTD ID). 2/20: Assignment 3 (due Sun, Mar 10, on elearning). 2/13: Assignment 2 (due Sun, Feb 24, on elearning). 1/30: Assignment 1 (due Sun, Feb 10, on elearning). 1/29: Final exam: Thu, May 9: 11:00 AM-1:00 PM. 1/8: Syllabus Ver 1.2