1 The law which represents the Boolean equation [1]

p+pq=p is:
(a) Associative Law

(b) Distributive Law

(c) Commutative Law

(d) Absorption Law

3 If A=1, B=0, C=0 and D=1, then the minterm will be: [1]

(a) AB’C’D

(b) A’BCD’

(c) A+B’+C’+D

(d) A’+B+C+D’
4 The compliment of the Boolean expression F(a,b,c) =(b`+c)+a is: [1]

(a) b`c`a

(b) bc`a`

(c) b`+c`a

(d) b+c`a`

5 The propositional operator ~ represents: [1]

(a) Conjunction

(b) Implication

(c) Disjunction

(d) Negation

6 Encoders are used for: [1]

(a) Adding two bits

(b) Converting Decimal to Binary

(c) Converting Binary to Decimal

(d) Data transmission

7 NOR gate is formed by the combinations of: [1]

(a) AND gate and OR gate

(b) OR gate and NOT gate

(c) NAND gate and NOT gate

(d) AND gate and NOT gate

8 The combinational circuit which adds two binary bits is: [1]

(a) Full Adder

(b) Decoder

(c) Half Adder

(d) Multiplexer
9 The Quad group in a Karnaugh’s map eliminates:
[1]

a. One variable

1
b. Four variables
4
T
c. Three Variables h
e
d. Two variables re
d
10 The proposition (a <=> b ) is represented by: u
[1] ce
d
ex
a. a'b’ + ab
pr
es
(b) (a'+b’) · (a+b)
si
o
(c) (a+b)’ n
fo
(d) (a·b)’ r
th
11 If the input in a decoder is ABC’D, then the decimal equivalent output will be: e
[1] B
o
a. 10 ol
e
a
b. 11
n
ex
c. 12 pr
es
d. 13 si
o
n
With reference to the given proposition ~P => Q , answer the following questions: F(
X,
12 the converse of the proposition is: Y,
[1] Z)
=
a. ~Q => P ∑(
0,
b. Q => ~P 1,
2,
c. ~Q => ~P 3,
4,
d. ~P => ~Q 5,
6,
13 the contra-positive of the proposition is: [1]
7)
is:
a. ~P => Q
[1
b. Q => P ]

c. ~Q => P a. X
Y
d. ~ P => ~Q ’
 + X’Y

b. 1

c. 0

d. None of the above

18 The basic logic gate that represents the simplification of the Boolean expression
A.(A’+B). (A+B) is: [1]

a. OR gate

b. NOT gate

c. AND gate

d. None of the above

19 The proposition ~( a ∧ b ) V (~a => b) is a: [1]

a. Contradiction

b. Contingency

c. Tautology

d. Implication

Reduce the given Boolean function F(A,B,C,D) = ∑(0,2,4,8,9,10,12,13) by using 4-variable Karnaugh
map and answer the following questions:
21 What will be the least number of groups and their types formed for reduction? [1]

(a) 6 pairs

(b) 2 quad and 2 pairs

(c) 1 quad and 3 pairs

(d) 3 quads

22 The reduced expression of the Boolean function given above is: [1]

(a) ACD’ + B’D’ + BD

(b) (A+C’+D’).(B’+D’).(A+C’)

(c) C’D’ + AC’ + B’D’

(d) (C+D’). (B’+D’).(A+B+D)

A school intends to select candidates for an Inter school competition as per the criteria given below:
 The student has participated in an earlier competition and is very creative
Or
 The student is very creative and has excellent general awareness, but has not participated in
any competition earlier
Or
 The student has excellent general awareness and has won prize in an inter -house
competition
The inputs are:

Inputs
A Participated in a competition earlier B Is
very creative
C Won prize in an inter house competition D
Has excellent general awareness
( In all the above cases 1 indicates yes and 0 indicates no).
Output: X [ 1 indicates yes and 0 indicates no for all cases].
Draw the truth table for the inputs and outputs given above and answer the following questions:
23 The POS expression for X(A,B,C,D) will be: [1]

(a) F(A,B,C,D) = ∑ (3, 5, 7, 11, 12, 13, 14, 15)

(b) F(A,B,C,D) = π (3, 5, 7, 11, 12, 13, 14, 15)

(c) F(A,B,C,D) = π (0, 1, 2, 4, 6, 8, 9, 10)

(d) F(A,B,C,D) = ∑ (0, 1, 2, 4, 6, 8, 9, 10)

24 The maximum input combinations for the above truth table will be: [1]

(a) 24

(b) 16

(c) 8

(d) 4

25 How many input lines will be needed for three input truth table?
a. 4
b. 8
c. 10
d. 16

Reduce the given Boolean function F(A,B,C,D) = π(3,4,5, 6, 7, 11,13,15) by using 4-variable Karnaugh
map and answer the following questions:
26 What will be the least number of groups and their types formed for reduction? [1]

(a) 6 pairs

(b) 3 quads

(c) 1 quad and 3 pairs

(d) 2 quad and 3 pairs

27 The reduced expression of the Boolean function given above is: [1]

(a) (B+C).(B+D).(A’+D)

(b) BC + BD + A’D

(c) AB’ + C’D’ + B’D’

(d) (A+B’).(C’+D’).(B’+D’)
From the logic diagram given above, where A,B and C are inputs and F is the output, answer the
following questions:

28 The expression at (1) is: [1]

(a) A.B

(b) A’+B’

(c) A+B’

(d) A+B

29 The expression at (2) is: [1]

(a) A+B.C’

(b) (A+B)’.C

(c) ((A+B).C)’

(d) (A+B).C

30 The expression at (3) is: [1]

(a) A+B.C’

(b) ((A+B)’.C)’

(c) ((A+B).C)’

(d) (A+B).C
 31 The final expression F(A,B,C) is: [1]

a. F=((A+B)’.C)’ + (A+B)

b. F= (A+B)’.(C+A+B)

c. F=( (A+B).C)’ + (A+B)

d. F= (AB + C)’ +(A+B)

*****************************************************************************************************
*******************************************************************