Digital Electronics Set 5

Electrical Engineering,

Bachelor of Science in Computer Science FY (BSc CS),

Bachelor of Computer Applications (BCA),

Bachelor of Science in Computer Science (BSc CS)

Practice Mode Previous Next
On This Page

This set of Digital Electronics Multiple Choice Questions & Answers (MCQs) focuses on Digital Electronics Set 5

Q1 | DeMorgan’s theorem states that                    
  • (ab)’ = a’ + b’
  • (a + b)’ = a’ * b
  • a’ + b’ = a’b’
  • (ab)’ = a’ + b
Answer: (ab)’ = a’ + b’
Q2 | (A + B)(A’ * B’) = ?
  • 1
  • 0
  • ab
  • ab’
Answer: 0
Q3 | Complement of the expression A’B + CD’ is                    
  • (a’ + b)(c’ + d)
  • (a + b’)(c’ + d)
  • (a’ + b)(c’ + d)
  • (a + b’)(c + d’)
Answer: (a + b’)(c’ + d)
Q4 | Simplify Y = AB’ + (A’ + B)C.
  • ab’ + c
  • ab + ac
  • a’b + ac’
  • ab + a
Answer: ab’ + c
Q5 | The boolean function A + BC is a reduced form of                          
  • ab + bc
  • (a + b)(a + c)
  • a’b + ab’c
  • (a + c)b
Answer: (a + b)(a + c)
Q6 | A                          is a circuit with only one output but can have multiple inputs.
  • logic gate
  • truth table
  • binary circuit
  • boolean circuit
Answer: logic gate
Q7 | There are 5 universal gates.
  • true
  • false
Answer: false
Q8 | The Output is LOW if any one of the inputs is HIGH in case of a                    gate.
  • nor
  • nand
  • or
  • and
Answer: nand
Q9 | The complement of the input given is obtained in case of:
  • nor
  • and+nor
  • not
  • ex-or
Answer: not
Q10 | How many AND gates are required to realize the following expression Y=AB+BC?
  • 4
  • 8
  • 1
  • 2
Answer: 2
Q11 | Number of outputs in a half adder
  • 1
  • 2
  • 3
Answer: 2
Q12 | The                  gate is an OR gate followed by a NOT gate.
  • nand
  • exor
  • nor
  • exnor
Answer: nor
Q13 | The expression of a NAND gate is               
  • a.b
  • a’b+ab’
  • (a.b)’
  • (a+b)’
Answer: (a.b)’
Q14 | Which of the following correctly describes the distributive law.
  • ( a+b)(c+d)=ab+cd
  • (a+b).c=ac+bc
  • (ab)(a+b)=ab
  • (a.b)c=ac.ab
Answer: (a+b).c=ac+bc
Q15 | The logical sum of two or more logical product terms is called                      
  • sop
  • pos
  • or operation
  • nand operation
Answer: sop
Q16 | The expression Y=(A+B)(B+C)(C+A) shows the                    operation.
  • and
  • pos
  • sop
  • nand
Answer: pos
Q17 | The canonical sum of product form of the function y(A,B) = A + B is                      
  • ab + bb + a’a
  • ab + ab’ + a’b
  • ba + ba’ + a’b’
  • ab’ + a’b + a’b’
Answer: ab + ab’ + a’b
Q18 | A variable on its own or in its complemented form is known as a
  • product term
  • literal
  • sum term
  • word
Answer: literal
Q19 | Maxterm is the sum of                      of the corresponding Minterm with its literal complemented.
  • terms
  • words
  • numbers
  • nibble
Answer: terms
Q20 | Canonical form is a unique way of representing                          
  • sop
  • minterm
  • boolean expressions
  • pos
Answer: boolean expressions
Q21 | There are                            Minterms for 3 variables (a, b, c).
  • 0
  • 2
  • 8
  • 1
Answer: 8
Q22 |                            expressions can be implemented using either (1) 2-level AND- OR logic circuits or (2) 2-level NAND logic circuits.
  • pos
  • literals
  • sop
  • pos
Answer: sop
Q23 | There are              cells in a 4-variable K- map.
  • 12
  • 16
  • 18
  • 8
Answer: 16
Q24 | The prime implicant which has at least one element that is not present in any other implicant is known as                        
  • essential prime implicant
  • implicant
  • complement
  • prime complement
Answer: essential prime implicant
Q25 | Product-of-Sums expressions can be implemented using                        
  • 2-level or-and logic circuits
  • 2-level nor logic circuits
  • 2-level xor logic circuits
  • both 2-level or-and and nor logic circuits
Answer: both 2-level or-and and nor logic circuits
Previous Next