Browse Hierarchy MTH5107: Algorithms and Data Structures

Back to EM-MATH-MATH: School of Mathematical Sciences
This module provides a detailed introduction to the design and analysis of efficient algorithms and data structures. An algorithm is a finite sequence of instructions for solving a problem. A data structure arranges data in a way that makes it convenient to use for a particular purpose, for example by an algorithm. An algorithm or data structure is generally considered efficient if the number of steps it takes to solve a problem or answer a question is polynomial in the size of the problem or data set.

Sorry, there are no lists here yet. You could try:

  • Clicking My Lists from the menu. Your course enrolled lists are stored here.
  • Searching for the list using the form below:

Lists linked to Algorithms and Data Structures

There are currently no lists linked to this Module.