Print| S NO | Assessment statement | Grade | Teacher’s notes |
| 1 | Define the term recursion. | ||
| 2 | Describe the application of recursive algorithms. | Students should understand that recursion can be applied to a small subset of programming problems to produce elegant solutions. Students should also understand that recursive algorithms are rarely used in practice. LINK Thinking abstractly, thinking recursively. | |
| 3 | Construct algorithms that use recursion. | This is limited to a method that returns no more than one result and contains either one or two recursive calls. LINK Connecting computational thinking and program design. | |
| 4 | Trace recursive algorithms. | All steps and calls must be shown clearly. LINK Connecting computational thinking and program design. | |
| 5 | Define the term object reference. | As typified by simple classes that are self-referential. | |
| 6 | Construct algorithms that use reference mechanisms. |