Module overview
Aims and Objectives
Learning Outcomes
Knowledge and Understanding
Having successfully completed this module, you will be able to demonstrate knowledge and understanding of:
- Common data structures and algorithms
- Time complexity
- The implementation of common data structures
Subject Specific Intellectual and Research Skills
Having successfully completed this module you will be able to:
- Understand how to evaluate an algorithm for efficiency
- Understand the operation of a number of important computer algorithms using those structures
- Solve problems algorithmically
- Choose an appropriate algorithmic strategy to solve a problem
- Choose the most appropriate data structure for a particular problem
Syllabus
Learning and Teaching
Teaching and learning methods
| Type | Hours |
|---|---|
| Tutorial | 12 |
| Completion of assessment task | 10 |
| Lecture | 36 |
| Preparation for scheduled sessions | 6 |
| Follow-up work | 18 |
| Wider reading or practice | 50 |
| Revision | 18 |
| Total study time | 150 |
Resources & Reading list
Textbooks
Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein (2009). Introduction to Algorithms. MIT Press.
Weiss MA (2006). Data Structures and Algorithm Analysis in Java. Addison-Wesley.
Robert Sedgewick and Kevin Wayne (2011). Algorithms. Addison-Wesley.
Assessment
Assessment strategy
This module is assessed by a combination of problem sheets and a final assessment in the form of a written examination.Summative
This is how we’ll formally assess what you have learned in this module.
| Method | Percentage contribution |
|---|---|
| Examination | 90% |
| Quizzes | 10% |
Referral
This is how we’ll assess you if you don’t meet the criteria to pass this module.
| Method | Percentage contribution |
|---|---|
| Examination | 100% |
Repeat
An internal repeat is where you take all of your modules again, including any you passed. An external repeat is where you only re-take the modules you failed.
| Method | Percentage contribution |
|---|---|
| Examination | 100% |