(P3)Topical Past papers of (3.3.1-Logic Gates 3.3.

2 – Boolean Topical Past Paers 9608

Algebra, 3.3.3 Karnugh Maps, 3.3.4 Video, 3.3.4 Flip Flops) with Sir Majid Tahir

Past Papers May/June 2015 to 2018:

Logic Circuits,
Boolean Algebra
Flip Flops
Kanugh Maps

(9608/32/M/J/16)
Q1/- (a) Complete the truth table for this NAND gate:

www.majidtahir.com Contact: 03004003666 Email: [email protected]

1
(P3)Topical Past papers of (3.3.1-Logic Gates 3.3.2 – Boolean Topical Past Paers 9608
Algebra, 3.3.3 Karnugh Maps, 3.3.4 Video, 3.3.4 Flip Flops) with Sir Majid Tahir

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

www.majidtahir.com Contact: 03004003666 Email: [email protected]

2
(P3)Topical Past papers of (3.3.1-Logic Gates 3.3.2 – Boolean Topical Past Paers 9608
Algebra, 3.3.3 Karnugh Maps, 3.3.4 Video, 3.3.4 Flip Flops) with Sir Majid Tahir

Q.2 (9608/32/M/J/15)

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

www.majidtahir.com Contact: 03004003666 Email: [email protected]

3
(P3)Topical Past papers of (3.3.1-Logic Gates 3.3.2 – Boolean Topical Past Paers 9608
Algebra, 3.3.3 Karnugh Maps, 3.3.4 Video, 3.3.4 Flip Flops) with Sir Majid Tahir

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

(c) Write the Boolean algebraic expression corresponding to the following logic circuit:

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

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

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

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

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

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

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

www.majidtahir.com Contact: 03004003666 Email: [email protected]

4
(P3)Topical Past papers of (3.3.1-Logic Gates 3.3.2 – Boolean Topical Past Paers 9608
Algebra, 3.3.3 Karnugh Maps, 3.3.4 Video, 3.3.4 Flip Flops) with Sir Majid Tahir

(9608/31/M/J/17)
3. Consider the following logic circuit, which contains a redundant logic gate.

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

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

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

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

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

www.majidtahir.com Contact: 03004003666 Email: [email protected]

5
(P3)Topical Past papers of (3.3.1-Logic Gates 3.3.2 – Boolean Topical Past Paers 9608
Algebra, 3.3.3 Karnugh Maps, 3.3.4 Video, 3.3.4 Flip Flops) with Sir Majid Tahir

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

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

(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/18)
4 (a) A Boolean expression produces the following truth table.

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

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

www.majidtahir.com Contact: 03004003666 Email: [email protected]

6
(P3)Topical Past papers of (3.3.1-Logic Gates 3.3.2 – Boolean Topical Past Paers 9608
Algebra, 3.3.3 Karnugh Maps, 3.3.4 Video, 3.3.4 Flip Flops) with Sir Majid Tahir

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

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

(iii) Draw loop(s) around appropriate group(s) of 1s to produce an optimal sum-of-

products for the table in part (a)(ii). [2]

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

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

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

www.majidtahir.com Contact: 03004003666 Email: [email protected]

7
(P3)Topical Past papers of (3.3.1-Logic Gates 3.3.2 – Boolean Topical Past Paers 9608
Algebra, 3.3.3 Karnugh Maps, 3.3.4 Video, 3.3.4 Flip Flops) with Sir Majid Tahir

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

(ii) Draw loop(s) around appropriate group(s) of 1s to produce an optimal sum-of-

products for the table in part (b)(i). [2]

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

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

www.majidtahir.com Contact: 03004003666 Email: [email protected]

8
(P3)Topical Past papers of (3.3.1-Logic Gates 3.3.2 – Boolean Topical Past Paers 9608
Algebra, 3.3.3 Karnugh Maps, 3.3.4 Video, 3.3.4 Flip Flops) with Sir Majid Tahir

Answers:

1.

(d) Memory // data storage 1

Stores a single bit 1

www.majidtahir.com Contact: 03004003666 Email: [email protected]

9
(P3)Topical Past papers of (3.3.1-Logic Gates 3.3.2 – Boolean Topical Past Paers 9608
Algebra, 3.3.3 Karnugh Maps, 3.3.4 Video, 3.3.4 Flip Flops) with Sir Majid Tahir

2.

www.majidtahir.com Contact: 03004003666 Email: [email protected]

10
(P3)Topical Past papers of (3.3.1-Logic Gates 3.3.2 – Boolean Topical Past Paers 9608
Algebra, 3.3.3 Karnugh Maps, 3.3.4 Video, 3.3.4 Flip Flops) with Sir Majid Tahir

www.majidtahir.com Contact: 03004003666 Email: [email protected]

11
(P3)Topical Past papers of (3.3.1-Logic Gates 3.3.2 – Boolean Topical Past Paers 9608
Algebra, 3.3.3 Karnugh Maps, 3.3.4 Video, 3.3.4 Flip Flops) with Sir Majid Tahir

www.majidtahir.com Contact: 03004003666 Email: [email protected]

12
(P3)Topical Past papers of (3.3.1-Logic Gates 3.3.2 – Boolean Topical Past Paers 9608
Algebra, 3.3.3 Karnugh Maps, 3.3.4 Video, 3.3.4 Flip Flops) with Sir Majid Tahir

www.majidtahir.com Contact: 03004003666 Email: [email protected]

13