0% found this document useful (0 votes)
23 views18 pages

9608/31/o/n/15 © Ucles 2015

The document contains a series of questions related to Boolean algebra, truth tables, Karnaugh Maps, and logic circuits. It includes tasks such as completing truth tables, deriving Boolean expressions, and simplifying them using K-maps. Additionally, it discusses digital certificates and their components, including the role of a Certificate Authority.

Uploaded by

ubaidali1417
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
0% found this document useful (0 votes)
23 views18 pages

9608/31/o/n/15 © Ucles 2015

The document contains a series of questions related to Boolean algebra, truth tables, Karnaugh Maps, and logic circuits. It includes tasks such as completing truth tables, deriving Boolean expressions, and simplifying them using K-maps. Additionally, it discusses digital certificates and their components, including the role of a Certificate Authority.

Uploaded by

ubaidali1417
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/ 18

QUESTION 5.

5 (a) (i) Complete the Boolean function that corresponds to the following truth table.

INPUT OUTPUT

A B C X

0 0 0 0

0 0 1 0

0 1 0 0

0 1 1 1

1 0 0 0

1 0 1 0

1 1 0 1

1 1 1 1

X = A . B . C + ................................................................................................................[3]

The part to the right of the equals sign is known as the sum-of-products.

(ii) For the truth table above complete the Karnaugh Map (K-map).

AB

00 01 11 10

0
C
1
[1]

The K-map can be used to simplify the function in part(a)(i).

(iii) Draw loop(s) around appropriate groups of 1’s to produce an optimal sum-of-products.
[2]

(iv) Using your answer to part (a)(iii), write the simplified sum-of-products Boolean function.

X = .................................................................................................................................[2]

