Chris Pollett >
Old Classses >
CS255 |
MTn = Midterm Problem n. FEPn = Final Exam Problem n. 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. CLO1 (Course Learning Outcome 1) -- Analyze or code a randomized algorithm CLO2 -- Analyze or code a parallel algorithm using a thread library CLO3 -- Analyze or code a parallel algorithm using a library such as OpenCL CLO4 -- Analyze the correctness and run time of a distributed algorithm CLO5 -- Given a problem determine within NP that is promised to be either in P or NP-complete prove which it is CLO6 -- Analyze or code a number theoretic algorithm CLO7 -- Analyze or code an approximation algorithm for a optimization problem whose decision problem is NP-complete. |