Show/hide contentOpenClose All
Curricular information is subject to change
On successful completion of this module the learner will be able to:
1. Understand how to determine the amount of resources (such as time and storage) necessary to execute a particular algorithm (algorithm analysis).
2. Understand the structure, nature and use of fundamental data structures including, Arrays, Linked Lists, Stacks, Queues, Trees and Dictionaries.
3. Implement the data structures in Python.
4. Understand the object-oriented programming constructs needed to encode a data structure and its access algorithms.
5. Design programs using these constructs to solve large problems.
6. Successfully write, compile, debug and run programs using these constructs.
Student Effort Type | Hours |
---|---|
Lectures | 24 |
Tutorial | 12 |
Practical | 16 |
Autonomous Student Learning | 58 |
Total | 110 |
Not applicable to this module.
Resit In | Terminal Exam |
---|---|
Summer | Yes - 2 Hour |
• Feedback individually to students, post-assessment
• Group/class feedback, post-assessment
• Peer review activities
Not yet recorded.
Name | Role |
---|---|
Dr Madhusanka Liyanage | Lecturer / Co-Lecturer |
Practical | Offering 1 | Week(s) - 20, 21, 22, 23, 24, 25, 26, 29, 31, 32, 33 | Fri 11:00 - 12:50 |
Tutorial | Offering 1 | Week(s) - 21, 23, 24, 25, 26, 29, 30, 32, 33 | Mon 17:00 - 17:50 |
Lecture | Offering 1 | Week(s) - 20, 21, 22, 23, 24, 25, 26, 29, 30, 31, 32, 33 | Tues 11:00 - 11:50 |
Lecture | Offering 1 | Week(s) - 20, 21, 22, 23, 24, 25, 26, 29, 30, 31, 32, 33 | Wed 10:00 - 10:50 |