Show/hide contentOpenClose All
Curricular information is subject to change
On completion of this module students should be able to:
- Understand how to determine the amount of resources (such as time and storage) necessary to execute a particular algorithm (algorithm analysis)
- Describe the object-oriented programming constructs needed to encode an algorithm
- Understand the structure, nature and use of fundamental data structures including, Arrays, Linked Lists, Stacks, Queues, Lists, Trees, Priority Queues
- Understand the object-oriented programming constructs needed to encode a data structure and its access algorithms
- Design programs using these constructs to solve large problems.
- Successfully write, compile, debug and run programs using these constructs.
Student Effort Type | Hours |
---|---|
Lectures | 22 |
Laboratories | 16 |
Autonomous Student Learning | 87 |
Total | 125 |
Not applicable to this module.
Description | Timing | Component Scale | % of Final Grade | ||
---|---|---|---|---|---|
Exam (In-person): 2-Hour end of term exam | n/a | Graded | No | 50 |
|
Assignment(Including Essay): Projects | n/a | Graded | No | 50 |
Remediation Type | Remediation Timing |
---|---|
In-Module Resit | Prior to relevant Programme Exam Board |
• Feedback individually to students, post-assessment
• Online automated feedback
Not yet recorded.