Test 1

Digital Electronics (ECE213)

Name SET D Duration: 45 Mins
Roll No. Max Marks: 30 Date:
Note: All Questions are compulsory. Questions 1 to 20 each of one mark and Questions 20 to 25
each of 2 marks. There will be negative marking of 0.25 marks from Question 1 to 20 and 0.50
marks from Question 20 to 25 for each wrong answer
Mark a proper circle on a correct answer
1. Convert (0.59C)16 to equivalent decimal 8. Multiplication of (1001)2 by (1000)2 is
number equivalent to
(a) 0.3558 (b) 0.350585 (a) (10011000)2 (b) (1001000)2
(c) 0.3668 (d) 0.360685 (c) (0001001)2 (d) (10001001)2
2. The binary number 110011 is to be 9. Which code is also known as self
converted to gray code. The number of complementing code?
gates and type required are – (a) Gray code (b) Binary code
(a) 6, AND gate (b) 6, XNOR Gate (c) XS- 3 Code (d) BCD Code
(c) 6, XOR gate (d) 5, XOR gate 10. 10’s complement of (9999)10 is given by
3. A 4 – bit BCD for numeral 9 can be (a) 0001 (b) 0000
decoded most economically by the logic (c) 1000 (d) 1111
operation 11. Obtain the XS – 3 code for (428)10
(a) ABCD (b) (a) 1011 0101 0111
(c) (d) (b) 0111 1011 0101
4. Range of 1’s complement for a 4-bit (c) 1011 0111 0101
number is (d) 0111 0101 1011
(a) +8 to -8 (b) +7 to -8 12. A binary with n digits all of which are
(c) + 8 to -7 (d) +7 to -7 unity has the value
5. A 4-bit microprocessor uses 2’s (a) (b)
complement representations. The (c) (d)
decimal number – 8 in sign magnitude 13. The parity bit is added for which
form can represented as purposes?
(a) (1000)2 (b) (0111)2 (a) Error Correction
(c) (0101)2 (d) (1111)2 (b) Coding
6. A combinational circuit (c) Indexing
(a) Always contain memory element (d) Controlling
(b) never contains memory element 14. Represent the (4096)10 in gray code
(c) may sometimes contain memory (a) (1000000000000)2
element (b) (1100000000000)2
(d) Contain memory element (c) (1000000000001)2
7. Subtract (161)8 – (243)8 (d) (1100000000011)2
(a) (534)8 (b) (82)8 15. Which one of the following is non –
(c) (62)8 (d) (715)8 valid BCD Code?
(a) 0111 1001 (b) 0101 1011
(c) 0100 1000 (d) 0100 1001
16. The output of an Ex – OR Gate with A
and B inputs will be
(a) (b) X = BC + A
(a) (b)
(c) (d) (c) X = AB + AC
17. The POS form of expression is suitable
for circuit using (d) X = AB + C
(a) XOR (b) NAND
22. The Boolean expression
(c) AND (d) NOR
is logically equivalent to
18. The reason for using Gray Code in K-
(a) (b)
Map is
(c) YZ + XZ +XY
(a) Gary code is efficient than binary
(d)
codes
(b) Gray code provides cell values that 23. Given, (136)x + (165)x = (312)x
differ in only one bit in adjacent cells What is the value of base x?
(c) No other code is available (a) 6 (b) 7
(d) any other code can also be used (c) 8 (d) 9
19. Which of the following statement is not 24. The minimum number of NAND gates
correct? required to implement
(a) (b)
(c) (a) 0 (b) 7
(c) 9 (d) 1
(d)
25. Minimized the given expression
20. The other Canonical form of
Y = ∑m (3, 2, 6, 8, 10, 11, 15) + d (5, 7,
Y = ∑m (0, 1, 5, 7) is
12, 13, 14)
(a) ∏M (2, 3, 4, 6)
(b) ∏M (0, 1, 5, 7) (a) (b) B + AC
(c) ∏M (0, 3, 4, 7) (c) C + A (d) ABC
(d) ∏M (2, 1, 5, 6)
21. For the logic circuit given logical circuit
diagram, which is the simplified Boolean
expression?