Scribd
Upload
31 views10 pages

Boolean Logic jpqZ2YP8Hxg45VHZ Hard

Uploaded by

leoryo
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
31 views10 pages

Boolean Logic jpqZ2YP8Hxg45VHZ Hard

Uploaded by

leoryo
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/ 10

IGCSE Cambridge (CIE) Computer Science 40 mins 5 questions

Exam Questions

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

Scan here for your answers


or visit savemyexams.com

Total Marks /40

© 2024 Save My Exams, Ltd. Get more and ace your exams at savemyexams.com 1
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.

© 2024 Save My Exams, Ltd. Get more and ace your exams at savemyexams.com 2
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)

© 2024 Save My Exams, Ltd. Get more and ace your exams at savemyexams.com 3
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.

© 2024 Save My Exams, Ltd. Get more and ace your exams at savemyexams.com 4
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.

© 2024 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)

© 2024 Save My Exams, Ltd. Get more and ace your exams at savemyexams.com 6
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.

© 2024 Save My Exams, Ltd. Get more and ace your exams at savemyexams.com 7
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)

© 2024 Save My Exams, Ltd. Get more and ace your exams at savemyexams.com 8
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.

© 2024 Save My Exams, Ltd. Get more and ace your exams at savemyexams.com 9
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)

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

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy