Mathematics and Computer Science with a Year in Industry BSc (Hons)

​At its heart, calculus is the study of limits. Many quantities can be expressed as the limiting value of a sequence of approximations, for example the slope of a tangent to a curve, the rate of change of a function, the area under a curve, and so on. Calculus provides us with tools for studying all of these, and more. Many of the ideas can be traced back to the ancient Greeks, but calculus as we now understand it was first developed in the 17th Century, independently by Newton and Leibniz. The modern form presented in this module was fully worked out in the late 19th Century. MATH101 lays the foundation for the use of calculus in more advanced modules on differential equations, differential geometry, theoretical physics, stochastic analysis, and many other topics. It begins from the very basics – the notions of real number, sequence, limit, real function, and continuity – and uses these to give a rigorous treatment of derivatives and integrals for real functions of one real variable.​ ​

This module, the last one of the core modules in Year 1, is built upon the knowledge you gain from MATH101 (Calculus I) in the first semester. The syllabus is conceptually divided into three parts: Part I, relying on your knowledge of infinite series, presents a thorough study of power series (Taylor expansions, binomial theorem); part II begins with a discussion of functions of several variables and then establishes the idea of partial differentiation together with its various applications, including chain rule, total differential, directional derivative, tangent planes, extrema of functions and Taylor expansions; finally, part III is on double integrals and their applications, such as finding centres of mass of thin bodies. Undoubtedly, this module, together with the other two core modules from Semester 1 (MATH101 Calculus I and MATH103 Introduction to linear algebra), forms an integral part of your ability to better understand modules you will be taking in further years of your studies.

This module introduces students to some basic algorithms and data structures. It gives some fundamental concepts of design and analysis of algorithms, and implementation of algorithms by choosing appropriate data structures.

This module will provide students with an all rounded appraisal of what is expected from a computing professional in the current digital society. Students will be introduced to social, legal and ethical aspects on computing and will develop employability skills. As a way to blend both theory and practice, students will be equipped with concepts and techniques for designing digital systems tailored to the needs of the user.​

Linear algebra is the branch of mathematics concerning vector spaces and linear mappings between such spaces. It is the study of lines, planes, and subspaces and their intersections using algebra.

Linear algebra first emerged from the study of determinants, which were used to solve systems of linear equations. Determinants were used by Leibniz in 1693, and subsequently, Cramer’s Rule for solving linear systems was devised in 1750. Later, Gauss further developed the theory of solving linear systems by using Gaussian elimination. All these classical themes, in their modern interpretation, are included in the module, which culminates in a detailed study of eigenproblems. A part of the module is devoted to complex numbers which are basically just planar vectors. Linear algebra is central to both pure and applied mathematics. This module is an essential pre-requisite for nearly all modules taught in the Department of Mathematical Sciences.

The intention of COMP122 is to introduce students to the concepts and methodology of object-oriented programming using the Java programming language. Topics covered include hierarchical structures, polymorphism, collections and iterators, exception handling, and graphical user interface design. Basic concepts of software design methodology, testing, and version control are also included in the module. It is normally expected that students have prior programming experience.

This module is an introduction to classical (Newtonian) mechanics. It introduces the basic principles like conservation of momentum and energy, and leads to the quantitative description of motions of bodies under simple force systems. It includes angular momentum, rigid body dynamics and moments of inertia.

A group is a formal mathematical structure that, on a conceptual level, encapsulates the symmetries present in many structures. Group homomorphisms allow us to recognise and manipulate complicated objects by identifying their core properties with a simpler object that is easier to work with. The abstract study of groups helps us to understand fundamental problems arising in many areas of mathematics. It is moreover an extremely elegant and interesting part of pure mathematics. Motivated by examples in number theory, combinatorics and geometry, as well as applications in data encryption and data retrieval, this module is an introduction to group theory. We also develop the idea of mathematical rigour, formulating our theorems and proofs precisely using formal logic.

The module provides an introduction to procedural programming using current language platforms. The module incorporates program design, problem solving, the importance of maintainable, robust software and testing as well as introducing procedural language main programming constructs. Students gain practical experience with program design, programming and testing during weekly laboratory sessions.

This module is for students that already have some programming skills. Students will learn about the two main programming paradigms: imperative programming and functional programming. Since most introductory programming courses teach imperative programming, this module will focus on the functional paradigm. Students will learn how to program in Haskell, a popular functional programming language. They will learn how to formulate programs in a functional way, and the common techniques and idioms that are used to solve problems in functional programming.

