On This Page

This set of Digital Electronics and Logic Design Multiple Choice Questions & Answers (MCQs) focuses on Digital Electronics And Logic Design Set 2

Q1 | The code where all successive numbers differ from their preceding number by single bit is
  • binary code.
  • bcd.
  • excess – 3.
  • gray.
Q2 | -8 is equal to signed binary number
  • 10001000
  • oooo1000
  • 10000000
  • 11000000
Q3 | DeMorgan’s first theorem shows the equivalence of
  • or gate and exclusive or gate.
  • nor gate and bubbled and gate.
  • nor gate and nand gate.
  • nandgate and not gate
Q4 | When signed numbers are used in binary arithmetic, then which one of the following notations would have unique representation for zero.
  • sign- magnitude.
  • 1’s complement.
  • 2’s complement.
  • 9’s compleme nt.
Q5 | The decimal equivalent of Binary number 11010 is
  • 26
  • 36
  • 16
  • 23
Q6 | 1’s complement representation of decimal number of -17 by using 8 bit
  • 1110 1110
  • 1101 1101
  • 1100 1100
  • 0001 0001
Q7 | The excess 3 code of decimal number 26 is
  • 0100 1001
  • 1011001
  • 1000 1001
  • 1001101
Q8 | How many AND gates are required to realize Y = CD+EF+G
  • 4
  • 5
  • 3
  • 2
Q9 | The hexadecimal number for (95.5)10 is
  • (5f.8) 16
  • (9a.b) 16
  • ( 2e.f) 16
  • ( 5a.4) 16
Q10 | The octal equivalent of (247) 10 is
  • ( 252) 8
  • (350) 8
  • ( 367) 8
  • ( 400) 8
Q11 | The number 140 in octal is equivalent to
  • (96)10 .
  • ( 86) 10
  • (90) 10 .
  • none of these.
Q12 | The NOR gate output will be low if the two inputs are
  • 11
  • 1
  • 10
  • all
Q13 | Convert decimal 153 to octal. Equivalent in octal will be
  • (231)8
  • ( 331) 8
  • ( 431) 8 .
  • none of these.
Q14 | The decimal equivalent of ( 1100)2 is
  • 12
  • 16
  • 18
  • 20
Q15 | The binary equivalent of (FA)16 is
  • 1010 1111
  • 1111 1010
  • 10110011
  • none of these
Q16 | How many two-input AND and OR gates are required to realize Y=CD+EF+G
  • 22
  • 23
  • 33
  • none of these
Q17 | The excess-3 code of decimal 7 is represented by
  • 1100
  • 1001
  • 1011
  • 1010
Q18 | When an input signal A=11001 is applied to a NOT gate serially, its output signal is
  • 111
  • 110
  • 10101
  • 11001
Q19 | The result of adding hexadecimal number A6 to 3A is
  • dd
  • e0
  • f0
  • ef
Q20 | A universal logic gate is one, which can be used to generate any logic function. Which of the following is a universal logic gate?
  • or
  • and
  • xor
  • nand
Q21 | Karnaugh map is used for the purpose of
  • reducing the electronic circuits used.
  • to map the given boolean logic function.
  • to minimize the terms in a boolean expression.
  • to maximize the terms of a given a boolean expression.
Q22 | The 2’s complement of the number 1101110 is
  • 10001
  • 10001
  • 10010
  • none
Q23 | The decimal equivalent of Binary number 10101 is
  • 21
  • 31
  • 26
  • 28
Q24 | How many two input AND gates and two input OR gates are required to realize Y = BD+CE+AB
  • 11
  • 42
  • 32
  • 23
Q25 | Which of following are known as universal gates
  • nand & nor
  • and & or.
  • xor & or.
  • none.