The dMAT Computer Science Module: Boolean Logic & Linear Algebra

A common trap with the Computer Science Subject Module is preparing broadly — algorithms, operating systems, networks — when the exam tests two specific areas in depth: Boolean logic and linear algebra.

Boolean logic

Expect questions on:

• Truth tables and logical equivalence
• Simplifying expressions with the standard laws
• Reasoning about AND, OR, NOT, XOR and implication

The skill is manipulation under time pressure. Know the identities cold so you are simplifying, not deriving from scratch.

Linear algebra

The linear algebra portion focuses on the operations that appear repeatedly:

• Matrix multiplication and properties
• Determinants and invertibility
• Solving linear systems

You do not need graduate-level theory. You need to execute the core operations accurately and quickly.

How to prepare efficiently

1. Narrow, then deep. Ignore the broad CS syllabus you might expect. Focus your hours on these two areas.
2. Drill Basic before Advanced. Advanced tasks assume the basics are automatic.
3. Time everything. Both accuracy and speed are scored in practice.

The CS module rewards depth in two areas, not breadth across twenty. Prepare accordingly and you will finish with time to spare.

Our Computer Science module covers exactly these two officially tested areas, with Basic and Advanced task practice.