0% found this document useful (0 votes)

60 views47 pages

Logic Circuit Truth Tables and Boolean Algebra

The document describes a series of logic circuit problems involving truth tables and Boolean algebra expressions. It asks the student to: 1) Complete truth tables for two logic circuits 2) Write Boolean expressions for the output of each circuit 3) Identify which De Morgan's law is shown by the answers 4) Write the Boolean expression for a third circuit and simplify it using De Morgan's laws and Boolean algebra.

Uploaded by

qtkdn5dfry

We take content rights seriously. If you suspect this is your content, claim it here.

Available Formats

Download as DOCX, PDF, TXT or read online on Scribd

0% found this document useful (0 votes)

60 views47 pages

Logic Circuit Truth Tables and Boolean Algebra

Uploaded by

qtkdn5dfry

We take content rights seriously. If you suspect this is your content, claim it here.

Available Formats

Download as DOCX, PDF, TXT or read online on Scribd

You are on page 1/ 47

8

4 (a) (i) Complete the truth table for this logic circuit:

Working space
A B X
0 0
0 1
1 0
1 1
[1]

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

Working space
A B X
0 0
0 1
1 0
1 1
[1]

© UCLES 2015 9608/31/M/J/15

(b) A student decides to write an equation for X to represent the full behaviour of each logic
circuit.

(i) Write the Boolean expression that will complete the required equation for X for each
circuit:

Circuit 1: X = ......................................................................................................................

Circuit 2: X =...................................................................................................................[2]

(ii) Write the De Morgan’s Law which is shown by your answers to part (a) and part (b)(i).

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

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

(d) Using De Morgan’s laws and Boolean algebra, simplify your answer to part (c).

Show all your working.

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

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

9608/31/M/J/15© UCLES 2015 [Turn over

8
4 (a) (i) Complete the truth table for this logic circuit.
(d) Explain why the algorithms given in part (c) may not be the best choice for efficient memory
management. Input Output
X
A X Y A B
Longest
Y resident .......................................................................................................................
0 0
0 1
...................................................................................................................................................
1 0
1 1
...................................................................................................................................................
B

...................................................................................................................................................
[2]
Least used ................................................................................................................................
(ii) State the name given to this logic circuit.
...................................................................................................................................................
...................................................................................................................................... [1]
...................................................................................................................................................

(iii) Name the labels usually given to A and B.

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

Label A ..............................................................................................................................

Label B ..............................................................................................................................

Explain why your answers are more appropriate for the A and B labels.

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

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

9608/31/O/N/16© UCLES 2016

(b) (i) Write the Boolean expression corresponding to the following logic circuit:

B
X

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

(ii) Use Boolean algebra to simplify the expression that you gave in part (b)(i).

Show your working.

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

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

9608/31/O/N/16© UCLES 2016 [Turn over

5 (a) (i) A half adder is a logic circuit with the following truth table.

Input Output
X Y A B
0 0 0 0
0 1 0 1
1 0 0 1
1 1 1 0

The following logic circuit is constructed.

P X A
J
HALF ADDER
Q Y B

X A
HALF ADDER
R Y B K

Complete the following truth table for this logic circuit.

Input Working space Output

P Q R J K
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) State the name given to this logic circuit.

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

9608/32/O/N/16© UCLES 2016

(iii) Name the labels usually given to J and K.

Label J ..............................................................................................................................

Label K ..............................................................................................................................

Explain why your answers are appropriate labels for these outputs.

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

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

(b) (i) Write down the Boolean expression corresponding to the following logic circuit:

A
B
X

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

(ii) Use Boolean algebra to simplify the expression given in part (b)(i).

Show your working.

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

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

9608/32/O/N/16© UCLES 2016 [Turn over

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]

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]

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

(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]

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

(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
R

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

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

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

(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]

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]
9608/32/M/J/17© UCLES 2017 [Turn over
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]

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

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

ABC

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).

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]

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

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).

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

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

