Learning Outcomes versus Collected Course Materials (Sec 1)
| LO1 | LO2 | LO3 | LO4 | LO5 | LO6 | LO7 | N/A |
HW1 | X | | | | | | | |
HW2 | | X | X | | | | | |
HW3 | | | | X | | | | |
MT1P1 | X | | | | | | |
MT1P2 | | X | | | | | | |
MT1P3 | | | | X | | | | |
MT1P4 | | | | | | | | X |
MT1P5 | X | X | | | | | | |
HW4 | | | | | X | | | |
HW5 | | | | | | X | X | |
Each class had distinct versions of all exams. Within a class there were also
two versions of a given test; however, these two versions were just problem permutations
of each other. The results above are all for the second of these two permutations.
LO1 -- Analyze or code a randomized algorithm
LO2 -- Analyze or a code a parallel algorithm using Java Threads
LO3 -- Analyze or code a parallel algorithm using a library such as OpenCL
LO4 -- Analyze the correctness and run time of a distributed algorithm
LO5 -- Analyze or code a number theoretic algorithm
LO6 -- Given a problem determine within NP that is promised to be either in P or NP-complete prove which
LO7 -- Analyze or code an approximation algorithm for a optimization problem whose decision problem is NP-complete.
N/A -- Important material covered in the course but not directly related to a specific learning outcome.
|