1.

The simplified form of the Boolean expression (X + Y + XY) (X + Z) is

(A) X + Y + ZX + Y (B) XY YZ (C) X + YZ (D) XZ + Y

2. Identify the logic function performed by the circuit shown


(A) exclusive OR (B) exclusive NOR (C) NAND (D) NOR

3. The answer of the operation (10111)
2
* (1110)
2
in hex equivalence is
(A) 150 (B) 241 (C) 142 (D) 101011110

4. How many 1s are present in the binary representation of 3 *512 + 7 *64 + 5 *8 +
3.
(A) 8 (B) 9 (C) 10 (D) 11

5. The decimal number equivalent of (4057.06)
8
is

(A) 2095.75 (B) 2095.075 (C) 2095.937 (D) 2095.0937

6.

B

7. 12-bit 2s complement of 73.75 is

(A) 01001001.1100 (B) 11001001.1100
(C) 10110110.0100 (D) 10110110.1100

8. Encoding of data bits 0011 into 7-bit even Parity Hamming Code is

(A) 0011110 (B) 0101110
(C) 0010110 (D) 0011100

9. If an integer needs two bytes of storage, then the maximum value of unsigned
integer is
(A) 2^16 1 (B) 2^15 1
(C) 2^16 (D) 2^15

10. Negative numbers cannot be represented in

(A) signed magnitude form (B) 1s complement form
(C) 2s complement form (D) none of the above

11. The dual of a Boolean expression is obtained by interchanging

(A) Boolean sums and Boolean products
(B) Boolean sums and Boolean products or interchanging 0s and 1s
(C) Boolean sums and Boolean products and interchanging 0s & 1s
(D) Interchanging 0s and 1s

12. Given that (292)
10
= (1204)x in some number system x. The base x of that
number system is
(A) 2 (B) 8
(C) 10 (D) None of the above

13.



14.

A
15.

16.

17. What is decimal equivalent of BCD 11011.1100 ?

(A) 22.0 (B) 22.2 (C) 20.2 (D) 21.2

18.

19.


20. The number of 1s present in the binary representation of 10 256 + 5 16 + 5
is
(A) 5 (B) 6 (C) 7 (D) 8

21. The hexadecimal number equivalent to (1762.46)8 is

(A) 3F2.89 (B) 3F2.98 (C) 2F3.89 (D) 2F3.98

22.

B

23. A latch is constructed using two cross-coupled

(A) AND and OR gates (B) AND gates
(C) NAND and NOR gates (D) NAND gates

24. The absorption law in Boolean algebra say that

(A) X + X = X (B) X . X = X
(C) x + x . y = x (D) None of the above

25. A multiplexer is a logic circuit that

(A) accepts one input and gives several output
(B) accepts many inputs and gives many output
(C) accepts many inputs and gives one output
(D) accepts one input and gives one output

26. 8-bit 1s complement form of 77.25 is

(A) 01001101.0100 (B) 01001101.0010
(C) 10110010.1011 (D) 10110010.1101


27. A Boolean operator s is defined as follows : 1 s 1 = 1, 1 s 0 = 0, 0 s 1 = 0 and 0 s
0 = 1 What will be the truth value of the expression (x s y) s z = x s (y s z) ?
(A) Always false (B) Always true
(C) Sometimes true (D) True when x, y, z are all true

28. Which one of the following is decimal value of a signed binary number 1101010,
if it is in 2s complement form ?
(A) 42 (B) 22 (C) 21 (D) 106

29. The number of eight-bit strings beginning with either 111 or 101 is ______.
(A) 64 (B) 128 (C) 265 (D) None of the above

30. Match the following identities/laws to their corresponding name :
(a) x + x = x i. Dominance
x x = x
(b) x + 0 = x
x 1 = x ii. Absorption
(c) x + 1 = 1
x 0 = 0 iii. Idempotent
(d) x (x + y) = x iv. Identity
Codes : (a) (b) (c) (d)
(A) iii iv i ii
(B) iv iii i ii
(C) iv iii ii i
(D) iii iv ii i

31. Which one of the following set of gates is best suited for parity checking and
parity generation ?
(A) AND, OR, NOT (B) NAND, NOR
(C) EX-OR, EX-NOR (D) None of the above










32.


33.



34. The simplified function in product of sums of Boolean function F(W, X, Y, Z) =
(0, 1, 2, 5, 8, 9, 10) is
(A) (W' + X') (Y' + Z') (X' + Z) (B) (W' + X') (Y' + Z') (X' + Z')
(C) (W' + X') (Y' + Z) (X' + Z) (D) (W' + X') (Y + Z') (X' + Z)

35.


36. Logic X-OR operation of (4ACO)H & (B53F)H results
(A) AACB (B) 0000 (C) ABCD (D) FFFF

37. The simplification of the Boolean expression (A'BC')'+ (AB'C)' is
(A) 0 (B) 1 (C) A (D) BC

38. The code where all successive numbers differ from their preceding number by
single bit is
(A)Binary code (B) BCD (C)Excess 3 (D)Gray.

39. How many AND gates are required to realize Y = CD+EF+G
(A)4 (B) 5 (C) 3 (D)2

40. The number of full and half-adders required to add 16-bit numbers is
(A)8 half-adders,8 full-adders
(B)1 half-adder,15 full adders
(C)16 halfadders,0 full adders
(D)4 halfadders,12 full-adders
41. A full-adder has a Cin = 0. What are the sum and the carry (Cout) when A = 1
and B = 1?
(A) = 0, Cout = 0 (B) = 0, Cout = 1
(C) = 1, Cout = 0 (D) = 1, Cout = 1

42. The full adder adds the Kth bits of two numbers to the difference of
(A)the previous bits
(B)sum of all previous bits
(C)carry from (K - 1 )TH bit
(D)sum of previous bit

43. A combinatorial logic circuit has memory characteristics that "remember" the
inputs after they have been removed.
(A)TRUE (B)FALSE
(C)None of the above (D)Can not predict

44. The binary numbers A = 1100 and B = 1001 are applied to the inputs of a
comparator. What are the output levels?
(A)A > B = 1, A < B= 0, A < B = 1
(B)A > B = 0, A < B = 1, A = B =0
(C)A > B = 1, A < B = 0, A = B =0
(D)A > B = 0, A < B = 1,A = B = 1