S.N PAR Q.

TYP
QUESTION
O T E
1 A DESC Convert (231.3)10 to base 8
2 A DESC Prove that AB+(AC)’+AB’C(AB+C)=1
3 A DESC State the Commutative Property of Boolean Algebra
4 A DESC What is the binary equivalent of the decimal number 368
5 A DESC Given a binary value 1000100100111. Convert into hexa decimal number
6 A DESC Reduce the Boolean expression ABC’D+A’BD+ABCD to two literals
7 A DESC Which gate is called controlled inverter? Why?
8 A DESC Show how to connect NAND gate to get AND gate.
9 A DESC Find the Complement of F=wx+yz
10 A DESC Convert the following function into canonical POS Form Y=A+B’C
11 A DESC State the associative property of boolean algebra.
12 A DESC State the Distributive property of Boolean algebra.
13 A DESC State De Morgan's theorem.
14 A DESC Reduce A'B'C' + A'BC' + A'BC.
15 A DESC Simplify the following expression Y = (A + B)(A + C' )(B' + C' )
16 A DESC Prove that ABC + ABC' + AB'C + A'BC = AB + AC + BC
17 A DESC Convert the given expression in canonical SOP form Y = AC + AB + BC
18 A DESC State the limitations of karnaugh map.
19 A DESC What is a karnaugh map?
20 A DESC Find the min terms of the logical expression Y = A'B'C' + A'B'C + A'BC +
ABC'
21 A DESC What are called don’t care conditions?
22 A DESC Which gates are called as the universal gates? What are its advantages?
23 A DESC Minimise the function using Boolean algebra f=x+(y+w’z)+wxz)
24 A DESC Draw the logic diagram for X = AB + B’C
25 A DESC Express F = A + B’C as sum of minterms.
26 A DESC Simplify A + AB + A’ + B
27 A DESC Define Minterm and Maxterm
28 A DESC Draw the K map for 4 variable for Canonical SOP and Canonical POS form.
29 A DESC Simplify the following using K-map F=∑m(0,2,3,4,5)
30 A DESC Simplify the following using K-map F=πm(0,1,2,4,5)
31 B& C DESC Reduce the following using K Map technique
F(A,B,C,D)=∑m(0,1,2,4,5,6,8,9,12,13,14)
32 B& C DESC Simplify the following using K Map F=∑m(2,3,10,11,12,13,14,15)

33 B& C DESC Explain the basic laws of Boolean algebra with Example.

34 B& C DESC Convert the following decimal numbers to their hexadecimal equivalents :
(1) 14 (2) 80 (3) 3000 (4) 62.500
35 B& C DESC Simplify using K map F(A,B,C,D)= ∑π(0,3,4,7,8,10,12,14)+d(2,6)

36 B& C DESC Simplify the following using Quine McClusey method F(A,B,C,D)=
∑m(0,2,3,6,7,8,10,12,13)
37 B& C DESC What are the advantages of using tabulation method? Determine the
minimal sum of product for the Boolean expression
F=∑m(1,2,3,7,8,9,10,11,14,15)
38 B& C DESC Use tabulation method pbtain the minimal sum of product for the following
function F(X1,X2,X3,X4)= ∑m(0,1,3,6,7,14,15)
39 B& C DESC Convert the following hexadecimal numbers to decimal. (1) AC (2) A85 (3)
E5 (4) B2F8
 40 B& C DESC Explain in detail about all the number systems.

41 B& C DESC Explain all the Boolean postulates used for simplification of expressions.