Students will learn fundamental concepts from statistics and probability using the R programming language and will learn how to use R to some degree of proficiency in certain contexts. Students will become aware of possible career paths using statistics.

This module studies techniques, such as dynamic programming and recursion, used for the design and analysis of algorithms and data structures. Some fundamental algorithmic problems are studied, such as searching, sorting and network flows and efficient algorithms for such problems. The emphasis of this module is on problem solving using efficient algorithms together with their formal analysis and implementation, thus enhancing the students’ toolbox for efficient programming.

This module provides an introduction to current computer networks and communications technologies. We will use the architecture and protocols of the Internet as a primary vehicle for studying fundamental computer networking concepts. This will include an in-depth study of the key protocols that enable communications accross the Internet. You will become familiar with the various network devices and network addressing schemes. We will identify critical network security issues and study approaches towards addressing these issues.

This module provides a basic introduction to the important hardware and software components supporting the operation of computer systems. The module presents coverage of how low-level hardware components are organised so as to provide a platform on which complex software systems can be built. Coverage includes the important components of modern operating systems, including abstractions such as processes and concurrency. There is an opportunity to gain some practical awareness of low-level programming and a modern command-line environment.

This module introduces students to the problems arising from databases, including concurrency in databases, information security considerations and how they are solved; the integration of heterogeneous sources of information and the use of semi-structured data; non-relational databases and the economic factors involved in their selection and to techniques for analysing large amounts of data, the security issues and commercial factors involved with them.

This module aims to introduce formal concepts of automata, grammars and languages; to introduce ideas of computability and decidability, and to illustrate the importance of automata, formal language theory and general models of computation in Computer Science and Artificial Intelligence.

This module provides an introduction to the subjects of fluid mechanics and electromagnetism, to the various vector integrals, the operators div, grad and curl and the relations between them and to the many applications of vector calculus to physical situations.

This module is concerned with the motion of physical bodies both in everyday situations and in the solar system. To describe motion, acceleration and forces you will need background knowledge of calculus, differentiation, integration and partial derivatives from MATH101 (Calculus I), MATH102 (Calculus II) and MATH103 (Introduction to Linear Algebra). Classical mechanics is important for learning about modern developments such as relativity (MATH326), quantum mechanics (MATH325) and chaos and dynamical systems (MATH322). This module will make you familiar with notions such as energy, force, momentum and angular momentum which lie at the foundations of applied mathematics problems.

This module introduces students to a surprising, very beautiful theory having intimate connections with other areas of mathematics and physical sciences, for instance ordinary and partial differential equations and potential theory.

Linear algebra provides a toolbox for analysing phenomena ubiquitous in many areas of mathematics: linear maps, or linearity in general. In all of these situations it is essential to first identify the kind of objects which are mapped or behave in a linear way. To cover the many different possibilities the concept of an abstract vector space is introduced. It generalizes the real vector spaces introduced in MATH103 (Introduction to Linear Algebra) and the calculational techniques developed there can still be used. Applications of ideas from Linear Algebra appear in Geometry, in Algebra, in solving Differential Equations, which in turn model many physical systems, in Physics, especially Quantum Mechanics, in Biology and in Statistics.

​The module provides an introduction to the theory and methods of the modern commutative algebra (commutative groups, commutative rings, fields and modules) with some applications to number theory, algebraic geometry and linear algebra.

This module introduces several probabilistic models in operations research, such as queueing systems, simulations, and decision theory under risk. Those topics heavily interact with other subjects such as applied probability, actuarial sciences etc. This module is complementary to MATH269 (Operational research), which focuses on the mathematical programming aspect of operational research, mainly in a deterministic setup.

​Mathematical Finance uses mathematical methods to solve problems arising in finance. A common problem in Mathematical Finance is that of derivative pricing. In this module, after introducing the basic concepts in Financial Mathematics, we use some particular models for the dynamic of stock price to solve problems of pricing and hedging derivatives. This module is fundamental for students intending to work in financial institutions and/or doing an MSc in Financial Mathematics or related areas.

