11 September 2024

Updated Module information:

Removed the following modules:

1. “Discrete Mathematics and its Applications I”
2. “Discrete Mathematics and its Applications II”
3. “Formal Languages”
4. “Logic and Verification” (from the list of optional modules)
5. “Introduction to Mathematical Statistics” (from the list of optional modules)

Discrete Mathematics and its Applications I

In this foundation module, you’ll learn the basic language, concepts and methods of discrete mathematics, while developing your appreciation of how these are used in algorithms and data structures. By the end, you should be able to appreciate the role of formal definitions, mathematical proofs and underlying algorithmic thinking in practical problem-solving. You’ll acquire knowledge of logic, sets, relations and functions, and learn summation techniques (manipulations and finite calculus) and concepts including asymptotics and the big-O notation to prepare you for more advanced techniques in computer science.

---

Discrete Mathematics and its Applications II

During this module, you will build on your foundations in discrete mathematics through the study of concepts such as discrete probability and graph theory; learning how to apply these methods in problem-solving. By the end of your course, you will be able to use probabilistic techniques to analyse basic discrete structures and algorithms, understand the importance of asymptotic notation, and be able to use it to analyse asymptotic performance for some basic algorithms. Also, you will study the properties of graphs and related discrete structures, and be able to relate these to practical examples.

---

Formal Languages

You will gain a fundamental understanding of formal languages and how the Chomsky hierarchy classifies them. You’ll study techniques for exploring the regularity of languages using closure properties and pumping lemmas, whilst also considering automata models, alongside the notion of computability. These concepts are central to computer science, and completion will see you able to specify between, and translate, various forms of formal language descriptions. You’ll learn methods of lexical analysis and parsing, and be able to argue whether a formal language is regular or context free. The teachings will discuss Turing machines and philosophical concepts such as decidability, reducibility and the halting problem.

Added the following modules:

Logic and Automata

Computer Science is founded on logic and abstract machines (automata) to solve computational problems. Whether a computational problem is tractable in the first place or not, requires, for example, understanding of what Turing machines are, and of concepts such as decidability, reducibility and the halting problem. In this module, you will be introduced to formal methods for specifying and analysing the behaviour of computational systems, through studying algorithms and proof calculi for verification, as well as associated techniques, such as propositional and predicate logic and comparing the semantics of a variety of logics. In addition to learning about the basic connections between mathematical logic, formal languages, automata theory and verification by model checking, you will also learn and practise proof techniques for reasoning about the limits of various computational models.

Read more about the Logic and Automata moduleLink opens in a new windowLink opens in a new window, including the methods of teaching and assessment (content applies to 2025/26 year of study).

---

Introduction to Discrete Mathematics

Discrete mathematics includes the study of logic, algorithmic thinking, sets and finite calculus. The focus of this module is on the application of these concepts in relation to algorithms and data structures in modern computer science. The tools taught in this module provide a core foundation that will allow you to grow your understanding of mathematical and algorithmic processes and be able to apply them in problem-solving. You’ll acquire knowledge on a broad range or core principles, such as logic, sets, relations and functions. As well as this, more advanced topics such as summation techniques (manipulations and finite calculus), asymptotics and big-O notation are covered.

Read more about the Introduction to Discrete Mathematics moduleLink opens in a new windowLink opens in a new windowLink opens in a new window, including the methods of teaching and assessment (content applies to 2025/26 year of study).

---

Introduction to Mathematical Statistics

The purpose of this module is to provide a systematic introduction to major ideas of statistical inference, with an emphasis on likelihood methods of estimation and testing. The module aims are to introduce systematically the major ideas of statistical inference with an emphasis on likelihood methods of estimation and testing.

A good understanding of these ideas is crucial preparation for further investigation of applied and methodological statistics, machine learning, and the core statistical aspects of data science. The module will consolidate and extend the initial understanding of probability developed in the first-year module ST120 Introduction to Probability.

Read more about the Introduction to Mathematical Statistics moduleLink opens in a new windowLink opens in a new window, including the methods of teaching and assessment (content applies to 2024/25 year of study).

17 May 2024

Updated Entry requirements

Old:

A level typical offer

A*A*A to include A* in Mathematics or Further Mathematics.

A level contextual offer

We welcome applications from candidates who meet the contextual eligibility criteria. The typical contextual offer is A*AA including A* in Mathematics or Further Mathematics. See if you’re eligible.

Subject Combinations

• We are looking for students with strong mathematical ability and A-level Mathematics or Further Mathematics is therefore required for this programme.
• When evaluating whether to make an offer, we will consider the top three grades (including Mathematics or Further Mathematics). A fourth A Level will not be considered.

Other UK Qualifications

Welsh Baccalaureate

A*AA in three subjects at A level including A* in Mathematics or Further Mathematics plus grade C in the Advanced Welsh Baccalaureate Skills Challenge Certificate.

New:

A level typical offer

A*A*A to include A* in Mathematics.

A level contextual offer

We welcome applications from candidates who meet the contextual eligibility criteria. The typical contextual offer is A*AA including A* in Mathematics. See if you’re eligible.

Subject Combinations

• We are looking for students with strong mathematical ability and A-level Mathematics is therefore required for this programme.
• When evaluating whether to make an offer, we will consider the top three grades (including Mathematics). A fourth A Level will not be considered.

Other UK Qualifications

Welsh Baccalaureate

A*AA in three subjects at A level including A* in Mathematics plus grade C in the Advanced Welsh Baccalaureate Skills Challenge Certificate.

7 May 2024

We have added information to the general entry requirements for this course:

New content:

• All 2024–25 applicants will be required to take TMUA except for applicants who are eligible for a Contextual Offer – see our Contextual Offers webpageLink opens in a new window to check your eligibility.
• TMUA scores will be assessed alongside other factors (including GCSEs, contextual indicators and predicted grades) to determine which applicants receive an offer.
• The exact requirement in TMUA will be set once all results have been received. We cannot advise on the TMUA requirement at this stage.

Please note that applicants who do not take TMUA and who are not eligible for a Contextual Offer may not be considered for an offer.

For further details including test dates and how to register for TMUA, please see the TMUA at Warwick webpageLink opens in a new window.