Computing

Data Structures & Algorithms

Module code: G5117
Level 4
15 credits in spring semester
Teaching method: Lecture, Laboratory
Assessment modes: Unseen examination

This module introduces data structures and algorithms for computer scientists. You’ll learn about key data structures like arrays, linked lists, stacks, queues, trees, hash tables, and graphs, presented as implementations of relevant interfaces.

You’ll also explore fundamental computational problems, such as sorting and finding the shortest paths in graphs, along with important algorithms like insertion sort, selection sort, merge sort, heap sort, Dijkstra’s algorithm, and Bellman-Ford’s algorithm.

Algorithms will be presented in pseudocode, with a focus on their efficiency and asymptotic behavior, and you’ll also examine the correctness of some of these algorithms.

Module learning outcomes

  • Evidence knowledge of a variety of fundamental data structures in terms of the operations they support and their asymptotic efficiencies
  • Evidence understanding of a variety of important algorithms in terms of their execution steps, asymptotic efficiency, and correctness
  • Evidence ability to efficiently solve basic computational problems using the data structures and algorithms presented in class.