Professional Documents
Culture Documents
Fallsem2022-23 Bece102l TH Vl2022230102871 Reference Material I 19-09-2022 Slow Learner Questions (Cat1)
Fallsem2022-23 Bece102l TH Vl2022230102871 Reference Material I 19-09-2022 Slow Learner Questions (Cat1)
1. a. Simplify the following expression using Boolean Algebra 𝐹 = 𝑎𝑏𝑐𝑑 + 𝑎𝑏𝑐𝑑 + 𝑏𝑒𝑓 + 𝑐𝑑𝑒𝑔+ 𝑎𝑑𝑒𝑓.
1. c. Simplify the following Boolean expression using Boolean algebra. 𝐴 ′𝐵(𝐷 ′ + 𝐶 ′𝐷) + 𝐵(𝐴 + 𝐴 ′𝐶𝐷) (to
one literal)
2. b. Convert the given expression in SOP and POS canonical form 𝐹(𝐴, 𝐵, 𝐶) = (𝐴 + 𝐵)(𝐵 + 𝐶)(𝐴 + 𝐶)
2. c. Simplify the following using K-Map and draw the logic diagram using only NAND gates.
F(a,b,c,d) =𝑎𝑐 ′𝑑 ′ + 𝑎 ′ 𝑐 + 𝑎𝑏𝑐 + 𝑎𝑏 ′ 𝑐 + 𝑎 ′ 𝑐 ′𝑑 ′.
3. Minimize the Boolean function F(A,B,C,D) = Σm(0,1,3,5,8,11)+ Σdm (2,7,10,15) using K map in both SOP
as well as POS forms and implement using only NAND gates.
5. a. A switching circuit has two control inputs (A & B), two data inputs (C & D), and one output (Z). The
circuit performs one of the logic operations on the two data inputs. The function performed depends on
the control inputs:
5. b. Design a combinational circuit with three inputs, x, y, and z, and three outputs, A, B, and C. When
the binary input is 0, 1, 2, or 3, the binary output is one greater than the input. When the binary input is
4, 5, 6, or 7, the binary output is one less than the input. Write the Verilog code using data flow modelling
for the designed circuit.
6. a. For the given logic circuit,
6. b. Write Verilog code for the following logic diagram shown in Figure. Consider A as addend and B as
augend.