UUnizy

Queen Mary · ECS407U · School of Electronic Engineering and Computer Science

ECS407U Logic and Discrete Structures: exam practice questions, marked

Practise for ECS407U Logic and Discrete Structures at Queen Mary University of London with 45 quick-recall questions, 18 exam-style questions and 9 first-class stretch questions, written from the module’s published description. Write an answer and get it marked against Queen Mary’s grade bands in about 30 seconds, with the exact sentences that lost marks and three changes to reach the next class.

Try one free, no sign-up Create a free account

Example ECS407U question

(a) Construct a truth table for (p → q) ∧ (q → r) → (p → r). [6] (b) State whether the formula is a tautology, a contradiction or neither, justifying your answer. [2] (c) Show, using known equivalences rather than a truth table, that p → (q → r) is equivalent to (p ∧ q) → r. [4]

Topics covered

  1. Propositional Logic: Syntax and Semantics
  2. Normal Forms and Satisfiability
  3. Proof Methods and Natural Deduction
  4. Predicate Logic
  5. Sets, Relations and Functions
  6. Induction and Recursion
  7. Counting and Combinatorics
  8. Graphs and Trees
  9. Boolean Algebra and Discrete Structures in Computing

About the module

The module consists of two parts, each of fundamental importance for any serious approach to Computer Science: Logic and Discrete Structures. Logic has been called the Calculus of Computer Science.

Unizy is an independent revision tool and is not affiliated with or endorsed by Queen Mary University of London. Marks are practice estimates, not official marks.