5.
For the given Boolean function F=xy’z+x’y’z+w’xy+wx’y+wxy
i. Draw the logic diagram ii. Simplify the function to minimal literals using Boolean algebra.
Unit-3
1.
Simplify the following Boolean expressions using K-map and implement them using NOR gates:
F (A, B, C, D) = AB’C’ + AC + A’CD’
2.
List the Boolean function simplification rules using Tabulation method.3.
Simplify the Boolean function using K-map and implement using NAND gates
F=Σm(0,2,3,4,5,6)
4.
Reduce the given function using tabular minimization method
F(A,B,C,D)=П(0,1,3,4,
5,6,7,8,9)+d(10,11,12,13,14,15)5.
Simplify the Boolean expression using K-map F=A
1
+AB+ABD
1
+AB
1
D
1
+C
Unit-4
1.
Implement the following Boolean functions using decoder and OR gates:F1(A,B,C,D) =
∑
(2,4,7,9), F2(A,B,C,D) =
∑
(10,13,14,15)2.
What is Hazard in switching circuits? Explain the design of Hazard freeSwitching circuit with an example.3.
What is Encoder? Design Octal to Binary Encoder.
4.
Design a combinational circuit that converts a decimal digit from 8, 4,-2,-1 code to 8,4,2,1 BCDcode.
5.
Design a combinational circuit that accepts a 3 bit number and generates an output binarynumber equal to the square of the input number.
Unit-5
1.
Implement the following boolean functions using PLA.f1(w,x,y,z) = P(0,1,3,5,9,13) , f2 (w,x,y,z) = P(0,2,4,5,7,9,11,15).2.
The following memory units are specified by the no of words times the number of bits per word.How many address lines and input-output data lines are needed in each case?i. 4K × 16 ii. 2G × 8 iii. 16M × 32 iv. 256K × 64. Give the number of bytes stored in thememories listed above.