Engineering
Data Structures
Bachelor's · Year 2 · 48 students measured
| Learning outcome | Level | Attainment | Status |
|---|---|---|---|
| Defines linked list, stack and queue structures. | B1 | 88% | Attained |
| Selects, with justification, a suitable data structure for a given problem. | B4 | 61% | Developing |
| Applies insertion and deletion algorithms in a binary search tree. | B3 | 72% | Attained |
| Compares the time complexity of two algorithms. | B4 | 44% | Support recommended |
Improvement decision: The complexity comparison had been measured with a single exam item. Next term two short assignments will be added and marked with a rubric.