Type of Question : Multiple Choice Questions

SUBJECT : US01EBCA01

TYPE OF QUESTION : MULTIPLE CHOICE QUESTIONS

UNIT – I
1. The ______gate has two or more input signals. All inputs must be high to get a high output.
A. AND / B. OR / C. NAND / D. NOR
2. Invert gate has only ______input and ______output.
A. Two,One / B. One,Two / C. One,One / D. None
3. An invert gate is also called a ______gate.
A. NOR / B. NOT / C. XNOR / D. NAND
4. The OR gate has two or more input signals. If any input is ______, the output is high.
A. high / B. low / C. both A and B / D. none
5. The NAND gate has two or more input signals. If all inputs are ______, the output is low.
A. low / B. high / C. both A and B / D. none
6. The NOR gate has two or more input signals. If all inputs are ______, the output is high.
A. low / B. high / C. both A and B / D. none
7. The______gate has two or more input signals. All inputs must be same to get a low output.
A. NOR / B. EX-NOR / C. NAND / D. EX-OR
8. The______gate has two or more input signals. All inputs must be same to get a high output.
A. EX-OR / B. NAND / C. EX-NOR / D. NOR
9. De Morgan’s first theorem says that a NOR gate is equivalent to a ______.
A. bubbled OR / B. bubbled NOR / C. bubbled AND / D. AND bubbled
10. De Morgan’s second theorem says that a NAND gate is equivalent to a ______.
A. bubbled AND / B. bubbled NAND / C. OR bubbled / D. bubbled OR
11. A+A’B+A’B’=?
A. 1 / B. 0 / C. A / D. A’
12. ______is way to simplify the equation.
A. Boolean Algebra / B. K-MAP / C. BOTH / D. NONE
UNIT – II
1. In k-map, pair eliminates ______variable.
A. one / B. two / C. three / D. four
2. In k-map, quad eliminates ______variable.
A. one / B. two / C. three / D. four
3. In k-map, octets eliminates ______variable.
A. one / B. two / C. three / D. four
4. The relationship between a function and its binary variables can be represented in ______.
A. truth table / B. decoder / C. encoder / D. multiplexer
5. A______is a combinational circuit that converts binary information from the n coded inputs to a maximum of 2n unique outputs.
(A) Half Adder / (B) Decoder / (C) Encoder / (D) Comparator
6. A ______is a combinational circuit that converts binary information from the 2n coded inputs to a n outputs.
(A) Half Adder / (B) Decoder / (C) Encoder / (D) Comparator
7. In Comparator, ______gate is use for comparing bits in word.
(A) XOR / (B) AND / (C) NOR / (D) XNOR
UNIT – III
1. A combinational circuit that performs the arithmetic addition of two bits is called ______.
(A) Full Adder / (B) Half Adder / (C) Binary Adder / (D) Decoder
2. A combinational circuit that performs the arithmetic addition of three bits is called ______.
(A) Full Adder / (B) Half Adder / (C) Binary Adder / (D) Decoder
3. A gate is a logic circuit with one or more input signals but only ______output signal.
A. two / B. one / C. three / D. four
4. A ______is logic circuit that can add two binary numbers.
A. binary adder / B. decoder / C. AND gate / D. OR gate
5. A ______is a memory element that stores a binary digit.
A. binary adder / B. decoder / C. multiplexer / D. flip-flop
6. Half adder is logic CKT that adds. ………Digit at a time
A. 1 / B. 2 / C. 3 / D. 4
7. Half adder consist of. ……&…..Gates
A. XOR, AND / B. XOR, OR / C. XNOR, AND / D. XNOR,Or
8. in half adder xor gate’s ouyput is……….
A. carry / B. sum / C. reminder / D. none
9. in half adder and gate’s ouyput is……….
A. carry / B. sum / C. reminder / D. none
10. the full CKT adds …….. digit at a time.
A. 1 / B. 2 / C. 3 / D. none
UNIT – IV
1. In D flip-flop, when CLK is low then input is ______.
A. high / B. low / C. Don’t care / D. Not change
2. In D flip-flop, when CLK is low then ouput is ______.
A. high / B. low / C. Don’t care / D. Not change
3. In D flip-flop, when CLK is hign then output is______.
A. high / B. low / C. invert of input / D. same as input
4. A register is a group of ______that work together as a unit.
A. flip-flop / B. decoder / C. multiplexer / D. gates
5. In shift left register, the arrival of the first rising clock edge sets the ______flip-flop
A. left / B. right / C. up / D. down
6. In shift right register, the arrival of the first rising clock edge sets the ______flip-flop
A. left / B. right / C. up / D. down
7. A ______register is the simplest kind of register; all it does store a digital word.
A. shift left / B. shift right / C. buffer / D. simple
8. Ring counter producing words with 1 high bit, which shifts ______position per clock pulse.
A. one / B. two / C. three / D. none
9. A multiplexer also called a ______.
A. data multiplier / B. data selector / C. data inverter / D. data remover