Artificial intelligence (AI) is the theory and development of machines able to perform tasks normally requiring human intelligence, such as visual perception, speech recognition, decision-making, and translation between languages. In the 21st century, AI techniques became an essential part of the technology industry. High-profile examples include autonomous vehicles, medical diagnosis, creating art, proving mathematical theorems, playing games, search engines, and online assistants. This module provides an application driven introduction to AI through studying the basic problems most AI systems have to deal with: search problems, reasoning under uncertainty, knowledge representation, planning, and learning in intelligent systems. The module will also provide a basic introduction to the history and philosophy of AI as well as recent issues in ethics of AI.

The module provides a thorough introduction to the area of Cyber Security, including cryptographic algorithms and protocols, systems vulnerabilities and attacks, computer networks and web security.  The main basic concepts and theoretical foundations are presented in the lectures, while extensive practical sessions support the development of skills in practical cybersecurity.

Software development skills form a fundamental part of the professional expertise of a Computer Scientist. Often the development is a team activity. The module provides the students with the unique opportunity to complete a sizeable software development project working as part of team.

This module covers the concepts of distributed systems and the underlying principles of distributed computing and discusses the issues and various solutions proposed in the distributed computing community. Specifically, communication and broadcast, election algorithms, synchronization and concurrency, fault-tolerance and security related issues will be discussed in the lectures. Where applicable practical implementations of the concepts will be introduced.

The last few decades has seen a huge transformation in finance, where
human traders have been increasingly replaced by algorithms. The aims of COMP226 are to:

– Provide an understanding of financial markets at the level of individual trades;
– Provide an overview of computer-based trading applications;
– Introduce key issues with the use of market data;
– Develop a practical understanding of the development of algorithmic trading strategies.

Analysis of data has become an essential part of current research in many fields including medicine, pharmacology, and biology. It is also an important part of many jobs in e.g. finance, consultancy and the public sector. This module provides an introduction to statistical methods with a strong emphasis on applying and interpreting standard statistical techniques. Since modern statistical analysis of real data sets is performed using computer power, a statistical software package is introduced and employed throughout.

This module introduces topics commonly present in the modern computer games from software architecture principles to advanced artificial intelligence techniques to the creation of 3D content. As part of the continuous assessment, students create a simple 3D video game using an existing game engine and an AI control procedure for a multiuser framework.

Differential equations play a central role in mathematical sciences because they allow us to describe a wide variety of real-world systems and the mathematical techniques encountered in this module are useful to a number of later modules; this is why MATH201 is compulsory for a number of degree programmes. The module will aim to stress the importance of both theory and applications of ordinary differential equations (ODEs) and partial differential equations (PDEs), putting a strong emphasis on problem solving and examples. It has broadly 5 parts and each part contains two types of equations: those that can be solved by specific methods and others that cannot be solved but can only be studied to understand some properties of the underlying equations and their solutions. The main topics are first order ODEs, second order ODEs, systems of ODEs, first-order PDEs and some of the most well-known second-order PDEs, namely the wave, heat and Laplace equations.

This module provides an introduction to probabilistic methods that are used not only in actuarial science, financial mathematics and statistics but also in all physical sciences. It focuses on discrete and continuous random variables with values in one and several dimensions, properties of the most useful distributions (e.g. geometric, exponential, and normal), their transformations, moment and probability generating functions and limit theorems. This module will help students doing MATH260 and MATH262 (Financial mathematics). This module complements MATH365 (Measure theory and probability) in the sense that MATH365 provides the contradiction-free measure theoretic foundation on which this module rests.

This is a foundational module aimed at providing the students with the basic concepts and techniques of modern real Analysis. The guiding idea will be to start using the powerful tools of analysis, familiar to the students from the first year module MATH101 (Calculus I) in the context of the real numbers, to vectors (multivariable analysis) and to functions (functional analysis). The notions of convergence and continuity will be reinterpreted in the more general setting of metric spaces. This will provide the language to prove several fundamental results that are in the basic toolkit of a mathematician, like the Picard Theorem on the existence and uniqueness of solutions to first order differential equations with an initial datum, and the implicit function theorem. The module is central for a curriculum in pure and applied mathematics, as familiarity with these notions will help students who want to take several other subsequent modules as well as many projects. This module is also a useful preparation (although not a formal prerequisite) for MATH365 Measure theory and probability, a very useful module for a deep understanding of financial mathematics.

The term "Operational Research" came in the 20th century from military operations. It describes mathematical methods to achieve the goal (or to find the best possible decision) having limited resources. This branch of applied mathematics makes use of and has stimulated the development of optimisation methods, typically for problems with constraints. This module can be interesting for any student doing mathematics because it concentrates on real-life problems.

