СÀ¶ÊÓƵ

School of Engineering and Informatics (for staff and students)

Data Structures & Algorithms (G5117)

Note to prospective students: this content is drawn from our database of current courses and modules. The detail does vary from year to year as our courses are constantly under review and continuously improving, but this information should give you a real flavour of what it is like to study at СÀ¶ÊÓƵ.

We’re currently reviewing teaching and assessment of our modules in light of the COVID-19 situation. We’ll publish the latest information as soon as possible.

Data Structures & Algorithms

Module G5117

Module details for 2024/25.

15 credits

FHEQ Level 4

Module Outline

This module provides an introduction to data structures and algorithms for computer scientists. We introduce a number of fundamental data structures, including static/dynamic arrays, linked lists, stacks, queues, various kinds of trees, hash maps, and directed/undirected graphs. These are presented as implementations of appropriate Interfaces.

We also study fundamental computational problems, including the Sorting problem and the Shortest Paths problem in graphs, and we present solutions to them in the form of important algorithms, such as insertion/selection/merge/heap sort, Dijkstra/Bellman-Ford’s algorithms.

All algorithms treated in the module are given as pseudocode, and their asymptotic efficiencies are studied. We also prove the correctness of some of these algorithms.

Library

Goodrich, M. & Tamassia, R. (2011) Data Structures and Algorithms in Java (5th Edn.) John Wiley and Sons.
Weiss, M.A. (2010) Data Structures & Problem Solving using Java, (4th Edn.), Addison-Wesley

Module learning outcomes

Evidence knowledge of a variety of data structures in terms of their characteristic behaviours.

Implement and apply appropriate data structures for solving program design problems.

Demonstrate basic knowledge of complexity issues with respect to data manipulation.

Evidence understanding of a number of fundamental algorithms.

TypeTimingWeighting
Multiple Choice questionsSemester 2 Assessment100.00%
Timing

Submission deadlines may vary for different types of assignment/groups of students.

Weighting

Coursework components (if listed) total 100% of the overall coursework weighting value.

TermMethodDurationWeek pattern
Spring SemesterLecture1 hour33333333333
Spring SemesterLaboratory1 hour11111111111

How to read the week pattern

The numbers indicate the weeks of the term and how many events take place each week.

Dr Alessio Santamaria

Assess convenor
/profiles/580064

Please note that the University will use all reasonable endeavours to deliver courses and modules in accordance with the descriptions set out here. However, the University keeps its courses and modules under review with the aim of enhancing quality. Some changes may therefore be made to the form or content of courses or modules shown as part of the normal process of curriculum management.

The University reserves the right to make changes to the contents or methods of delivery of, or to discontinue, merge or combine modules, if such action is reasonably considered necessary by the University. If there are not sufficient student numbers to make a module viable, the University reserves the right to cancel such a module. If the University withdraws or discontinues a module, it will use its reasonable endeavours to provide a suitable alternative module.

School of Engineering and Informatics (for staff and students)

School Office:
School of Engineering and Informatics, СÀ¶ÊÓƵ, Chichester 1 Room 002, Falmer, Brighton, BN1 9QJ
ei@sussex.ac.uk
T 01273 (67) 8195

School Office opening hours: School Office open Monday – Friday 09:00-15:00, phone lines open Monday-Friday 09:00-17:00
School Office location [PDF 1.74MB]