42 B& C DESC Find the minimum sum of products expression using K-map for the function
F = Σm ( 7, 9, 10, 11, 12, 13, 14, 15 ) and realize the minimized function
using only NAND gates
43 B& C DESC Simplify using Quine-McClusky method F = Σm ( 0, 1, 2, 3, 10, 11, 12, 13,
14, 15 )
44 B& C DESC Simplify the function using Karnaugh map. (i) F (ABCD) = ∑ (0, 1, 2, 4, 5, 7,
11, 15) (ii) F (WXYZ) = ∑ (2, 3, 10, 11, 12, 13, 14, 15)
45 B& C DESC Simplify the Boolean function using K-map and tabular methods. Compare
the methods. F (A, B, C, D) =∑m(4,5,6,7,8) d (A, B, C, D) =
∑m(11,12,13,14,15) Implement using only NAND gates.
46 B& C DESC Simplify the Boolean function using K-map and tabular methods. Compare
the methods. F (A, B, C, D) =∑m(4,5,6,7,8) +d ∑m(11,12,13,14,15)
Implement using only NAND gates
47 B& C DESC Using Karnaug map method to simplify the following Boolean expression
F(A,B,C,D)=∑m(2,4,6,10,12)+d(0,8,9,13)
48 B& C DESC Implement the following function using Quine Mcclusky method
F=∑m(6,7,8,9)+d(10,11,12,13,14,15)
49 B& C DESC Determine the Minimal Sum of Product for the Boolean Expression
F(A,B,C,D)= ∑m(1,2,3,9,12,13,14)+ ∑d(0,7,10,15)
50 B& C DESC Simplify the following using quine Mc-clusky method F(A,B,C,D) =
∑m(0,1,2,3,5,7,8,10,12,13,15)
51 B& C DESC (i) State and prove Demorgans theorem (6) (ii) Reduce the following
function using K map technique (7) F(A,B,C,D)=πM(0,2,3,8,9,12,13,15)
52 B& C DESC Minimize the expression using K map
Y=A’BC’D’+A’BC’D’+ABC’D’+ABC’D+AB’C’D+A’BCD’
53 B& C DESC Simplify using K map to obtain a minimum POS expression
(A’+B’+C+D)(A+B’+C+D)(A+B+C+D’)(A+B+C’+D’)(A’+B+C+D’)(A+B+C’+
D)
54 B& C DESC Simplify the Following Boolean function for a minimal POS form
F(w,x,y,z)=πM(4,5,6,7,8,12)+d(1,2,3,9,11,14)
55 B& C DESC Simplify the following using tabulation methods Y(w,x,y,z) =
∑m(1,2,3,5,9,12,14,15)+∑d(4,8,11)
56 B& C DESC Minimize the function F using Quine McCluskey method
F=∑(0,1,2,8,10,11,14,15)
57 B& C DESC Minimize the given terms using tabulation method and verify using K Map
technique F(x1,x2,x3,x4)=∑(0,1,4,11,13,15)+d(5,7,8)

UNIT 5

2023 A DESC Define fan in and fan out in logic devices.

2023 A DESC Differentiate PAL and PLA.
2023 A DESC What is EEPROM?
2023 A DESC Write the types of programmable logic devices?
2023 A DESC Differentiate volatile and non volatile memory.
2023 A DESC What is PLA? Mention its uses.
2023 A DESC What is meant by FPGA?
2023 A DESC Differentiate Bipolar RAM cell and MOSFET RAM cell.
2023 A DESC What is meant by Flash memory?
2023 A DESC Write about Static RAM cell.
2023 A DESC Differentiate static RAM cell and Bi polar RAM cell.
2023 A DESC What is meant by RTL,TTL, ECL?
2023 A DESC Design ROM for the following functions F1=∑m(1,2,3), F2=∑m(0,2)
2023 A DESC Implement the exclusive OR function using ROM.
2023 A DESC State the advantages of RAM
2023 B & DESC Explain in detail about types of memories.
C
2023 B & DESC Implement the following functions using PROM
C
F1=∑m(0,2,3,4,5,10,11,13,14)

F2=∑m(1,2,5,6,7,8,11,13,14,15)
2023 B & DESC Explain in detail about RAM with its types
C

2023 B & DESC Explain in detail about PROM.

C

2023 B & DESC Explain in detail about PLA with an example

C

2023 B & DESC Explain in detail about PAL with an example.

C

2023 B & DESC Implement 4 bit binary to gray code converter using PLA
C

2023 B & DESC Design BCD to Excess 3 code converter and implement using PLA.
C

2023 B & DESC Design and implement binary to gray code converter using PAL
C

2023 B & DESC Implement the following functions using PLA

C F1=∑(0,1,2,4), F2=∑(0,1,2,3,5,7) and F3=∑(0,5,6,7)

2023 B & DESC Design BCD to Excess 3 code converter and implement using PAL.
C

2023 B & DESC Implement the following functions using PAL

C
F1=∑m(1,2,3,5,6,7,8,9,11,12)

F2=∑m(0,2,5,6,7,8,11,14,15)

F3=∑m(1,3,4,5,8,9,11,12,13,15)
2023 B & DESC Explain in detail about RTL, ECL, TTL and CMOS Logic.
C

2023 B & DESC Explain in detail about the characteristics of logic families
C