Most problems in modern applied mathematics require the use of suitably designed numerical methods. Working exactly, we can often reduce a complicated problem to something more elementary, but this will often lead to integrals that cannot be evaluated using analytical methods or equations that are too complex to be solved by hand. Other problems involve the use of ‘real world’ data, which don’t fit neatly into simple mathematical models. In both cases, we can make further progress using approximate methods. These usually require lengthy iterative processes that are tedious and error prone for humans (even with a calculator), but ideally suited to computers. The first few lectures of this module demonstrate how computer programs can be written to handle calculations of this type automatically. These ideas will be used throughout the module. We then investigate how errors propagate through numerical computations. The focus then shifts to numerical methods for finding roots, approximating integrals and interpolating data. In each case, we will examine the advantages and disadvantages of different approaches, in terms of accuracy and efficiency.

This module deals with the issues associated with the analysis, design, implementation and testing of significant computing systems (that is, systems that are too large to be designed and developed by a single person).

The aim of this module is to provide students with working experience within a commercial or industrial environment and to gain an understanding of the various operational aspects of a company, of its products and working practices.

This module presents formal ways to reason about knowledge and uncertain or partial information.

Biology inspired adaptive algorithms such as Artificial Neural Networks (ANNs) and Genetic Algorithms (GAs) play an important role in modern computing, information processing, and machine learning. The latest increase in computer power ensured broad use of the algorithms to solve problems in science and engineering previously considered impossible to tackle. ANNs are now broadly used in pattern recognition, including speech recognition and classification problems, statistics, functional analysis, modelling financial series with considerable stochasticity, etc. GAs are search procedures based on the mechanics of natural selection and natural genetics. They provide effective solutions to a variety of optimisation problems in economics, linguistics, engineering, and computer science. Both ANNs and GAs can exploit massively parallel architectures to speed up problem solving and provide further understanding of intelligence and adaptation.The main goals of the module are to introduce students to some of the established work in the field of Artificial Neural Networks and Genetic Algorithms and their applications, particularly in relation to multidisciplinary research. To equip students with a broad overview of the field, placing it in a historical and scientific context. The module provides students with the knowledge and skills necessary to keep up-to-date in actively developing areas of science and technology and be able to make reasoned decisions.

​This module aims to teach students some advanced topics in the design and analysis of efficient sequential algorithms, and a few key results related to the study of their complexity.

Multi-agent systems have emerged as one of the most important areas of research and development in information technology in the 1990s. A multi-agent system is one composed of multiple interacting software components known as agents, which are typically capable of co-operating to solve problems that are beyond the abilities of any individual member. Multi-agent systems are important primarily because they have been found to have very wide applicability, in areas as diverse as industrial process control and electronic commerce. This module will begin by introducing the student to the notion of an agent, and will lead them to an understanding of what an agent is, how they can be constructed, and how agents can be made to co-operate effectively with one another to solve problems.

As more complex computational systems are used within critical applications, it is becoming essential that these systems are formally specified. Such specifications are used to give a precise and unambiguous description of the required system. In addition, as computational systems become more complex in general, formal specification can allow us to define the key characteristics of systems in a clear way and so help the development process. Formal specifications provide the basis for verification of properties of systems. While there are a number of ways in which this can be achieved, the model-checking approach is a practical and popular way to verify the temporal properties of finite-state systems. Indeed, such temporal verification is widely used within the design of critical parts of integrated circuits, has recently been used to verify parts of the control mechanism for one of NASA’s space probes, and is now beginning to be used to verify general Java programs.

This module will introduce: the principles of standard formal methods, such as Z; the basic notions of temporal logic and its use in relation to reactive systems; the use of model checking techniques in the verification of reactive systems.

The overall aim of this module is to introduce students to a range of advanced, near-research level topics in contemporary software engineering. The actual choice of topics will depend upon the interests of the lecturer and the topics current in the software engineering research literature at that time. The course will introduce issues from a problem (user-driven) perspective and a technology-driven perspective where users have new categories of software problems that they need to be solved, and where technology producers create technologies that present new opportunities for software products. It will be expected that students will read articles in the software engineering research literature, and will discuss these articles in a seminar-style forum.

This module is an introduction to the area of algorithmic game theory, which is a novel area in the intersection of economics and computer science. It provides tools for dealing with and analysing problems related to applications motivated by the Internet. Examples involve various Internet auctions and e-commerce systems, like, Google’s sponsored search, Ebay auctions, recommendation systems, etc.

