2 mark
[Link] between the Combinational and Sequential logic circuits?
[Link] to detect double bit error and correct single bit error in Hamming code?
[Link] the following decimal numbers to indicated bases
7562.45 to octal
1938.257 to hexadecimal
175.175 to binary
[Link] a combinational circuit with three inputs and one output. The output is equal to logic
- 1 when the binary value of the input is less than 3, and a logic ‘0’ otherwise.
[Link] the following ;
Convert 10101 Gray to Binary
Convert 1100 to Excess-3
[Link] EXOR function using only NAND gates.
[Link] the expression Y=AB+AC+BC into standard POS form
[Link] that AB+BC+B’C = AB+C
[Link] a logic diagram of 2 bit magnitude comparator
10.1Convert the given expression in canonical SOP form Y = AC + AB + BC
[Link] the Boolean function F= A + A′B.
[Link] gates are called as universal gates? What are its advantages?
[Link] is meant by comparator?
10 mark
[Link] the following Boolean expression to a minimum number of literals
A'C'+ABC+AC' and XYZ+X'Y+XYZ'
[Link] is Binary code and explain about Weighted codes and Non weighted codes in detail?
[Link] F (A, B, C, D) = Σ(0, 1,2, 5, 8, 9, 10) in Sum of Products (SOP) using Karnaugh
Map
[Link], the Product of Sum (POS) expression using Karnaugh Map method F= π
(0,1,4,5,6,8,9,12,13,14)
[Link] a Half adder and a Half Subtractor circuit using NAND gates.
[Link] a full-adder with two 4 x 1 multiplexers.
[Link] a code converter which converts a four bit binary codes in to its equivalent unit
distance code
8. Apply the K-map Method and Simplify the following;
Σm(0,4,5,6,7,8,15) + d(12,13,14)
9. Apply the K-map Method and Simplify the following;
πM(0,1,6,9,12,14) + d(2,4,5,8,10)
[Link] the minimum SOP for the given Boolean expression using
Quine McCluskey method.
f(a,b,c,d)=Σm(2,3,7,9,11,13)+Σd(1,10,15)
[Link] the concept of Carry Look-ahead Adder with neat logic
diagram.
[Link] and explain a 2 bit magnitude comparator.
[Link] a 4 bit adder/subtractor circuit having overflow detection
with a neat diagram.
[Link] a logic circuit that converts BCD code to Excess-3 code.
[Link] the maxterms of the following function AB' + A'B'D + A'CD'
[Link] Quine McCluskey method to reduce the following function
f(x1, x2, x3, x4, x5) =
∑m(0,2,4,5,6,7,8,10,14,17,18,21,29,31) + ∑d(11,20,22)
17. Design a half adder using logic gates.
[Link] the operation of carry look ahead adder with neat diagram.
[Link] and prove the postulates and theorems of Boolean algebra.
[Link] basic gates using NAND Gates.
[Link] the minimal expression for f = ∑m(1,2,3,7,8,9,10,11,14,15)
using tabular method.
[Link] the expression Y = ∑m(3,4,5,7,9,13,14,15) using K map
method.
[Link] in detail about adder and subtractor developed using logic
gates with necessary truth table and logic diagram.
[Link] that ABC + ABC' + AB'C + A'BC = AB + AC + BC
[Link] AB + (AC)' + AB'C (AB + C)
[Link] the following number systems:
(10.25)10 =(?)2 ,
(1010.01)2 =(?)10
(10.25)10 =(?)8
(12.2)8 = (?) 10
(1111011011)2=(?)16
[Link] the following Boolean function
F(A, B, C, D) = Σ m(1, 3, 4, 6, 8, 9, 11, 13, 15) + Σ d(0, 2, 14)
[Link] K-map deduce the Boolean expression for a 2bit magnitude
comparator. Also sketch the related Boolean diagram.
[Link] the following Boolean Expression using K-map,
F(A,B,C,D) = Σm(1,3,4,6,8,9,11,13,15) + Σd(0,2,14)
30. Simplify the following expression
by K-map,
F(A,B,C,D) = Σm(3,4,5,7,9,13,14,15)
Simplify the following Boolean function,
f(W,X,Y,Z) = Σm(2,6,8,9,10,11, 14,15) using Quine-
McCluskey tabulation method.
[Link] the combinational circuit that converts binary to gray code.
[Link] the following function using K-Map.
F(A,B,C,D,E) = Σm(1,4,8,10,11,20,22,24,25,26)+d(0,12,16,17)
[Link] down the procedure to convert a given AND-OR gate network
to all NAND gate network and illustrate with an example
[Link] the following Boolean expressions to a minimum number of
literals
ABC+A'B+ABC'
xy + x(wz+wz')
35. 4 bit adder- subtractor