Discrete Mathematics (BSc)
Discrete Mathematics (BSc) draws on areas of both computer science and mathematics. You will acquire skills in software engineering, combinatorial analysis, formal proof and algorithmic analysis. Regular individual and group projects to consolidate what you’ve learned by applying it to practical problems.
Your learning experiences throughout the course will enable you to both analyse and solve problems in an abstract sense, and realise solutions through computer software. These abilities, alongside transferable skills in communication, planning and self-organisation are highly valued by employers.
Your first year will establish the foundations of Discrete Mathematics and its applications, covering proof, formal arguments, rigour and calculations, as well as mathematical reasoning, combinatorial analysis and discrete structures.
In your second year you’ll develop a rigorous understanding of the subject’s theoretical basis, which will prepare you for later specialisation.
In your third year you’ll work alongside academics on an individual project as well as focusing on applications of Discrete Mathematics to Computer Science, and completing advanced modules on algorithms and computation.
In each year of their course, students are expected to study a core group of modules and to make up the required normal load for the year by choosing a set of optional modules. There is a choice of optional modules available and there may be requirements to be satisfied by the choices: that a minimum number be chosen from a specific list.
Our courses offer a balance of core material delivered through lectures, small-group seminars and hands-on laboratory sessions. Approximately a quarter of your time is spent in timetabled classes, with the remainder being used for private study, completing assignments and projects, and practical work in the dedicated computing laboratories, which are open 24/7.
Your performance on most modules will be assessed by a combination of coursework and written examination. The coursework may be individual or group work involving programming, research, writing and presentation. The final-year project work is fully assessed by a presentation and project reports. Each year contributes to the final degree classification, typically in the ratio of 10:30:60 for a BSc degree.
You can spend a year at one of our partner institutions overseas. We have an established exchange programme with the Hong Kong University of Science and Technology, which provides opportunities for our students to experience teaching and learning at another world leading institution. In addition to benefitting from a rich cultural experience, students returning from studying overseas exhibit an international profile that is attractive to potential employers.
We provide support for students wanting to spend a year in industry by promoting opportunities, hosting departmental careers fairs and offering one-to-one sessions with our departmental careers advisor. Intercalated year students are supported by their personal tutor and our Industrial Liaison Team during their year in industry. Students working in the UK are visited by academic representatives to review their development during the year.
IB: 38 with 6,6,6 in three Higher Level subjects including 6 in Higher Level Mathematics
In addition to Mathematics, many of our applicants are also taking one of the following subjects at A level or equivalent: Further Mathematics, Computer Science, Biology, Chemistry, Physics. However, all applications will be considered on their individual merits.
Contextual data and differential offers
Warwick may make differential offers to students in a number of circumstances. These include students participating in the Realising Opportunities programme, or who meet two of the contextual data criteria. Differential offers will be one or two grades below Warwick’s standard offer (to a minimum of BBB).
- Warwick International Foundation Programme (IFP)
All students who successfully complete the Warwick IFP and apply to Warwick through UCAS will receive a guaranteed conditional offer for a related undergraduate programme (selected courses only). For full details of standard offers and conditions visit the IFP website.
We welcome applications from students with other internationally recognised qualifications. For more information please visit the international entry requirements page.
Taking a gap year
Applications for deferred entry welcomed.
We do not typically interview applicants. Offers are made based on your UCAS form which includes predicted and actual grades, your personal statement and school reference.
Programming for Computer Scientists
On this module, whatever your starting point, you will begin your professional understanding of computer programming through problem-solving, and fundamental structured and object-oriented programming. You will learn the Java programming language, through practical work centred on the Warwick Robot Maze environment, which will take you from specification to implementation and testing. Through practical work in object-oriented concepts such as classes, encapsulation, arrays and inheritance, you will end the course knowing how to write programs in Java, and, through your ability to analyse errors and testing procedures, be able to produce well-designed and well-encapsulated and abstracted code.
Design of Information Structures
Following on from Programming for Computer Scientists, on the fundamentals of programming, this module will teach you all about data structures and how to program them. We will look at how we can represent data structures efficiently and how we can apply formal reasoning to them. You will also study algorithms that use data structures. Successful completion will see you able to understand the structures and concepts underpinning object-oriented programming, and able to write programs that use large data sets.
Discrete Mathematics and its Applications 1
On this foundation module, you’ll learn the basic language, concepts and methods of discrete mathematics, while develop 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 2
During this module, you will build on your foundations in discrete mathematics through the study of concepts such as discrete probability and number theory; learning how to apply these methods in problem-solving. By the end of your course, you’ll be able to use algebraic techniques (including linear and matrix algebra) to analyse basic discrete structures and algorithms, and understand the importance of asymptotic notation, and be able to use it to analyse asymptotic performance for some basic algorithmic examples. Also, you will study the properties of graphs and related discrete structures, and be able to relate these to practical examples.
Linear algebra addresses simultaneous linear equations. You will learn about the properties of vector space, linear mapping and its representation by a matrix. Applications include solving simultaneous linear equations, properties of vectors and matrices, properties of determinants and ways of calculating them. You will learn to define and calculate eigenvalues and eigenvectors of a linear map or matrix. You will have an understanding of matrices and vector spaces for later modules to build on.
Analysis is the rigorous study of calculus. In this module there will be considerable emphasis throughout on the need to argue with much greater precision and care than you had to at school. With the support of your fellow students, lecturers and other helpers, you will be encouraged to move on from the situation where the teacher shows you how to solve each kind of problem, to the point where you can develop your own methods for solving problems. By the end of the year you will be able to answer interesting questions like, what do we mean by `infinity'?
Sets and Numbers
It is in its proofs that the strength and richness of mathematics is to be found. University mathematics introduces progressively more abstract ideas and structures, and demands more in the way of proof, until most of your time is occupied with understanding proofs and creating your own. Learning to deal with abstraction and with proofs takes time. This module will bridge the gap between school and university mathematics, taking you from concrete techniques where the emphasis is on calculation, and gradually moving towards abstraction and proof.
If you’ve covered mathematical modules MA131 and MA132, this takes you further in your exploration of probability and random outcomes. Starting with examples of discrete and continuous probability spaces, you’ll learn methods of counting (inclusion–exclusion formula and multinomial co-efficients), and examine theoretical topics including independence of events and conditional probabilities. Using Bayes’ theorem and Simpson’s paradox, you’ll reason about a range of problems involving belief updates, and engage with random variables, learning about probability mass, density and cumulative distribution functions, and the important families of distributions. Finally, you’ll study variance and co-variance, including Chebyshev’s and Cauchy-Schwartz inequalities.
Algorithmic Graph Theory
This project-based module will provide you with experience of designing, developing and implementing a significant project, under supervision. From submission of the outline and detailed specification, you will produce regular progress reports, until presenting your final results. This is an excellent opportunity to develop important professional business skills, including independent learning, self-discipline, organisation and time management. Providing you with experience of undertaking a significant individual design and development exercise from conception through to design, implementation and delivery.
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.
Data structures and algorithms are fundamental to programming and to understanding computation. On this module, you will be using sophisticated tools to apply algorithmic techniques to computational problems. By the close of the course, you’ll have studied a variety of data structures and will be using them for the design and implementation of algorithms, including testing and proofing, and analysing their efficiency. This is a practical course, so expect to be working on real-life problems using elementary graph, greedy, and divide-and-conquer algorithms, as well as gaining knowledge on dynamic programming and network flows.
Discrete Mathematics Project
Through this practical module, you’ll gain experience in undertaking a significant individual design and development exercise in discrete mathematics, from conception through to design, implementation and delivery. Starting with the selection of a topic and location of a suitable supervisor, you’ll be responsible for regular progress reports, and a presentation of your final results alongside a detailed written report. In addition to enhancing your technical knowledge, this process will help you develop important skills such as self-discipline, time management, organisation and professional communications.
Complexity of Algorithms
Are you ready for a challenge? In this module, you’ll learn to analyse the intrinsic difficulty of various computational challenges, and to specify variations that may be more tractable. This will require you to learn notions of the complexity of algorithms, and what makes some computational problems harder than others. You’ll undertake a close study of what makes an algorithm efficient, and study various models of computation, in particular, models of classical deterministic and non-deterministic computations.
Approximation and Randomised Algorithms
On this module, you will gain an introductory understanding of approximation and randomised algorithms, which often provide a simple, viable alternative to standard algorithms. You’ll learn the mathematical foundations underpinning the design and analysis of such algorithms. Whilst gaining experience of using suitable mathematical tools to design approximation algorithms and analyse their performance. You’ll also learn techniques for designing faster but weaker algorithms for particular situations, such as large running times. You can expect to cover important concepts, including linearity of expectation, Chernoff bounds, and deterministic and randomised rounding of linear programs.
Selection of optional modules that current students are studying:
Experimental Mathematics; Introduction to Geometry; Geometry and Motion; Introduction to Abstract Algebra; Probability; Professional Skills; Functional
Programming; Visualisation; Computer Security; Advanced Linear Algebra; Stochastic Processes
Graduates from these courses have gone on to work for employers including: Google, Apple, Amazon Prime, IBM, Accenture, Barclays, Morgan Stanley, BP, Deloitte, ARM, Ernst and Young, CERN, Sega, GCHQ, Tesco, BA, D.E.Shaw, Goldman Sachs, M&S, Unilever, JPMorgan, Bloomberg, Ford Motor Company, KMPG and Mintel.
They have pursued roles such as: software engineer; systems analyst; investment analyst; web designer/developer; business analyst; actuary, economist and statistician; computer science researcher; university academic; teacher; entrepreneur and start-up owner.
Helping you find the right career
Our department has a dedicated professionally qualified Senior Careers Consultant offering impartial advice and guidance together with workshops and events throughout the year. Previous examples of workshops and events include:
- Computing Your Career
- Technology in Professional Services
- Warwick careers fairs throughout the year
- Working in the Computer Games industry
- Computer Science Alumni Event
Find out more about our Careers & Skills Services here.
A level: A*AA to include A* in Mathematics
IB: 38 with 6,6,6 in three Higher Level subjects including 6 in Higher Level Mathematics
Additional requirements: You will also need to meet our English Language requirements.
Degree of Bachelor of Science (BSc)
3 years full-time
28 September 2020
Location of study
University of Warwick, Coventry
Find out more about fees and funding
Additional course costs
There may be costs associated with other items or services such as academic texts, course notes, and trips associated with your course. Students who choose to complete a work placement will pay reduced tuition fees for their third year.
This information is applicable for 2020 entry.
Given the interval between the publication of courses and enrolment, some of the information may change. It is important to check our website before you apply. Please read our terms and conditions to find out more.
What our students say...
Straight from the students themselves.