Scribd
Upload
29 views

boolean logic_Computer Science

The document outlines an IGCSE Cambridge Computer Science exam consisting of 9 questions focused on Boolean logic, logic gates, truth tables, and logic expressions. It categorizes questions into easy, medium, and hard levels, with a total of 59 marks available. Each question requires students to complete truth tables, draw logic circuits, or write logic expressions based on provided statements or diagrams.

Uploaded by

Risheet
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
29 views

boolean logic_Computer Science

The document outlines an IGCSE Cambridge Computer Science exam consisting of 9 questions focused on Boolean logic, logic gates, truth tables, and logic expressions. It categorizes questions into easy, medium, and hard levels, with a total of 59 marks available. Each question requires students to complete truth tables, draw logic circuits, or write logic expressions based on provided statements or diagrams.

Uploaded by

Risheet
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 16

IGCSE Cambridge (CIE) Computer Science 59 mins 9 questions

Exam Questions

Boolean Logic
Logic Gates / Logic Circuits / Truth Tables / Logic Expressions

Easy (2 questions) /8 Scan here to return to the course


or visit savemyexams.com
Medium (2 questions) /11

Hard (5 questions) /40

Total Marks /59

© 2025 Save My Exams, Ltd. Get more and ace your exams at savemyexams.com 1
Easy Questions
1 Four logic gates and five standard symbols for logic gates are shown

Draw one line to link each logic gate to its standard symbol. Not all standard symbols
will be used.

(4 marks)

© 2025 Save My Exams, Ltd. Get more and ace your exams at savemyexams.com 2
2 (a) Complete the truth table in Fig. 1 for the Boolean statement P = NOT(A AND B).

A B P

0 0 1

0 1

1 0

1 1 0

Fig. 1

(2 marks)

(b) Complete the truth table for the following logic gate.

© 2025 Save My Exams, Ltd. Get more and ace your exams at savemyexams.com 3
A B Q

0 0 0

0 1 1

(2 marks)

© 2025 Save My Exams, Ltd. Get more and ace your exams at savemyexams.com 4
Medium Questions
1 (a) Consider this logic expression.

X = ( A AND B ) OR ( B AND NOT C )

Draw a logic circuit for this logic expression.

Each logic gate must have a maximum of two inputs.

Do not simplify this logic expression.

(4 marks)

(b) Complete the truth table from the given logic expression.

© 2025 Save My Exams, Ltd. Get more and ace your exams at savemyexams.com 5
A B C Working space X

0 0 0

0 0 1

0 1 0

0 1 1

1 0 0

1 0 1

1 1 0

1 1 1

(4 marks)

© 2025 Save My Exams, Ltd. Get more and ace your exams at savemyexams.com 6
2 Write the Boolean expression represented by the logic diagram below:

(3 marks)

© 2025 Save My Exams, Ltd. Get more and ace your exams at savemyexams.com 7
Hard Questions
1 (a) Consider the truth table:

A B C X

0 0 0 0

0 0 1 0

0 1 0 0

0 1 1 0

1 0 0 1

1 0 1 0

1 1 0 0

1 1 1 1

Draw a logic circuit to represent the given truth table.

Each logic gate should have maximum of two inputs.

© 2025 Save My Exams, Ltd. Get more and ace your exams at savemyexams.com 8
Do not simplify the logic circuit.

(6 marks)

(b) Write a logic expression for the given truth table.

Do not simplify the logic expression.

(3 marks)

© 2025 Save My Exams, Ltd. Get more and ace your exams at savemyexams.com 9
2 (a) Consider this logic expression.

Z = (NOT A OR B) AND (B XOR C)

Draw a logic circuit for this logic expression.

Each logic gate must have a maximum of two inputs.

Do not simplify this logic expression.

(4 marks)

(b) Complete the truth table from the given logic expression.

© 2025 Save My Exams, Ltd. Get more and ace your exams at savemyexams.com 10
A B C Working space X

0 0 0

0 0 1

0 1 0

0 1 1

1 0 0

1 0 1

1 1 0

1 1 1

(4 marks)

3 Consider this logic expression.

X = (A OR B) AND (NOT B AND C)

Complete the truth table for this logic expression.

© 2025 Save My Exams, Ltd. Get more and ace your exams at savemyexams.com 11
A B C Working space X

0 0 0

0 0 1

0 1 0

0 1 1

1 0 0

1 0 1

1 1 0

1 1 1

(4 marks)

© 2025 Save My Exams, Ltd. Get more and ace your exams at savemyexams.com 12
4 (a) Consider the following logic statement:

X = ((A OR B) AND (NOT (B XOR C)) AND C)

Draw a logic circuit to represent the given logic statement.

Do not attempt to simplify the logic statement. All logic gates must have a maximum of
two inputs.

(5 marks)

(b) Complete the truth table for the given logic statement.

© 2025 Save My Exams, Ltd. Get more and ace your exams at savemyexams.com 13
A B C Working space X

0 0 0

0 0 1

0 1 0

0 1 1

1 0 0

1 0 1

1 1 0

1 1 1

(4 marks)

© 2025 Save My Exams, Ltd. Get more and ace your exams at savemyexams.com 14
5 (a) Consider the following logic statement:

X = (((A AND NOT B) OR (NOT (B NOR C))) AND C)

Draw a logic circuit to represent the given logic statement.

Do not attempt to simplify the logic statement. All logic gates must have a maximum of
two inputs.

(6 marks)

(b) Complete the truth table for the given logic statement.

© 2025 Save My Exams, Ltd. Get more and ace your exams at savemyexams.com 15
A B C Working space X

0 0 0

0 0 1

0 1 0

0 1 1

1 0 0

1 0 1

1 1 0

1 1 1

(4 marks)

© 2025 Save My Exams, Ltd. Get more and ace your exams at savemyexams.com 16

You might also like