Spring 2017 Lecture Notes Tutorials Exam Info Course Policies Announcements

There will be NO TUTORIAL on Friday, February 3, 2017
The first Tutorial will be on Tuesday, February 7, 2017

Tutorial Questions are meant to help you understand the algorithms taught in class and how to use the techniques taught in class to design new algorithms.

Tutorials will be posted here the week before the tutorial occurs. Please try and solve the problems yourself before going to the tutorial. The TAs will work through solutions during the tutorial sections and solutions will be posted AFTER the tutorials for that week are completed

A good extra selection of extra practice problems for this class can be found in the free book
Problems on Algorithms, Second Edition, by Ian Parberry and William Gasarch, 2002.

	Week	Topics	Questions	Solutions	Other Material
2	7, 10 Feb	Review of Asymptotic Notation	pdf	pdf
3	14, 17 Feb	Recurrences, Divide & Conquer	pdf	pdf
4	21, 24 Feb	Sorting, Recurrences, Randomization	pdf	pdf	QS1, QS2 MS1, MS2
5	28 Feb, 3 Mar	Quicksort, Heaps	pdf	pdf	Nuts & Bolts Decrease Key
6	7, 10 March	Heaps, Lower Bounds, Greedy	pdf	pdf
7	21, 24 March	Dynamic Programming	pdf	pdf
8	28, 31 March	More DP, Beginning Graphs Note: The DFS problems in the questions will not be done this week. They will be deferred to next week.	pdf	pdf	Max-Sum
9	7, 10 April	DFS, Minimum Spanning Trees Union Find	pdf	pdf	Kruskal +UF
10	21, 25 April	Topological Sort, Shortest Paths	pdf	pdf
11	28 April 2 May	Shortest Paths, Max-Flow	pdf	pdf	Floyd Warshall
12	5, 9 April	NO TUTORIAL