Spring 2007 Data Structures and Algorithms Comprehensive Exam Review Problems
Disclaimer: The following review problems are not in any way necessarily indicative of the phrasing or difficulty of the questions on the comps. These are simply problems provided to aid your studying as a reminder of the subject matter. By posting this, we are NOT implying that this list of questions is at all comprehensive.
Comprehensive Exam Topics provides a list of topics and associated references to chapters and sections of "Introduction to Algorithms", 2nd Edition, that should be read for complete mastery of the material.
Sorting and Binary Heap Problems for February 16th
February 16: We only covered Problem 1 today. Next week we will try to finish the remaining problems and also complete next week's scheduled set of problems. Come prepared!!!
Growth of Functions and Algorithm Complexity for February 23rd
February 23rd: We finished half of the Growth of Functions review. We will finish it next week and also the Master Method review.
Recursion and the Master Method for March 2nd
Graph Algorithms for March 9th
Dynamic Programming for March 16th
Divide and Conquer Algorithms for March 23rd
Greedy Algorithms for March 30th