8546 modules
Page 60
-
MATH3080 2028-29
Algebraic Topology
Topology is concerned with the way in which geometric objects can be continuously deformed to one another. It can be thought of as a variation of geometry where there is a notion of points being "close together" but without there being a precise measure of their distance apart.
Examples of topological objects are surfaces which we might imagine to be made of some infinitely malleable material. However much we try, we can never deform in a continuous way a torus (the surface of a bagel) into the surface of the sphere. Other kinds of topological objects are knots, i.e. closed loops in 3-dimensional space. Thus, a trefoil or "half hitch" knot can never be deformed into an unknotted piece of string. It's the business of topology to describe more precisely such phenomena.
In topology, especially in algebraic topology, we tend to translate a geometrical, or better said a topological problem to an algebraic problem (more precisely, for example, to a group theoretical problem). Then we solve that algebraic problem and try to see what that solution tells us of our initial topological problem. So to do topology you need to work equally well with both geometric and algebraic objects. -
COMP6266 2026-27
Algorithm Engineering
This module bridges the gap between theoretical algorithm design and solving real-world, typically intractable, problems. Moving beyond standard textbook proofs, the focus is on Algorithm Engineering: the process of implementing, analysing, and optimising complex algorithms in a production-like environment where an exact solution may not be feasible. -
COMP6207 2025-26
Algorithmic Game Theory
This module:
- Introduces the students to the key issues of interaction of multiple self-interested parties (a.k.a. agents) and gives a broad survey of topics at the interface of theoretical computer science and game theory dealing with such interactions.
- Provides the theoretical background and practical tools to solve problems arising in settings with self-interested participants, to predict possible behaviour and outcomes, and finally, to design multi-agent systems that would incentivise desirable behaviour.
- Introduces the students to the specifics of computational game-theoretic techniques in different application areas, ranging from multi-agent systems, electronic marketplaces and networked computer systems to computational biology and social networks.
- Extends and advances the knowledge obtained in other AI modules (in particular, COMP6203 Intelligent Agents). -
COMP6207 2026-27
Algorithmic Game Theory
This module:
- Introduces the students to the key issues of interaction of multiple self-interested parties (a.k.a. agents) and gives a broad survey of topics at the interface of theoretical computer science and game theory dealing with such interactions.
- Provides the theoretical background and practical tools to solve problems arising in settings with self-interested participants, to predict possible behaviour and outcomes, and finally, to design multi-agent systems that would incentivise desirable behaviour.
- Introduces the students to the specifics of computational game-theoretic techniques in different application areas, ranging from multi-agent systems, electronic marketplaces and networked computer systems to computational biology and social networks.
- Extends and advances the knowledge obtained in other AI modules (in particular, COMP6203 Intelligent Agents). -
COMP6207 2028-29
Algorithmic Game Theory
This module:
- Introduces the students to the key issues of interaction of multiple self-interested parties (a.k.a. agents) and gives a broad survey of topics at the interface of theoretical computer science and game theory dealing with such interactions.
- Provides the theoretical background and practical tools to solve problems arising in settings with self-interested participants, to predict possible behaviour and outcomes, and finally, to design multi-agent systems that would incentivise desirable behaviour.
- Introduces the students to the specifics of computational game-theoretic techniques in different application areas, ranging from multi-agent systems, electronic marketplaces and networked computer systems to computational biology and social networks.
- Extends and advances the knowledge obtained in other AI modules (in particular, COMP6203 Intelligent Agents). -
COMP6207 2029-30
Algorithmic Game Theory
This module:
- Introduces the students to the key issues of interaction of multiple self-interested parties (a.k.a. agents) and gives a broad survey of topics at the interface of theoretical computer science and game theory dealing with such interactions.
- Provides the theoretical background and practical tools to solve problems arising in settings with self-interested participants, to predict possible behaviour and outcomes, and finally, to design multi-agent systems that would incentivise desirable behaviour.
- Introduces the students to the specifics of computational game-theoretic techniques in different application areas, ranging from multi-agent systems, electronic marketplaces and networked computer systems to computational biology and social networks.
- Extends and advances the knowledge obtained in other AI modules (in particular, COMP6203 Intelligent Agents). -
ARTD1139 2026-27
Algorithmic Thinking & Methods
This module builds on the foundational skills and knowledge established in Creative Computing I to develop a more sustained application of coding to creative technological approaches to art and design. You will be introduced to more advanced programming principles and languages. The concept of the algorithm – the process or rule-based nature of computing – will be explored and applied to set of individual and team-based exercises that might include game-like rules and applications, augmented reality (AR) experiences, physical computing (e.g. Arduino) and further experiments with image manipulation, robotics and AI. -
ARTD1139 2025-26
Algorithmic Thinking & Methods
This module builds on the foundational skills and knowledge established in Creative Computing I to develop a more sustained application of coding to creative technological approaches to art and design. You will be introduced to more advanced programming principles and languages. The concept of the algorithm – the process or rule-based nature of computing – will be explored and applied to set of individual and team-based exercises that might include game-like rules and applications, augmented reality (AR) experiences, physical computing (e.g. Arduino) and further experiments with image manipulation, robotics and AI. -
COMP1324 2026-27
Algorithmics
This module teaches the basic data structures and algorithms which underpins modern software engineering. Without these algorithms most software would be hopelessly slow to the point of unusability. The course also teaches the principles behind the algorithms and data structures and the software engineering lessons which data structures and algorithms teach us. -
COMP1324 2025-26
Algorithmics
This module teaches the basic data structures and algorithms which underpins modern software engineering. Without these algorithms most software would be hopelessly slow to the point of unusability. The course also teaches the principles behind the algorithms and data structures and the software engineering lessons which data structures and algorithms teach us.