3 (a) The following logic circuit can be simplified to use only one gate.

Give the name of this single gate.

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

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

Working space
A B X Y

0 0

0 1

1 0

1 1

[2]

(ii) Give the name of the logic circuit that has this truth table.

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

(iii) Give the uses for outputs X and Y.

X ........................................................................................................................................

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

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

(c) Consider the following Boolean algebraic expression:

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

Use Boolean algebra to simplify the expression. Show your working.

Working ..................................................................................................................................

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

Simplified expression.............................................................................................................[5]

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

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.

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]

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

(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.

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

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

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).

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]

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

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

(W + X) • (Y + Z)

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

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

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

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).

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]

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

(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.

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

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

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).

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]

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

(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.

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

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

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]

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]

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

(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]

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

6
3 A logic circuit is shown:
(c) Digital certificates are used in internet communications. A Certificate Authority (CA) is
responsible for issuing a digital certificate.
P
The digital certificate contains a digital signature produced by the CA.

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

Q
1 ........................................................................................................................................
R
2 ........................................................................................................................................

3 ........................................................................................................................................
(a) Write the Boolean algebraic expression corresponding to this logic circuit: [3]

S =..........................................................................................................................................[4]
(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]

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

(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]

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]
9608/31/M/J/17© UCLES 2017
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.

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]

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

(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.

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

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

3 (a) Consider the following Boolean expression.

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

Use Boolean algebra to simplify the expression.

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

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

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

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

ABC

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).

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]

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

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).

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

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

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.

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]

(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.

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

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.

00 01 11 10

0
C
1

[1]

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

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

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

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).

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]

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

(W + X) • (Y + Z)

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

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

5 (a) Complete the truth table for this NAND gate:

A B X

A 0 0

X 0 1
B 1 0
1 1

[1]

A SR flip-flop is constructed using two NAND gates.

S
Q

Q
R

(b) (i) Complete the truth table for the SR flip-flop.

S R Q –
Q
Initially 1 0 0 1
R changed to 1 1 1
S changed to 0 0 1
S changed to 1 1 1
S and R changed to 0 0 0
[4]

(ii) One of the combinations in the truth table should not be allowed to occur.

State the values of S and R that should not be allowed. Justify your

choice. S = .............................. R = ..............................

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

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

Another type of flip-flop is the JK flip-flop.

(c) (i) Give one extra input present in the JK flip-flop.

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

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

(ii) Give one advantage of the JK flip-flop.

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

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

(d) Describe the role of flip-flops in a computer.

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

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

5 (a) (i) Complete the truth table for this 2-input NAND gate:

A B X
A 0 0
X 0 1
1 0
B 1 1

[1]

(ii) Complete the truth table for this 3-input NAND gate:

A B C X
0 0 0
0 0 1
A 0 1 0
B X 0 1 1
1 0 0
C 1 0 1
1 1 0
1 1 1
[1]

(b) A SR flip-flop is constructed using two NAND gates.

S
Q

Q
R

(i) Complete the truth table for the SR flip-flop:

S R Q Q
Initially 1 0 0 1
R changed to 1 1 1
S changed to 0 0 1
S changed to 1 1 1
S and R changed to 0 0 0 1 1
[3]

(ii) The final row in the table in part b(i) shows that the output for both Q and Q is 1.

Explain why this is a problem.

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

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

(c) Another type of flip-flop is the JK flip-flop.

A JK flip-flop is constructed as follows:

J
Q

Clock

Q
K

(i) Complete this truth table for the JK flip-flop.

Initial Final
Working space values values
J K Clock Q Q Q Q
0 0 1 1 0 1 0
0 0 1 0 1 0 1
0 1 1 1 0 0 1
0 1 1 0 1 0 1
1 0 1 1 0
1 0 1 0 1
1 1 1 1 0
1 1 1 0 1
[4]

(ii) Explain why the JK flip-flop is an improvement on the SR flip-flop.

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

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

(d) Explain the role of flip-flops in a computer.

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

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

