F28XO - Data Structures and Algorithms

Course leader(s):

Syllabus

1.1 Introduction to the storage structure, access strategy and calculation of data in computer systems Basic concepts of data, data structure, algorithm and algorithm analysis. Overview of data storage methods, access strategies e.g., sequential, direct, and computational considerations Definitions of data types, data structures arrays, linked lists, trees, algorithms, and methods for algorithm analysis time and space complexity

2.1 Basic logical structure, physical representation, operation, and implementation of the data, Exploration of logical structures linear, non-linear, physical representations contiguous, linked, common operations insert, delete, search, implementation techniques

3.1 Analysis and design of the algorithm, Methods for analysing algorithm performance Big O notation, strategies for algorithm design divide and conquer, greedy, dynamic programming

4.1 Design of complex algorithms, Application of algorithm design techniques to create efficient solutions for complex problems

Learning outcomes

By the end of the course, students should be able to do the following:

• explain the basic concepts of data structures, including linear lists, stacks, queues, binary trees, and trees
• implement algorithms for basic operations such as adding, modifying, deleting, and searching elements in various data structures
• analyse the basic properties of non-linear data structures such as binary trees, balanced binary trees, heaps, and trees
• apply common linear list retrieval methods, including sequential search and binary search
• compare and contrast common sorting methods such as insertion sort, selection sort, bubble sort, quick sort, merge sort, and heap sort

Further details

Curriculum explorer: Click here

SCQF Level: 8

Credits: 15