In this module we introduce and study games that have some underlying network structure or that appear in auctions. A focus will be on scheduling and routing, as well as on the computational aspects in the design of mechanisms and auctions.

This module is an indepth tour over optimisation methods applied for various optimisation models. These methods are extensively used in both academic and industrial practices.​

Ordinary and partial differential equations (ODEs and PDEs) are crucial to many areas of science, engineering and finance. This module addresses methods for, or related to, their solution. It starts with a section on inhomogeneous linear second-order ODEs which are often required for the solution of higher-level problems. We then generalize basic calculus by considering the optimization of functionals, e.g., integrals involving an unknown function and its derivatives, which leads to a wide variety of ODEs and PDEs. After those systems of two linear first-order PDEs and second-order PDES are classified and reduced to ODEs where possible. In certain cases, e.g., `elliptic’ PDEs like the Laplace equation, such a reduction is impossible. The last third of the module is devoted to two approaches, conformal mappings and Fourier transforms, which can be used to obtain solutions of the Laplace equation and other irreducible PDEs.

​This module provides an introduction to basic concepts and principles of continuum mechanics. Cartesian tensors are introduced at the beginning of the module, bringing simplicity and versatility to the analysis. The module places emphasis on the importance of conservation laws in integral form, and on the fundamental role integral conservation laws play in the derivation of partial differential equations used to model different physical phenomena in problems of solid and fluid mechanics.

The development of Quantum Mechanics, requiring as it did revolutionary changes in our understanding of the nature of reality, was arguably the greatest conceptual achievement of all time. The aim of the module is to lead the student to an understanding of the way that relatively simple mathemactics (in modern terms) led Bohr, Einstein, Heisenberg and others to a radical change and improvement in our understanding of the microscopic world.

The module provides an introduction to the modern theory of finite non-commutative groups. Group Theory is one of the central areas of Pure Mathematics. Being part of Algebra, it has innumerable applications in Geometry, Number Theory, Combinatorics and Analysis, but also plays a very important role in Theoretical Physics, Mechanics and Chemistry. The module starts with basic definitions and some well-known examples (the symmetric group of permutations and the groups of congruence classes modulo an integer) and builds up to some very interesting and non-trivial constructions, such as the semi-direct product, which makes it possible to construct more complicated groups from simpler ones. In the final part of the course, the Sylow theory and its applications to the classification of groups are considered.

Combinatorics is a part of mathematics in which mathematicians deal with discrete and countable structures by means of various combinations, such as permutations, ordered and unordered selections, etc. The seemingly simple methods of combinatorics can raise highly non-trivial mathematical questions and lead to deep mathematical results, which are, in turn, closely related to some fundamental phenomena in number theory

This module studies discrete-time Markov chains, as well as introducing the most basic continuous-time processes. The basic theory for these stochastic processes is considered in detail. This includes the Chapman Kolmogorov equation, communication of states, periodicity, recurrence and transience properties, asymptotic behaviour, limiting and stationary distributions, and an introduction to Poisson processes. Applications in different areas, in particular in insurance, are considered.

This module extends earlier work on linear regression and analysis of variance, and then goes beyond these to generalised linear models. The module emphasises applications of statistical methods. Statistical software is used throughout as familiarity with its use is a valuable skill for those interested in a career in a statistical field.

​MATH367 aims to develop an appreciation of optimisation methods for real-world problems using fundamental tools from network theory; to study a range of ‘standard problems’ and techniques for solving them. Thus, network flow, shortest path problem, transport problem, assignment problem, and routing problem are some of the problems that are considered in the syllabus. MATH367 is a decision making module, which fits well to those who are interested in receiving knowledge in graph theory, in operational research, in economics, in logistics and in finance. 　

This module will provide students with an introduction to the machine learning. It will contain traditional machine learning algorithms, deep learning algorithms, and probabilistic graphical models. Both theoretical knowledge and practical skills will be offered.

To give students the opportunity to work in a guided but independent fashion to explore an individual problem in depth, making practical use of principles, techniques and methodologies acquired elsewhere in the course.

To give experience of carrying out a sustained piece of individual work and in producing a dissertation.

To enhance communication skills, both oral and written.

​Complex network structures are ubiquitous: the world-wide web, the internet, mobile phone networks, social communities, network structures in
biology are just a few popular examples. The module shows how simple combinatorial and algorithmic techniques can be exploited to obtain useful information
about these (often) massive structures. The content is delivered through a mixture of lectures on core topics and more informal presentations on
various application areas. A series of interactive tutorials and on-line tools in VITAL complete the support offered by this module.

This module spans both semesters in the final year, with a small number of teacher training lectures in the first semester, followed by delivery of a lesson in the second semester as part of the department’s outreach activities. Students will consider the issues associated with teaching STEM subjects in schools, and learn how to create a lesson plan that delivers a computer science topic within the context of the National Curriculum in Computing. They will then deliver this lesson several times in a real classroom setting, and reflect on its effectiveness in a written report. There is a significant amount of private study, with the majority of the time spent in the first semester, so students must manage their time effectively.

​To provide an in-depth, systematic and critical understanding of some of the current research issues at the forefront of the academic research domain of data mining.   Google search framework and IBM Watson QA system and various other industrial level data mining applications are discussed.

Einstein’s theories of special and general relativity have introduced a new concept of space and time, which underlies modern particle physics, astrophysics and cosmology. It makes use of, and has stimulated the development of modern differential geometry. This module develops the required mathematics (tensors, differential geometry) together with applications of the theory to particle physics, black holes and cosmology. It is an essential part of a programme in theoretical physics.

Differential geometry studies distances and curvatures on manifolds through differentiation and integration. This module introduces the methods of differential geometry on the concrete examples of curves and surfaces in 3-dimensional Euclidean space. The module MATH248 (Geometry of curves) develops methods of differential geometry on examples of plane curves. This material will be discussed in the first weeks of the course, but previous familiarity with these methods is helpful. Students following a pathway in theoretical physics might find this module interesting as it discusses a different aspect of differential geometry, and might take it together with MATH326 (Relativity). MATH410 (Manifolds, homology and Morse theory) and MATH446 (Lie groups and Lie algebras).​

In this module you will explore, from a game-theoretic point of view, models which have been used to understand phenomena in which conflict and cooperation occur and see the relevance of the theory not only to parlour games but also to situations involving human relationships, economic bargaining (between trade union and employer, etc), threats, formation of coalitions, war, etc.

To provide an understanding of the mathematical risk theory used in practise in non-life actuarial depts of insurance firms, to provide an introduction to mathematical methods for managing the risk in insurance and finance (calculation of risk measures/quantities), to develop skills of calculating the ruin probability and the total claim amount distribution in some non ‐ life actuarial risk models with applications to insurance industry, to prepare the students adequately and to develop their skills in order to be exempted for the exams of CT6 subject of the Institute of Actuaries (MATH366 covers 50% of CT6 in much more depth).

In recent years a culture of evidence-based practice has become the norm in the medical profession. Central to this is the medical statistician, who is required to not only analyse data, but to design research studies and interpret the results. The aim of MATH364 is to provide the student with the knowledge to become part of a “team” to enhance and improve medical practice. This is done by demonstrating the design of studies, methods of analysis and interpretation of results through a number of real-world examples, covering epidemiology, survival analysis, clinical trials and meta-analysis.

Number theory begins with, and is mainly concerned with, the study of the integers. Because of the fundamental role which integers play in mathematics, many of the greatest mathematicians, from antiquity to the modern day, have made contributions to number theory. In this module you will study results due to Euclid, Euler, Gauss, Riemann, and other greats: you will also see many results from the last 10 or 20 years.Several of the topics you will study will be familiar from MATH142 (Numbers, groups, and codes). We will go into them in greater depth, and the module will be self-contained from the point of view of number theory. However, some background in group theory (no more than is in MATH142) will be assumed.

Research is performed in an interesting topic in a particular area of Mathematics under the supervision of a member of staff, which is followed by preparation of a report and an oral presentation. It is hoped that this will provide insights into more advanced subjects and experience in handling specialist literature.

This module introduces fundamental topics in mathematical statistics, including the theory of point estimation and hypothesis testing. Several key concepts of statistics are discussed, such as sufficiency, completeness, etc., introduced from the 1920s by major contributors to modern statistics such as Fisher, Neyman, Lehmann and so on. This module is absolutely necessary preparation for postgraduate studies in statistics and closely related subjects.

This modules aims to cover advanced concepts underpinning computer games development; including game AI, content generation, graphics, physics and sound. As part of the continuous assessment, students apply those concepts to computer games development.