6 The environment in a very large greenhouse is managed by a computer system. The system uses
a number of different sensors that include temperature sensors. In addition, the system controls a
number of heaters, windows and sprinklers.

(a) State one other type of sensor that could be used with this system.

Justify your choice.

Sensor ......................................................................................................................................

Justification ...............................................................................................................................

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

(b) Describe why feedback is important in this system.

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

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

State one of the parameters used in controlling the temperature in the greenhouse.

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

(ii) Explain how the parameter identified in part (c)(i) is used in the feedback process.

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

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

Another type of flip-flop is the JK flip-flop. The JK flip-flop is an improvement on the SR flip-flop.

State the third input.

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

(ii) There are two problems with the SR flip-flop that the JK flip-flop overcomes.

State each problem and state why it does not occur for the JK flip-flop.

Problem 1 ..........................................................................................................................

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

Problem 2 ..........................................................................................................................

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

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

5 (a) (i) Complete the truth table for this 2-input NAND gate:

A B X
A 0 0
X 0 1
1 0
B 1 1

[1]

(ii) Complete the truth table for this 3-input NAND gate:

A B C X
0 0 0
0 0 1
A 0 1 0
B X 0 1 1
1 0 0
C 1 0 1
1 1 0
1 1 1
[1]

(b) A SR flip-flop is constructed using two NAND gates.

S
Q

Q
R

(i) Complete the truth table for the SR flip-flop:

S R Q Q
Initially 1 0 0 1
R changed to 1 1 1
S changed to 0 0 1
S changed to 1 1 1
S and R changed to 0 0 0 1 1
[3]

(ii) The final row in the table in part b(i) shows that the output for both Q and Q is 1.

Explain why this is a problem.

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

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

(c) Another type of flip-flop is the JK flip-flop.

A JK flip-flop is constructed as follows:

J
Q

Clock

Q
K

(i) Complete this truth table for the JK flip-flop.

Initial Final
Working space values values
J K Clock Q Q Q Q
0 0 1 1 0 1 0
0 0 1 0 1 0 1
0 1 1 1 0 0 1
0 1 1 0 1 0 1
1 0 1 1 0
1 0 1 0 1
1 1 1 1 0
1 1 1 0 1
[4]

(ii) Explain why the JK flip-flop is an improvement on the SR flip-flop.

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

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

(d) Explain the role of flip-flops in a computer.

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

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

