LEARNING OUTCOMES
The Student Will
|
| | |
| P | 1 | Write programs using: |
| | - parameter passing |
| | - recursive techniques |
| | - dynamic memory allocation (pointers) |
| CONTENT |
|
| 1-5 |
|
| > | Table handling. |
| |
| > | Searching. |
| |
| > | Sorting. |
| |
| > | Data Structures including lists, stacks and queues. |
| |
| > | Screen management (including windowing and simple graphics). |
| |
| > | Bitwise operations (including data compression). |
| P | 2 | Develop documentation to installation standards. |
|
| P | 3 | Find and correct bugs in programs. |
|
| P | 4 | Design test data which will thoroughly check that a program works to specification. |
|
| P | 5 | Enhance an existing working program. |