| S NO |
Assessment statement |
Grade |
Teacher’s notes |
| 1 |
Describe the characteristics of a two- dimensional array. |
|
LINK One-dimensional arrays and basic algorithms. |
| 2 |
Construct algorithms using two- dimensional arrays. |
|
LINK Pseudocode information. |
| 3 |
Describe the characteristics and applications of a stack. |
|
Characteristics: • Last in, first out (LIFO). Examples of the applications of stacks may include running recursive processes, return memory addresses. LINK Recursive thinking; connecting computational thinking and program design. |
| 4 |
Construct algorithms using the access methods of a stack. |
|
Access methods: • push • pop • isEmpty. LINK Connecting computational thinking and program design. |
| 5 |
Describe the characteristics and applications of a queue. |
|
Characteristics: • First in, first out (FIFO). Examples of the applications of queues may include print queues and the computer modelling of physical queues (eg supermarket checkouts). Both linear and circular implementation of a queue are required. LINK Connecting computational thinking and program design. |
| 6 |
Construct algorithms using the access methods of a queue. |
|
Access methods: • enqueue • dequeue • isEmpty. LINK Connecting computational thinking and program design. |
| 7 |
Explain the use of arrays as static stacks and queues. |
|
Students should be able to explain push and pop operations, and test on empty/full stack. Students should be able to explain enqueue and dequeue operations, and test on empty/full queue. |
Print