Complete The Truth Table For This Logic Circuit:: 9608/31/M/J/15 © UCLES 2015
No ratings yet
Complete The Truth Table For This Logic Circuit:: 9608/31/M/J/15 © UCLES 2015
19 pages
Complete The Truth Table For This Logic Circuit:: 9608/31/M/J/15 © UCLES 2015
No ratings yet
Complete The Truth Table For This Logic Circuit:: 9608/31/M/J/15 © UCLES 2015
19 pages
1 3 1-Logic-Gates
No ratings yet
1 3 1-Logic-Gates
18 pages
Logic Circuit Analysis and Truth Tables
No ratings yet
Logic Circuit Analysis and Truth Tables
21 pages
Logic Circuit Design and Truth Tables
No ratings yet
Logic Circuit Design and Truth Tables
19 pages
1 3 1-Logic-Gates - Removed
No ratings yet
1 3 1-Logic-Gates - Removed
22 pages
ISCGRADE12 QP UNITTEST1 27thaug2024
No ratings yet
ISCGRADE12 QP UNITTEST1 27thaug2024
2 pages
8 6 (A) Complete The Truth Table For The Given Logic Circuit. Do Not Attempt To Simplify The Logic Circuit. A
No ratings yet
8 6 (A) Complete The Truth Table For The Given Logic Circuit. Do Not Attempt To Simplify The Logic Circuit. A
22 pages
Logic Gate
No ratings yet
Logic Gate
29 pages
1.3.1 Logic Gates
No ratings yet
1.3.1 Logic Gates
39 pages
Programming Last 4 Exams Classified
No ratings yet
Programming Last 4 Exams Classified
104 pages
Chap 10 Question Paper
No ratings yet
Chap 10 Question Paper
10 pages
Chapter 10
No ratings yet
Chapter 10
25 pages
Homework1 DLD - Term 2 23-24
No ratings yet
Homework1 DLD - Term 2 23-24
8 pages
Notes For Chapter 10
No ratings yet
Notes For Chapter 10
5 pages
Cs CH 10
No ratings yet
Cs CH 10
5 pages
3 Hours / 70 Marks: Seat No
No ratings yet
3 Hours / 70 Marks: Seat No
29 pages
1.4.3 Q's Boolean Algebra
No ratings yet
1.4.3 Q's Boolean Algebra
13 pages
Sir Syed University of Engineering & Technlogy, Karachi LDST Final 2012
0% (1)
Sir Syed University of Engineering & Technlogy, Karachi LDST Final 2012
2 pages
Boolean Logic Gates
No ratings yet
Boolean Logic Gates
9 pages
Boolean Laws in Sinhala for ICT O/L
No ratings yet
Boolean Laws in Sinhala for ICT O/L
12 pages
Xi CS CH 2 WS 4 25 26
No ratings yet
Xi CS CH 2 WS 4 25 26
1 page
Boolean Algebra Simplification Guide
No ratings yet
Boolean Algebra Simplification Guide
60 pages
Introduction To Gates Assignment
0% (2)
Introduction To Gates Assignment
6 pages
wkt1
No ratings yet
wkt1
2 pages
Boolean Algebra Theorems and Applications
No ratings yet
Boolean Algebra Theorems and Applications
8 pages
D.A.V Public School, Pratap Vihar, Ghaziabad Holiday Home, Session 2021-22 Class XI, Subject: Computer Science
No ratings yet
D.A.V Public School, Pratap Vihar, Ghaziabad Holiday Home, Session 2021-22 Class XI, Subject: Computer Science
5 pages
Assignment 1 To 7
No ratings yet
Assignment 1 To 7
23 pages
EEN1036 Digital Logic Design: Chapter 3 Part II Combinational Logic Circuit
No ratings yet
EEN1036 Digital Logic Design: Chapter 3 Part II Combinational Logic Circuit
42 pages
Quizzes Without Answers
No ratings yet
Quizzes Without Answers
7 pages
ICS 2205 Digital Logic - Printready
No ratings yet
ICS 2205 Digital Logic - Printready
3 pages
15.2 Boolean Algebra and Logic Circuits
No ratings yet
15.2 Boolean Algebra and Logic Circuits
46 pages
First Exam Logic Design 2018-1
No ratings yet
First Exam Logic Design 2018-1
4 pages
Digital Logic Circuit Basics
No ratings yet
Digital Logic Circuit Basics
23 pages
A2 Logic Gates Exercise
No ratings yet
A2 Logic Gates Exercise
1 page
Unit-3 QB
No ratings yet
Unit-3 QB
3 pages
Quiz 10
No ratings yet
Quiz 10
10 pages
DPSD Imp
No ratings yet
DPSD Imp
8 pages
Unit-3 QB
No ratings yet
Unit-3 QB
4 pages
DLD HW
No ratings yet
DLD HW
17 pages
Digital Principles & System Design Question Bank
No ratings yet
Digital Principles & System Design Question Bank
8 pages
CSC203 - Digital Logic Design - Past Questions
No ratings yet
CSC203 - Digital Logic Design - Past Questions
9 pages
Correct
No ratings yet
Correct
8 pages
BDE Unit 2 Numericals From GTU EXAM
No ratings yet
BDE Unit 2 Numericals From GTU EXAM
2 pages
Boolean Logic and Worksheet of Number System
No ratings yet
Boolean Logic and Worksheet of Number System
11 pages
Lecture 2 - Describing Logic Circuits
No ratings yet
Lecture 2 - Describing Logic Circuits
25 pages
BOOLEAN PROPOSITIONAL Worksheet
No ratings yet
BOOLEAN PROPOSITIONAL Worksheet
6 pages
Wa0085
No ratings yet
Wa0085
11 pages
Lab03-Computer Aided Digital Circuit Analysis
No ratings yet
Lab03-Computer Aided Digital Circuit Analysis
5 pages
2
No ratings yet
2
2 pages
Cheeze Machine
No ratings yet
Cheeze Machine
3 pages
DS Syllabus Introduction (Reference)
No ratings yet
DS Syllabus Introduction (Reference)
44 pages
XII IP Practical File
0% (1)
XII IP Practical File
52 pages
No More Than Two Words And/Or A Number: SECTION 1 Questions 1-10
No ratings yet
No More Than Two Words And/Or A Number: SECTION 1 Questions 1-10
6 pages
高考英语作文范文50篇 2
No ratings yet
高考英语作文范文50篇 2
17 pages
SQL Practical Exam for MBIS4002
No ratings yet
SQL Practical Exam for MBIS4002
5 pages
Document 1560390.1 - Database Error After Upgarade
No ratings yet
Document 1560390.1 - Database Error After Upgarade
2 pages
SpringBoot Bean Nots For Interview
No ratings yet
SpringBoot Bean Nots For Interview
2 pages
Edu en Sdwandm4 Lec Se
0% (1)
Edu en Sdwandm4 Lec Se
253 pages
Reverse Engineering in Mechanical Systems
No ratings yet
Reverse Engineering in Mechanical Systems
2 pages
Dsad Labsheet4
No ratings yet
Dsad Labsheet4
5 pages
Anviz T5 RFID Manual
No ratings yet
Anviz T5 RFID Manual
52 pages
Cybersecurity Course for Beginners
No ratings yet
Cybersecurity Course for Beginners
5 pages
THYA's Shield HUD Script
No ratings yet
THYA's Shield HUD Script
37 pages
User Manual
No ratings yet
User Manual
2 pages
Intro To Computers Assignment 1
No ratings yet
Intro To Computers Assignment 1
6 pages
8085 Practicals Journal
No ratings yet
8085 Practicals Journal
50 pages
Unit2 Hashing DSA
No ratings yet
Unit2 Hashing DSA
55 pages
B1 B2 Appointment Confirmation Customer Self-Service
No ratings yet
B1 B2 Appointment Confirmation Customer Self-Service
11 pages
SAP Logistics & Barcode Solutions
No ratings yet
SAP Logistics & Barcode Solutions
2 pages
ITB - Unit - 3
No ratings yet
ITB - Unit - 3
20 pages
Kleen Theorem PDF
No ratings yet
Kleen Theorem PDF
59 pages
Easy Khata Payment Reminders
No ratings yet
Easy Khata Payment Reminders
3 pages
Aircraft Maintenance Training Methods
No ratings yet
Aircraft Maintenance Training Methods
4 pages
Installation Monitoring Tools Cacti - CentOS 7
No ratings yet
Installation Monitoring Tools Cacti - CentOS 7
3 pages
Fault Codes: Adm2 Fault Codes (J1939) Spn/Fmi Adm2 Fault Codes (K-Line) Description Remedial Action Pin
No ratings yet
Fault Codes: Adm2 Fault Codes (J1939) Spn/Fmi Adm2 Fault Codes (K-Line) Description Remedial Action Pin
5 pages
Ahata Kristi - Miviwyebuli Mkvleloba PDF
No ratings yet
Ahata Kristi - Miviwyebuli Mkvleloba PDF
228 pages
3 Hours / 70 Marks: Seat No
No ratings yet
3 Hours / 70 Marks: Seat No
3 pages
JP - Midterm Exam
No ratings yet
JP - Midterm Exam
12 pages
Solar Charge Controller Specification 2020
No ratings yet
Solar Charge Controller Specification 2020
13 pages