Structures & Algorithms
The module begins with a revision of core programming concepts. There follows an introduction to data and procedural abstraction and their
use in specifying characteristics of a data structure and primitive operations are considered. The module further investigates programming
concepts by considering abstract data types (ADTs) and the object-oriented principles and uses of encapsulation, classes, inheritance and
polymorphism. Abstract data types as interfaces are discussed and explored. Consideration is given to linear data structures: arrays, linked
lists, and their use in the implementation of abstract data types, looking at applications and concepts such as stacks and queues. The module
also includes an introduction to binary search trees. Further analysis of algorithms for space and time complexity is covered along with algorithmic
design techniques such as divide and conquer, and the treatment of a number of sorting and searching algorithms.
Examination is in the form of a class tes (worth 40% of the final mark) an assessed lab exercise (worth 30% of the final mark) and an individual project worth the remaining 30%).
Final Marks:
Class Test - 20/30
Assessed Lab - 29/30
Project - 33/40
Overall - 82%
Grade - A
Pass
Examination is in the form of a class tes (worth 40% of the final mark) an assessed lab exercise (worth 30% of the final mark) and an individual project worth the remaining 30%).
Final Marks:
Class Test - 20/30
Assessed Lab - 29/30
Project - 33/40
Overall - 82%
Grade - A
Pass
