MTxPn = Midterm x Problem n. FEPn = Final Exam Problem n. There are two sections of this class. Midterm and final info is for the first section's test, but the second section covered comparable outcomes. Within the class there were two versions of a given test; however, these two versions were just problem permutations of each other. The results above are all for the first of these two permutations. The two classes each had different tests which were variants of each other, testing the same learning outcomes.

LO1 (Learning Outcome 1) -- Implement lists, stacks, queues, search trees, heaps, union-find ADT, and graphs and use these data structures in programs they design.

LO2 -- Prove basic properties of trees and graphs.

LO3 -- Perform breadth-first search and depth-first search on directed as well as undirected graphs.

LO4 -- Use advanced sorting techniques (radix sort, heapsort, mergesort, quicksort).

LO5 -- Determine the running time of an algorithm in terms of asymptotic notation.

LO6 -- Solve recurrence relations representing the running time of an algorithm designed using a divide-and-conquer strategy.

LO7 -- Comprehend the basic concept of NP-completeness and realize that they may not be able to efficiently solve all problems they encounter in their careers.

LO8 -- Comprehend algorithms designed using greedy, divide-and-conquer, and dynamic programming techniques.

N/A -- Important material covered in the course but not directly related to a specific learning outcome.