Show/hide contentOpenClose All
Curricular information is subject to change
On completion of this module students should be able to:- formulate, explain, link and compare the fundamental concepts and terminology related to spatial information - analyse data structures for spatial data and evaluate them in terms of storage requirements and efficiency - categorise spatial queries depending on the type of relations and basic algorithms they involve and reflect on their application - critically discuss the different approaches for spatial data storage and manipulation - identify, discuss and critically evaluate indexing techniques for accessing and querying different types of spatial data - identify, explain and generalise algorithms from the computational geometry literature for solving problems discussed in the course (e.g., topological querying, digital terrain modelling, visibility problems, etc.)
Student Effort Type | Hours |
---|---|
Lectures | 24 |
Specified Learning Activities | 15 |
Autonomous Student Learning | 75 |
Total | 114 |
Not applicable to this module.
Description | Timing | Component Scale | % of Final Grade | ||
---|---|---|---|---|---|
Examination: continuous assessment | Varies over the Trimester | No | Graded | No | 100 |
Resit In | Terminal Exam |
---|---|
Autumn | No |
• Online automated feedback
• Self-assessment activities
Exercises with solutions.