State how many rows (excluding any headings) would be required in a truth table for the logic expression:
Q=(A AND B) OR (C AND NOT D) Q = (A \text{ AND } B) \text{ OR } (C \text{ AND NOT } D) Q=(A AND B) OR (C AND NOT D).
Practise OCR GCSE Computer Science Boolean logic with exam-style questions for GCSE Computer Science. 27 questions, matched to the OCR GCSE Computer Science (J277) specification and written in Component 01 and Component 02 style. Every question includes a full worked solution and mark scheme, so you can see where marks are awarded rather than just whether you got the answer right.