Discrete Mathematics

About this course

Discrete mathematics is concerned with mathematical structures that are fundamentally countable or separated rather than continuous. It encompasses combinatorics, graph theory, logic, number theory, formal languages and the mathematics of algorithms, and it provides the rigorous theoretical foundation for computer science and many areas of applied mathematics. Unlike calculus and analysis, which deal with continuous quantities, discrete mathematics works with networks, permutations, sets, proofs and structures that map naturally onto the computational problems that underpin modern software, cryptography, data science and artificial intelligence. At the University of Warwick, this three-year full-time degree draws explicitly on both computer science and mathematics, developing skills across software engineering, combinatorial analysis, formal proof and algorithmic analysis. Warwick has o

Where its graduates go

The 4 largest scored destinations, covering 90% of graduates; the headline also reflects the subject baseline.

• 72 / 100Information Technology Professionals · 75% of graduatescards →
• 40 / 100Sales occupations · 5% of graduatescards →
• 40 / 100Natural and social science professionals · 5% of graduatescards →
• 40 / 100Science, engineering and technology associate professionals · 5% of graduatescards →

The tabs above carry the rest: modules and satisfaction (The Course), where you'd live and what it costs (Student Life), the full pay story (Pay & Outcomes), and easier ways into the same subject (Alternatives).