© UCLES 2015 9608/31/O/N/15 [Turn over


10

(b) The truth table for a logic circuit with four inputs is given below:

INPUT OUTPUT
A B C D X
0 0 0 0 0
0 0 0 1 0
0 0 1 0 0
0 0 1 1 0
0 1 0 0 1
0 1 0 1 0
0 1 1 0 1
0 1 1 1 0
1 0 0 0 0
1 0 0 1 0
1 0 1 0 0
1 0 1 1 0
1 1 0 0 1
1 1 0 1 0
1 1 1 0 1
1 1 1 1 1

(i) Complete the K-map corresponding to the truth table above.

AB

CD

[4]

(ii) Draw loop(s) around appropriate groups of 1’s to produce an optimal sum-of-products.
[2]

(iii) Using your answer to part (b)(ii), write the simplified sum-of-products Boolean function.

X = .................................................................................................................................[2]

© UCLES 2015 9608/31/O/N/15


QUESTION 6. 9

5 (a) (i) Complete the Boolean function that corresponds to the following truth table.

INPUT OUTPUT

P Q R Z

0 0 0 0

0 0 1 0

0 1 0 0

0 1 1 0

1 0 0 1

1 0 1 1

1 1 0 0

1 1 1 1

Z = P . Q . R + ................................................................................................................[3]

The part to the right of the equals sign is known as the sum-of-products.

(ii) For the truth table above complete the Karnaugh Map (K-map).

PQ

00 01 11 10

0
R
1
[1]

The K-map can be used to simplify the function in part(a)(i).

(iii) Draw loop(s) around appropriate groups of 1’s to produce an optimal sum-of-products.
[2]

(iv) Using your answer to part (a)(iii), write the simplified sum-of-products Boolean function.

Z = .................................................................................................................................[1]

© UCLES 2015 9608/32/O/N/15 [Turn over


10

(b) The truth table for a logic circuit with four inputs is given below:

INPUT OUTPUT
P Q R S Z
0 0 0 0 0
0 0 0 1 0
0 0 1 0 0
0 0 1 1 0
0 1 0 0 0
0 1 0 1 1
0 1 1 0 0
0 1 1 1 1
1 0 0 0 0
1 0 0 1 1
1 0 1 0 0
1 0 1 1 0
1 1 0 0 0
1 1 0 1 1
1 1 1 0 0
1 1 1 1 1

(i) Complete the K-map corresponding to the truth table above.

PQ

RS

[4]

(ii) Draw loop(s) around appropriate groups of 1’s to produce an optimal sum-of-products.
[2]

(iii) Using your answer to part (b)(ii), write the simplified sum-of-products Boolean function.

Z = .................................................................................................................................[2]

© UCLES 2015 9608/32/O/N/15


QUESTION 7. 8

3 Consider the following logic circuit, which contains a redundant logic gate.

A
X

(a) Write the Boolean algebraic expression corresponding to this logic circuit.

X = ........................................................................................................................................[3]

(b) Complete the truth table for this logic circuit.

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
[2]

(c) (i) Complete the Karnaugh Map (K-map) for the truth table in part (b).
AB
00 01 11 10
0
C
1
[1]
The K-map can be used to simplify the expression in part (a).

(ii) Draw loop(s) around appropriate groups to produce an optimal sum-of-products. [2]

(iii) Write a simplified sum-of-products expression, using your answer to part (ii).

X = .................................................................................................................................[2]

© UCLES 2017 9608/31/M/J/17


9

(d) One Boolean identity is:

̅
A + A.B =A+B

Simplify the expression for X in part (a) to the expression for X in part (c)(iii). You should use
the given identity.

...................................................................................................................................................

...................................................................................................................................................

...................................................................................................................................................

...............................................................................................................................................[2]

© UCLES 2017 9608/31/M/J/17 [Turn over


QUESTION 8. 6

(c) Digital certificates are used in internet communications. A Certificate Authority (CA) is
responsible for issuing a digital certificate.

The digital certificate contains a digital signature produced by the CA.

(i) Name three additional data items present in a digital certificate.

1 ........................................................................................................................................

2 ........................................................................................................................................

3 ........................................................................................................................................
[3]

(ii) Describe how the digital signature is produced by the CA.

...........................................................................................................................................

...........................................................................................................................................

...........................................................................................................................................

...........................................................................................................................................

...........................................................................................................................................

.......................................................................................................................................[3]

(iii) Give the reason for including a digital signature in the digital certificate.

...........................................................................................................................................

.......................................................................................................................................[1]

3 A logic circuit is shown:

S
Q

(a) Write the Boolean algebraic expression corresponding to this logic circuit:

S = ........................................................................................................................................[4]

© UCLES 2017 9608/32/M/J/17


7

(b) Complete the truth table for this logic circuit:

P Q R Working space S

0 0 0

0 0 1

0 1 0

0 1 1

1 0 0

1 0 1

1 1 0

1 1 1
[2]

(c) (i) Complete the Karnaugh Map (K-map) for the truth table in part (b).
PQ
00 01 11 10
0
R
1
[1]

The K-map can be used to simplify the function in part (a).

(ii) Draw loop(s) around appropriate groups to produce an optimal sum-of-products. [1]

(iii) Write a simplified sum-of-products expression, using your answer to part (ii).

S = .................................................................................................................................[1]

(d) One Boolean identity is:


(A + B) . C = A . C + B . C

Simplify the expression for S in part (a) to the expression for S in part (c)(iii).

You should use the given identity and De Morgan’s Laws.

...................................................................................................................................................

...................................................................................................................................................

...................................................................................................................................................

...................................................................................................................................................

...................................................................................................................................................

...................................................................................................................................................

...................................................................................................................................................

...............................................................................................................................................[3]
© UCLES 2017 9608/32/M/J/17 [Turn over
QUESTION 9. 8

4 (a) A Boolean expression corresponds to the following truth table.

INPUT OUTPUT
A B C X
0 0 0 0
0 0 1 0
0 1 0 0
0 1 1 1
1 0 0 0
1 0 1 1
1 1 0 1
1 1 1 1

(i) Write the Boolean expression for the truth table by applying the sum‑of‑products.

X = .................................................................................................................................[2]

(ii) Complete the Karnaugh Map (K‑map) for the truth table.

AB

00 01 11 10

0
C
1

[1]

(iii) The K‑map can be used to simplify the expression in part (a)(i).

Draw loop(s) around appropriate groups of 1s in the table in part (a)(ii) to produce an
optimal sum‑of‑products. [3]

(iv) Write the simplified sum‑of‑products expression for your answer to part (a)(iii).

X = .................................................................................................................................[3]

© UCLES 2018 9608/31/O/N/18


9

(b) A logic circuit with four inputs produces the following truth table.

INPUT OUTPUT
A B C D X
0 0 0 0 0
0 0 0 1 0
0 0 1 0 0
0 0 1 1 0
0 1 0 0 1
0 1 0 1 0
0 1 1 0 0
0 1 1 1 0
1 0 0 0 0
1 0 0 1 0
1 0 1 0 0
1 0 1 1 0
1 1 0 0 1
1 1 0 1 1
1 1 1 0 1
1 1 1 1 1

(i) Complete the K‑map that corresponds to the truth table.

AB

CD

[4]

(ii) Draw loop(s) around appropriate groups of 1s in the table in part (b)(i) to produce an
optimal sum‑of‑products. [2]

(iii) Write the simplified sum‑of‑products expression for your answer to part (b)(ii).

X = .................................................................................................................................[2]

© UCLES 2018 9608/31/O/N/18 [Turn over


QUESTION 10. 5

3 (a) Consider the following Boolean expression.

A.B.C+A.B.C+A.B.C

Use Boolean algebra to simplify the expression.

...................................................................................................................................................

...................................................................................................................................................

...................................................................................................................................................

...................................................................................................................................................

...................................................................................................................................................

...................................................................................................................................................

...................................................................................................................................................

...............................................................................................................................................[4]

© UCLES 2018 9608/32/O/N/18 [Turn over


6

(b) (i) Complete the truth table for the following logic circuit.

A B C

Working space
A B C 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

[2]

(ii) Complete the Karnaugh Map (K-map) for the truth table in part (b)(i).

AB

00 01 11 10

0
C
1

[1]

(iii) Draw loops around appropriate groups of 1s in the table in part (b)(ii) to produce an
optimal sum-of-products. [2]

(iv) Using your answer to part (b)(iii), write a simplified sum-of-products Boolean expression.

X = .................................................................................................................................[2]
© UCLES 2018 9608/32/O/N/18
7

(c) The truth table for a logic circuit with four inputs is shown.

INPUT OUTPUT
A B C D X
0 0 0 0 0
0 0 0 1 0
0 0 1 0 0
0 0 1 1 0
0 1 0 0 1
0 1 0 1 0
0 1 1 0 0
0 1 1 1 0
1 0 0 0 0
1 0 0 1 0
1 0 1 0 0
1 0 1 1 0
1 1 0 0 1
1 1 0 1 1
1 1 1 0 1
1 1 1 1 1

(i) Complete the K-map for the truth table in part (c).

AB

CD

[4]

(ii) Draw loops around appropriate groups of 1s in the table in part (c)(i) to produce an
optimal sum-of-products. [2]

(iii) Using your answer to part (c)(ii), write a simplified sum-of-products Boolean expression.

X = .................................................................................................................................[2]

© UCLES 2018 9608/32/O/N/18 [Turn over


QUESTION 11. 5

3 (a) A Boolean algebraic expression produces the following truth table.

INPUT OUTPUT
A B C X
0 0 0 1
0 0 1 1
0 1 0 1
0 1 1 1
1 0 0 1
1 0 1 1
1 1 0 0
1 1 1 0

(i) Complete the Karnaugh Map (K-map) for the truth table.

AB

00 01 11 10

0
C
1

[1]

The K-map can be used to simplify the expression that produced the truth table in part (a).

(ii) Draw loops around appropriate groups of 1s in the K-map to produce an optimal sum-of-
products. [2]

(iii) Write the simplified sum-of-products Boolean expression for the truth table.

X = ............................................................................................................................... [2]

© UCLES 2019 9608/32/M/J/19 [Turn over


6

(b) A logic circuit with four inputs produces the following truth table.

INPUT OUTPUT
A B C D X
0 0 0 0 0
0 0 0 1 0
0 0 1 0 1
0 0 1 1 1
0 1 0 0 0
0 1 0 1 0
0 1 1 0 1
0 1 1 1 1
1 0 0 0 1
1 0 0 1 1
1 0 1 0 0
1 0 1 1 0
1 1 0 0 1
1 1 0 1 1
1 1 1 0 0
1 1 1 1 0

(i) Complete the K-map for the truth table.

AB

CD

[4]

(ii) Draw loops around appropriate groups of 1s in the K-map to produce an optimal
sum-of-products. [2]

(iii) Write the simplified sum-of-products Boolean algebraic expression for the truth table.

X = ............................................................................................................................... [2]

© UCLES 2019 9608/32/M/J/19


QUESTION 12. 7

4 A Boolean expression produces the following truth table.

INPUT OUTPUT
A B C X
0 0 0 1
0 0 1 1
0 1 0 0
0 1 1 1
1 0 0 0
1 0 1 1
1 1 0 0
1 1 1 1

(a) Write the Boolean expression for the truth table as a sum-of-products.

X = ...................................................................................................................................... [2]

(b) Complete the Karnaugh Map (K-map) for the truth table above.

AB

00 01 11 10

0
C
1

[1]

The K-map can be used to simplify the expression in part (a).

(c) Draw loops around appropriate groups in the K-map in part (b) to produce an optimal sum-of-
products. [2]

(d) Write, using your answer to part (c), a simplified sum-of-products expression for the truth
table.

X = ...................................................................................................................................... [2]

© UCLES 2019 9608/31/O/N/19 [Turn over


QUESTION 13. 3

2 (a) A Boolean expression produces the following truth table.

INPUT OUTPUT
A B C X
0 0 0 1
0 0 1 1
0 1 0 1
0 1 1 1
1 0 0 1
1 0 1 1
1 1 0 0
1 1 1 0

(i) Write the Boolean expression for the truth table by applying the sum-of-products.

X = .....................................................................................................................................

..................................................................................................................................... [3]

(ii) Complete the Karnaugh Map (K-map) for the truth table in part (a).

AB

00 01 11 10

0
C
1

[1]

The K-map can be used to simplify the function in part (a)(i).

(iii) Draw loop(s) around appropriate groups in the table in part (a)(ii), to produce an optimal
sum-of-products. [2]

(iv) Write, using your answer to part (a)(iii), a simplified Boolean expression for your
Karnaugh map.

X = ............................................................................................................................... [2]

© UCLES 2019 9608/32/O/N/19 [Turn over


4

(b) Simplify the following expression using De Morgan’s laws. Show your working.

(W + X) • (Y + Z)

...................................................................................................................................................

...................................................................................................................................................

...................................................................................................................................................

...................................................................................................................................................

...................................................................................................................................................

............................................................................................................................................. [3]

© UCLES 2019 9608/32/O/N/19

You might also like