This is the archived website of SI 335 from the Spring 2015 semester. Feel free to browse around; you may also find more recent offerings at my teaching page.
This exam is cumulative and will cover the all the material from Units 1-7.
You should have a solid understanding of the meaning and uses of the following concepts
You should know the following techniques and be able to apply them:
You should be very familiar the following algorithms, including their analysis and how to apply them:
Sorted Array Search Problem
Sorting problem, using comparisons
Recursive, memoized, and dynamic programming algorithms for matrix chain multiplication
Minimum Spanning Tree (MST) computation
Sorting problem, not using comparisons
Traveling Salesman Problem
You should also be familiar with what these algorithms do, and how much they cost, although you don't need to remember every detail: