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)- Understand 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 | 28 |
Laboratories | 24 |
Autonomous Student Learning | 73 |
Total | 125 |
Not applicable to this module.
Description | Timing | Component Scale | % of Final Grade | ||
---|---|---|---|---|---|
Continuous Assessment: This includes a series of in module assessments such as quizzes, group assignments, and projects. | Varies over the Trimester | n/a | Graded | Yes | 100 |
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.
Name | Role |
---|---|
Dr Fatemeh Golpayegani | Lecturer / Co-Lecturer |
Dr David Lillis | Lecturer / Co-Lecturer |
Dr Seán Russell | Lecturer / Co-Lecturer |