Show/hide contentOpenClose All
Curricular information is subject to change
On successful completion of this module the students will 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 JAVA programming constructs needed to encode an algorithm;• Understand the structure, nature and use of fundamental data structures including, Arrays, Linked Lists, Stacks, Queues, Trees, Dictionaries, Graphs etc.;• 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;• Analyse problems to determine the most appropriate data structures and algorithms that may be applicable to them.
Indicative Module Content:- Running Time Analysis
- Sorting and Searching
- Arrays, Lists, Vectors
- Stacks, Queues, Deques, Priority Queues
- Trees, Dictionaries, Maps, Hashtables, Graphs
Student Effort Type | Hours |
---|---|
Lectures | 24 |
Practical | 24 |
Specified Learning Activities | 48 |
Autonomous Student Learning | 120 |
Total | 216 |
In order to take this module you must have experience in Programming in Java
Remediation Type | Remediation Timing |
---|---|
In-Module Resit | Prior to relevant Programme Exam Board |
• Feedback individually to students, post-assessment
• Online automated feedback
Feedback will be provided through the VLE post assessment and through discussions during the project activities.
Name | Role |
---|---|
Dr Levent Gorgu | Lecturer / Co-Lecturer |
Online Learning | Offering 1 | Week(s) - 20, 21, 22, 23, 24, 25, 26, 30, 31, 32, 33 | Fri 12:00 - 13:50 |
Online Learning | Offering 1 | Week(s) - 20, 21, 22, 23, 24, 25, 26, 29, 30, 31, 32, 33 | Tues 12:00 - 13:50 |