Learning Objectives for CS 325

At the cmpletion of the course, students will be able to…

1. Define O, Ω, Θ in a rigorous way (Level 1)
2. Compute the time complexity of polynomial-time and exponential-time iterative and recursive algorithms (Level 3)
3. Solve simple difference equations (Level 3)
4. Implement a recursive algorithm to solve a simple problem (Level 3)
5. Prove the correctness of theorems using induction (Level 3)
6. Implement a divide-and-conquer algorithm to solve a problem of intermediate difficulty (Level 3)
7. Implement a polynomial-time heuristic algorithm to solve an NP-hard problem (Level 3)
8. Explain how a problem is shown to be NP-complete (Level 2)

The scale below will be used to evaluate the leaning objectives listed above at the end of the term.