SUBJECT : US01EBCA01

TYPE OF QUESTION : SHORT QUESTIONS

UNIT – I
1.  Describe the AND, NOR gate.
2.  Explain NAND, OR gate.
3.  Explain NOT, XOR gate.
4.  Explain XNOR, OR gate.
5.  Write truth table for : A’B+B’C
6.  Draw the circuit for A’B+B’C+AC’
7.  Explain Associative law.
8.  Explain distributive law.
9.  Explain commutative law.
10.  Simplify Boolean expression and draw circuit. AB’+C’D+AB+CD
11.  Write truth table for : ABC +A’B’C’
12.  Draw the circuit for : (A⊕B)’(BC)(A⊕C)
13.  Simplify Boolean expression and draw circuit. AB+CD+AB+CD
14.  Explain De morgan first theorem.
15.  Explain De morgan second theorem.
UNIT – II
1.  Describe pair in k-map
2.  Describe quad in k-map
3.  Describe octet in k-map
4.  Explain sum of product.
5.  Explain product of sum.
6.  Simplify using k-map F(A,B,C)=E(1,2,5)
7.  Simplify using k-map F(A,B,C)=Л(4,6,2)
8.  Define encoder in short.
9.  Define decoder in short.
10.  Define comparator in short.
UNIT – III
1.  Describe half adder in short.
2.  Describe full adder in short.
3.  Describe binary adder in short.
4.  Describe binary subtractor in short.
5.  Describe multiplexer in short.
UNIT – IV
1.  Explain D flip-flop
2.  Explain shift left register.
3.  Explain shift-right register.
4.  Explain controlled buffer register.
5.  Explain ring counter in short.

SUBJECT : US01EBCA01

TYPE OF QUESTION : LONG QUESTIONS

UNIT – I
1.  Explain AND, NOR, NOT gate.
2.  Explain NAND, OR, NOT gate
3.  Explain XOR, AND, NOR gate
4.  Explain XNOR, OR, NAND gate
5.  Explain associative and commutative low.
6.  Explain distributive and associative low.
7.  Simplify this Boolean expression and draw circuit: ABC’+ABC+A’BC
8.  Prove that ABC’+ABC=AB using truth table.
9.  Explain de morgan’s first and second theorem.
10.  Explain truth table with appropriate example.
UNIT – II
1.  What is k-map? Explain pair and quad with example.
2.  What is k-map? Explain pair and octet with example.
3.  Explain SOP and POS in detail.
4.  Simplify this using k-map F(A,B,C,D)=∑(1,3,5,6,8,11,15)
5.  Simplify this using k-map F(A,B,C,D)=Л(1,2,5,6,8,12,14)
6.  Explain 8x3 line encoder in detail.
7.  Explain 3x8 line decoder in detail.
8.  Explain comparator with example.
UNIT – III
1.  Explain half adder in detail.
2.  Explain full adder in detail.
3.  Explain binary adder-subtractor in detail.
4.  Explain 4x1 multiplexer in detail.
UNIT – IV
1.  Explain D flip-flop in detail.
2.  Explain shift left and shift right register.
3.  Explain controlled buffer register.
4.  Explain ring counters.

5/5 Mr. Ashish Joshi