Introductory description

Data structures and algorithms are fundamental to programming and to understand computation. The purpose of this module is to provide students with a coherent introduction to techniques for using data structures and some basic algorithms, and with the tools for applying these techniques to computational problems.

Module aims

Outline syllabus

This is an indicative module outline only to give an indication of the sort of topics that may be covered. Actual sessions held may differ.

• Basics of algorithm analysis.
• Elementary graph algorithms.
• Greedy algorithms.
• Divide-and-conquer algorithms.
• Dynamic programming.
• Network flows.
• NP and computational intractability.

Learning outcomes

By the end of the module, students should be able to:

• Understanding a variety of techniques for designing algorithms and data structures, and ability to use them to solve problems.
• Understand a variety of data structures and be able to use them effectively to use them effectively in design and implementation of algorithms.
• Understand a variety of techniques for designing efficient algorithms, proving their correctness, and analysing their efficiency.
• Understand some fundamental algorithmic problems and algorithms for solving them.

Indicative reading list

Please see Talis Aspire link for most up to date list.

View reading list on Talis Aspire

Subject specific skills

• Designing algorithms
• Using data structures in algorithm design
• Analysing resource requirements and efficiency of algorithms
• Proving correctness of algorithms

Transferable skills

• Critical and creative thinking, problem solving
• Reading, understanding, and writing for mathematics and algorithms
• Written communication: problems, solutions, analysis