Logic and Discrete Mathematics module (CS31003)

Logical and mathematical theory are at the core of computer science. Research in both formal logic and discrete mathematics increased significantly from the latter half of the twentieth century, and is paramount for the innovative advancements in the development of digital computers.

The key principles of these fields can be found at the lowest level of computing, where boolean algebra dictates the basic instructions for processors. Other concepts, such as graph theory and recursion, are immensely useful in algorithm and software design.

Studying the logical and mathematical backbone of computer science will not only improve your understanding of how computers function on the lowest level, but also enable you to improve your problem-solving skills and approach complex computational problems.

What you will learn

In this module, you will:

• explore key theoretical concepts in logic and discrete mathematics
• study the relation between logic and mathematics on the one hand, and computer science on the other
• learn how to apply formal notation and key concepts, including proofs

You will study the following concepts and theories:

• boolean algebra
• propositional logic
• predicate calculus
• deduction, induction, abduction
• recursion
• number theory
• graph theory
• game theory

By the end of this module, you will be able to:

• demonstrate your understanding of logic and discrete mathematics and apply your knowledge in the context of computer science

discuss the relationship between logical and mathematical theory and computer science

Assignments / assessment

• formal logic coursework (25%)
• discrete mathematics coursework (25%)
• written exam (50%)

Teaching methods / timetable

You will learn by taking a hands-on approach. This will involve taking part in tutorials and practical sessions.

Learning material is provided through videos, review notes, examples, and tutorial questions.