| Section 7: Recursion | ||||||
| Column: | D | C | B | A | ||
| Row: | Recursion: | YOUR SCORE | Attempt | Meets Requirements | Exceeds Requirements | Exemplary |
| Minimum Points | Must exceed requirements in at least one area. | Total | ||||
| 14 | 0 | 24 | ||||
| 1 | The concept of recursion. | Close | Define. | Define, with examples. | Able to discuss implications for execution. | |
| 2 | Recursive mathematical functions. | Can follow mathematical functions that are recursive. | Can follow in code. | Can write own when given algorithm. | Can create algorithm and implement. | |
| 3 | Simple recursive procedures. | Able to identify. | Can follow in code. | Can write own when given algorithm. | Can create algorithm and implement. | |
| 4 | Divide-and-conquer strategies. | Able to describe the term. | Able to implement, given algorithms. | Able to identify candidate problems. | Able to solve candidate problems. | |
| 5 | Recursive backtracking. | Able to identify. | Can explain. | Can write own when given algorithm. | Can create algorithm and implement. | |
| 6 | Implementation of recursion. | Almost. | Simple, working example. | Able to translate appropriate non-recursive solutions into recursive ones and vice-versa. | Can handle pre-, post-, and infix recursion. | |