Graphs and Algorithms - COMP40008
Aims
In this module you will have the opportunity to:
- prove mathematical properties of graphs
- explore classical algorithms associated with graphs and trees
- design algorithms for sorting and searching
- apply various methods for determining the time complexity of algorithm
- study the complexity classes P and NP and the concept of NP-completeness
Role
Course Leader
Complexity - COMP70005
Aims
In this module you will have the opportunity to:
- study time and space complexity classes
- identify the complexity classes associated with computational problems
- prove that problems are complete for particular complexity classes
- develop the ability to fit a particular problem into a class of related problems, and so to appreciate the efficiency attainable by algorithms to solve the particular problem
- study circuit complexity and the class NC of parallelisable problems
- study randomised computation and the associated complexity classes
- explore how the P=NP problem is related to cryptography
Role
Course Leader