BVVS B.V.V.
S
BASAVESHWAR ENGINEERING COLLEGE(AUTONOMOUS), BAGALKOT
DEPARTMENT: ELECTRONICS AND COMMUNICATION ENGINEERING
ACADEMIC YEAR: 2022-23(ODD SEMESTER)
CIE I(Scheme and Solution)
Course : BE Semester: III
Subject : Digital Electronics and Logic Design Division: A
Subject code: 21UEC303C Time: 8:30 -10:00am
Date: 13/12/2022 Max. Marks: 40
Faculty: Supriya B H
Part- A
Q. No
Question
Marks BLL CO PI
1. i) The OR function is Boolean multiplication and the AND function is the 1 L1 1 1.1.1
Boolean addition
A. True
B. False
Applying DeMorgan's theorem and Boolean algebra to the 2 L1 1 1.1.2
expression results in ________.
ii)
The number of input combinations for a 4-input gate is ________. 1 L1 1 1.1.3
iii)
iv) Solve the network in the figure given below for X. 2 L1 1 1.1.4
A Karnaugh map is similar to a truth table because it presents all the 1 L1 1 1.1.3
possible values of input variables and the resulting output of each value.
A. True
B. False
vi) A full-adder has a Cin = 0. What are the sum ( ) and the carry (Cout) when A 2 L1 2 1.1.2
= 1 and B = 1?
A. = 0, Cout = 0
B. = 0, Cout = 1
C. = 1, Cout = 0
D. = 1, Cout = 1
vii) The look-ahead carry method suffers from propagation delays 1 L1 2 1.1.2
A. True
B. False
PART-B
Q. No Question
Marks BLL CO PI
UNIT-I
a. Using Boolean identities prove the following relationships. 05 L3 1 2.2.1
2
i. xy+x y+x y=x+ y
ii. ( x+ y)( x+z)=xz+x y
iii. ( x+ y )( y + z )( x + z )=xy + yz+ xz
b. Reduce the following Boolean function using K Map 10 L2 1 2.2.1
i. F(A, B, C, D) = Σm(0, 1, 2, 5, 7, 8, 9, 10, 13, 15)
ii. F(A, B, C, D) = Σm(0, 1, 3, 5, 7, 8, 9, 11, 13, 15)
3 a. Using Quine-Mccluskey Method simplify the following Boolean 09 L2 1 2.1.3
expression
F(w,x,y,z)=∑m(0,4,5,7,8,11,12,15)
Table showing group and binary representation.
UNIT-II
4 a. With an example, explain 4 bit parallel binary adder, highlights its 09 L3 2 2.2.3
limitations
Explanation
Its limitations
b. Implement the following functions using 74LS138 06 L4 2 2.2.4
i. F(a,b,c)=π(0,1,3,5)
ii. F(p,q,r)=∑m(1,2,3,7)
iii. F(x,y,z)= ∑m(0,1,5,6,7)
5 a. With neat diagram explain 2 bit comparator 09 L4 2 2.2.1
Truth table of 2bit comparator
K map
Logic diagram
Explanation
b. Realize the following function using 8:1 MUX 06 L4 2 2.2.3
i. F(w,x,y,z)=∑m(1,2,6,7,9,11,12,14,15)
ii. F(a,b,c,d)=∑m(0,4,6,8,9,11,13,14)
