| Title | Data Structures and Algorithms |
| Code | SCPS211 |
| Prerequisites | SCPS111 | Co-requisites | SCPS112 |
| Aim | The main aim of this course is to provide an introduction to algorithms and data structures. The secondary aim is to improve the students programming skills. |
| Content | - Basic Analysis techniques
- Strategies for studying Efficiency and complexity of algorithms
- Data structures covered include but not limited to Lists, Stacks, Queues,
Graphs, and Binary trees. - Algorithms covered include search and sorting algorithms such as,
Sequential and Binary Search, Insertion Sort and Selection Sort, Heap
Sort and Quick Sort, Merge Sort.
|
| Outcomes | On completion of this module the learner should be able to: - demonstrate an understanding of abstract data types
- Implement lists, stacks and queues as both arrays and linked lists. And be able to use classes from the Java Collections class
- identify the most appropriate algorithms and data structures for a range of situations
- understand the concepts of algorithm and data structure efficiency in terms of time/space complexity
- be able to implement the various commonly occurring algorithms and data structures
- analyse algorithms and estimate their worst-case and average-case behavior
|
| Assessment | 40% Continuous Assessment (comprising 20% practical assessment plus 20% theory assessments) 60% Summative Assessment (comprising 4 hour practical and theory exam) |
| DP Requirements | 40% Continuous Assessment Mark
80% Attendance at practical’s |
