CS 610 Data Structures and Algorithms

TA: Piyasi Choudhury (GITC 4111)

Basic course information handout. Introduction. Homework due Monday, Feb. 11: R-1.6, R-1.25, C-1.26, C-1.32, C-1.33, P-1.3. Probability Review. Heaps. Homework due Monday, Feb. 25: C-2.23, C-2.31, C-2.28, C-2.30. Binary Search Trees. Solutions to HW1. Practice midterm 1. Solutions to HW2. Homework due Wed., March 12: C-3.29, C-3.30, C-4.19. Practice: C-3.12, C-3.13. Quicksort and lower bound. Linear-time sorting and selection. Solving recurrences. Greedy algorithms. Solutions to HW3. Dynamic Programming. Practice midterm 2. Solutions to HW4. Elementary graph algorithms. Weighted graph algorithms. First practice final. Second practice final. More practice problems.