Digital Electronics Set 5
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
Q2 | (A + B)(A’ * B’) = ?
- 1
- 0
- ab
- ab’
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’)
Q4 | Simplify Y = AB’ + (A’ + B)C.
- ab’ + c
- ab + ac
- a’b + ac’
- ab + a
Q5 | The boolean function A + BC is a reduced form of
- ab + bc
- (a + b)(a + c)
- a’b + ab’c
- (a + c)b
Q6 | A is a circuit with only one output but can have multiple inputs.
- logic gate
- truth table
- binary circuit
- boolean circuit
Q7 | There are 5 universal gates.
- true
- false
Q8 | The Output is LOW if any one of the inputs is HIGH in case of a gate.
- nor
- nand
- or
- and
Q9 | The complement of the input given is obtained in case of:
- nor
- and+nor
- not
- ex-or
Q10 | How many AND gates are required to realize the following expression Y=AB+BC?
- 4
- 8
- 1
- 2
Q11 | Number of outputs in a half adder
- 1
- 2
- 3
Q12 | The gate is an OR gate followed by a NOT gate.
- nand
- exor
- nor
- exnor
Q13 | The expression of a NAND gate is
- a.b
- a’b+ab’
- (a.b)’
- (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
Q15 | The logical sum of two or more logical product terms is called
- sop
- pos
- or operation
- nand operation
Q16 | The expression Y=(A+B)(B+C)(C+A) shows the operation.
- and
- pos
- sop
- nand
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’
Q18 | A variable on its own or in its complemented form is known as a
- product term
- literal
- sum term
- word
Q19 | Maxterm is the sum of of the corresponding Minterm with its literal complemented.
- terms
- words
- numbers
- nibble
Q20 | Canonical form is a unique way of representing
- sop
- minterm
- boolean expressions
- pos
Q21 | There are Minterms for 3 variables (a, b, c).
- 0
- 2
- 8
- 1
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
Q23 | There are cells in a 4-variable K- map.
- 12
- 16
- 18
- 8
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
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