Last modified: 22 Aug 2024 11:46
This course provides the knowledge needed to understand, design and compare algorithms. By the end of the course, a student should be able to create or adapt algorithms to solve problems, determine an algorithm's efficiency, and be able to implement it. The course also introduces the student to a variety of widely used algorithms and algorithm creation techniques, applicable to a range of domains. The course will introduce students to concepts such as pseudo-code and computational complexity, and make use of proof techniques. The practical component of the course will build on and enhance students' programming skills.
| Study Type | Undergraduate | Level | 2 |
|---|---|---|---|
| Term | Second Term | Credit Points | 15 credits (7.5 ECTS credits) |
| Campus | Aberdeen | Sustained Study | No |
| Co-ordinators |
|
||
This course concerns seeks to equip the student with the knowledge required to identify appropriate algorithms to address computational problems. It begins by describing the concept of an algorithm, and shows how once an determine whether an algorithm solves a specific problem. Computational complexity is then introduced, allowing the student to compare algorithm efficiency. Basic data structures, such as lists, queues, trees, etc are then described and analysed. The course then examines standard approaches to algorithm creation, such as dynamic programming and search, as well as common algorithmic problems and their solutions, such as sorting.
Information on contact teaching time is available from the course guide.
| Assessment Type | Summative | Weighting | 25 | |
|---|---|---|---|---|
| Assessment Weeks | Feedback Weeks | |||
| Feedback |
Programming & Report |
|||
| Knowledge Level | Thinking Skill | Outcome |
|---|---|---|
| Conceptual | Apply | Ability to demonstrate the correctness of algorithms |
| Conceptual | Understand | Understanding of the theory underpinning algorithmic complexity and ability to compare algorithms for efficiency |
| Conceptual | Understand | An appreciation of the trade-offs between different types of data structures and the ability to identify an appropriate data structure for different tasks |
| Procedural | Create | The ability to design, specify, describe and implement appropriate algorithms to real world problems |
| Assessment Type | Summative | Weighting | 25 | |
|---|---|---|---|---|
| Assessment Weeks | Feedback Weeks | |||
| Feedback |
5 x Programming Submission/Test |
|||
| Knowledge Level | Thinking Skill | Outcome |
|---|---|---|
| Conceptual | Apply | Ability to demonstrate the correctness of algorithms |
| Conceptual | Understand | Understanding of the theory underpinning algorithmic complexity and ability to compare algorithms for efficiency |
| Conceptual | Understand | An appreciation of the trade-offs between different types of data structures and the ability to identify an appropriate data structure for different tasks |
| Procedural | Create | The ability to design, specify, describe and implement appropriate algorithms to real world problems |
| Assessment Type | Summative | Weighting | 50 | |
|---|---|---|---|---|
| Assessment Weeks | Feedback Weeks | |||
| Feedback | ||||
| Knowledge Level | Thinking Skill | Outcome |
|---|---|---|
| Conceptual | Apply | Ability to demonstrate the correctness of algorithms |
| Conceptual | Understand | Understanding of the theory underpinning algorithmic complexity and ability to compare algorithms for efficiency |
| Conceptual | Understand | An appreciation of the trade-offs between different types of data structures and the ability to identify an appropriate data structure for different tasks |
| Procedural | Create | The ability to design, specify, describe and implement appropriate algorithms to real world problems |
There are no assessments for this course.
| Assessment Type | Summative | Weighting | 75 | |
|---|---|---|---|---|
| Assessment Weeks | Feedback Weeks | |||
| Feedback |
2-hour Resit Exam Plus carried forward continuous assessment marks (25%) |
|||
| Knowledge Level | Thinking Skill | Outcome |
|---|---|---|
|
|
||
| Knowledge Level | Thinking Skill | Outcome |
|---|---|---|
| Conceptual | Understand | An appreciation of the trade-offs between different types of data structures and the ability to identify an appropriate data structure for different tasks |
| Conceptual | Apply | Ability to demonstrate the correctness of algorithms |
| Procedural | Create | The ability to design, specify, describe and implement appropriate algorithms to real world problems |
| Conceptual | Understand | Understanding of the theory underpinning algorithmic complexity and ability to compare algorithms for efficiency |
We have detected that you are have compatibility mode enabled or are using an old version of Internet Explorer. You either need to switch off compatibility mode for this site or upgrade your browser.
