Module ICE-2201:
Data Structures and Algorithms
Data Structures and Algorithms 2022-23
ICE-2201
2022-23
School Of Computer Science And Electronic Engineering
Module - Semester 1
20 credits
Module Organiser:
Josh Davies
Overview
• Data structures and abstract data types; arrays, linked-lists, stacks, queues, sets, maps, and binary search trees. • Algorithms: sorting, insertion, deletion, searching, traversal, iterative and recursive algorithms. • Efficiency measures for time and space: rates of growth; asymptotic behaviour, big-O notation. Algorithm complexity classes. Constraints and Trade offs (time vs. space).
Assessment Strategy
-threshold -40%
-good -60%
-excellent -70%
Learning Outcomes
- Discuss the operation of common search and sort algorithms relating to the ADTs.
- Estimate the impact, in terms of space and time, of algorithms using Complexity Theory.
- Identify common Abstract Data Types (ADTs) and their respective qualities and limitations.
Assessment method
Exam (Centrally Scheduled)
Assessment type
Crynodol
Description
Examination
Weighting
40%
Assessment method
Coursework
Assessment type
Crynodol
Description
Programming assessment examining use of ADTs.
Weighting
10%
Due date
15/10/2022
Assessment method
Coursework
Assessment type
Crynodol
Description
Programming assessment examining use of ADTs.
Weighting
10%
Due date
05/11/2022
Assessment method
Coursework
Assessment type
Crynodol
Description
Written assessment involving some programming, to compare the complexity of algorithms with two specified ADT implementations
Weighting
20%
Due date
17/12/2022
Assessment method
Coursework
Assessment type
Crynodol
Description
Written assessment involving some programming, to compare the complexity of algorithms with two specified ADT implementations
Weighting
20%
Due date
14/01/2023