Subject: Digital Principle and System Design Sem / Year: Iii Semester/ Second Year

Download as pdf or txt
Download as pdf or txt
You are on page 1of 13

www.AUNewsBlog.

net

AUNEWSBLOG IMPORTANT QUESTIONS

SUBJECT : DIGITAL PRINCIPLE AND SYSTEM DESIGN


SEM / YEAR : III SEMESTER/ SECOND YEAR

UNIT I - BOOLEAN ALGEBRA AND LOGIC GATES


Number Systems - Arithmetic Operations - Binary Codes- Boolean Algebra and Logic Gates -
Theorems and Properties of Boolean Algebra - Boolean Functions - Canonical and Standard Forms -
Simplification of Boolean Functions using Karnaugh Map - Logic Gates – NAND and NOR
Implementations.
PART-A
Q.no Question BTL Competence
1 Find the octal equivalent of hexadecimal numbers of AB.CD (OR) DC.BA BTL5 Evaluating
2 State and prove the Consensus theorem. BTL2 Understanding
3 State the principle of Duality. BTL2 Understanding
4 Implement AND gate using only NOR gates. (OR) Realize XOR gate BTL6 Creating
using only NAND gates.
5 Convert (0.6875)10 to binary (OR) Convert (126)10 to Octal & Binary BTL3 Applying
6 Prove the following using DeMorgan’s Theorem. BTL5 Evaluating
[(X + Y)'+(X + Y) '] '=X + Y.
7 Write short notes on weighted binary codes. BTL2 Understanding
8 Illustrate NOR Operation with a truth table BTL2 Understanding
9 What is Excess-3 Code? BTL1 Remembering
10 Simplify Z = (AB +C) (B'D + C'E')+(AB+C)' BTL4 Analyzing
11 Realize G = AB'C +DE+F' BTL4 Analyzing
12 Convert (1001010. 1101001)2 to base 16 &(231.07)8 to base 10 BTL3 Applying
13 Convert the binary number to 1011111011 into gray code. (OR) Convert BTL3 Applying
(A3B)H into decimal number.
14 Find the complement of the function F= X'YZ' + X'Y'Z. BTL1 Remembering
15 Define Self complementary Code? BTL1 Remembering
16 What are Universal Gates? Why are they named so? BTL1 Remembering
17 What bit must be complemented to change an ASCII letter from capital to BTL1 Remembering

www.AUNewsBlog.net
www.AUNewsBlog.net

lower case and vice versa?


18 Express the following Boolean expression in to minimum number of BTL5 Evaluating
literals. XYZ+X'Y+XYZ'.
19 What are the limitations of K-map? BTL1 Remembering
20 Analyse the following Boolean functions using three variable maps. BTL4 Analyzing
F(X,Y,Z) = ∑(0,2,3,6,7).
PART-B
Q.no Question Mark BTL Competence
1 Simplify the following switching function using Quine Mc Cluskey 13 BTL3 Applying
method and realize expression using gates F(A,B,C,D) =
∑(0,5,7,8,9,10,11,14,15)
2 Simplify the following switching function using karnaugh map 13 BTL2 Understanding
method and realize expression using gates F(A,B,C,D) =
∑(0,3,5,7,8,9,10,12,15)
3 Simplify the function F(w,x,y,z)=∑m(2,3,12,13,14,15) using 13 BTL4 Analyzing
Tabulation method. Implement the simplified function using gates.
4(a) Simplify the Boolean function in Sum of Products(SOP) and Product 08 BTL4 Analyzing
of Sum(POS) F(w,x,y,z)=∑m(0,1,2,5,8,9,10).
4(b) Design the Boolean function in Karnaugh map and simplify it 05 BTL6 Creating
F(w,x,y,z)=∑m(0,1,2,4,5,6,8,9,12,13,14).
5 Simplify the following Boolean expression in (a) Sum of Product (b) 06+07 BTL4 Analyzing
Product of Sum using Karnaugh map
AC' + B'D + A'CD + ABCD.
6(a) Express the following function in sum of min-terms and product of 06 BTL2 Understanding
max-terms : F(x,y,z)=x+yz.
6(b) Convert the following logic system in to NAND gates only. 07 BTL3 Applying

7(a) Add, subtract and multiply the following numbers in binary 04 BTL1 Remembering
(110010)2 and (11101)2.
7(b) State and prove De Morgan’s theorems for 2-variables 04 BTL1 Remembering
7(c) Find dual and complement of the following Boolean expression xyz’ 05 BTL1 Remembering
+x’yz+z(xy+w)
8 Minimize the following function using Karnaugh map F(A,B,C,D) = 13 BTL4 Analyzing
∑m(0,1,2,3,4,5,6,11,12,13)
9 Minimize the expression using K-map and Quine Mccluskey method 13 BTL2 Understanding
Y= A’BC’D + A’BC’D+ABC’D’+ABC’D’+AB’C’D+A’B’CD’
10(a) Implement the following Boolean function with NAND-NAND logic 07 BTL6 Creating
F(A,B,C)= ∑M(0,1,3,5)
10(b) Define prime implicate and essential prime implicate. 04 BTL1 Remembering

www.AUNewsBlog.net
www.AUNewsBlog.net

10(c) Convert (78.5) 10 into binary 02 BTL3 Applying


11 Explain the rules for Binary Addition and Subtraction using 1's & 13 BTL5 Evaluating
2’s complement. Give examples.
12 Explain about common postulates used to formulate various algebraic 13 BTL1 Remembering
structures.
13(a) Explain the procedure for obtaining NAND- NAND circuit for any 06 BTL5 Evaluating
AND-OR network with a suitable example.
13(b) Implement Y= (A'B+AB') (C+D') using NOR gates. 07 BTL3 Applying
14(a) Explain the procedure for obtaining NOR- NOR circuit for any 06 BTL5 Evaluating
AND-OR network with a suitable example.
14(b) Simplify the given Boolean function in POS form using k-map and 07 BTL4 Analyzing
draw the logic diagram using NOR gates.
F(A,B,C,D) =ΠM(0,1,4,7,8,10,12,15)+d(2,6,11,14)
PART-C
Q.no Question Mark BTL Competence
1 Minimize the expression using Quine Mc Cluskey method 15 BTL5 Evaluating
F=∑m(0,1,9,15,24,29,30) + ∑d(8,11,31) (OR) Reduce the expression
using tabulation method 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)
2 Express the following function in a simplified manner using K map 15 BTL6 Creating
technique (i) G=πM(0,1,3,7,9,11).
(ii) f(W,X,Y,Z)=∑m(0,7,8,9,10,12) + ∑d(2,5,13).
3 Simplify the following function using five variable map: 15 BTL5 Evaluating
F(A,B,C,D,E)=A’B’CE’+B’C’D’E’+A’B’D’+B’C’D’+A’CD+A’BD
4 Simplify the following expression 15 BTL5 Evaluating
Y= m1+m3+m4+m7+m8+m9+m10+m11+m12+m14 using Quine Mc
Cluskey method & K map technique
UNIT II - COMBINATIONAL LOGIC
Combinational Circuits – Analysis and Design Procedures - Binary Adder-Subtractor - Decimal Adder - Binary
Multiplier - Magnitude Comparator - Decoders – Encoders – Multiplexers - Introduction to HDL – HDL Models of
Combinational circuits.
PART-A
Q.no Question BTL Competence
1 Implement (solve) the function G=∑m (0, 3) using a 2x4 decoder. BTL6 Creating
2 Draw (design) the circuit diagram for 2 to 1 line multiplexer. BTL3 Applying
3 Implement(solve) the following Boolean function using 8:1 multiplexer BTL5 Evaluating
F(A,B,C)=∑M(1,3,5,6).
4 What is priority encoder? BTL1 Remembering
5 Implement (solve) a full adder with 4x1 multiplexer. BTL6 Creating
6 Write the Data flow description of a 4 bit comparator. BTL2 Understanding
7 What is half adder?. Draw the truth table of half adder BTL1 Remembering
8 Write short notes on propagation delay BTL2 Understanding

www.AUNewsBlog.net
www.AUNewsBlog.net

9 Define combinational circuits BTL1 Remembering


10 Differentiate between Multiplexer and Demultiplexer. BTL4 Analyzing
11 State the differentiate between decoder and demultiplexer. BTL4 Analyzing
12 Obtain the truth table for BCD to Excess-3 code converter BTL1 Remembering
13 Draw the truth table and circuit diagram of 4 to 2 encoder. BTL3 Applying
14 Write any two advantages of HDL. BTL2 Understanding
15 Write the HDL data flow description of 4 bit adder BTL2 Understanding
16 Differentiate between encoder and decoder. BTL4 Analyzing
17 List out the application of multiplexer. BTL1 Remembering
18 Determine the HDL description for the following circuit BTL5 Evaluating

19 Draw the full adder circuit as a collection of two half adders. BTL3 Applying
20 List the truth table of full subtractor. BTL1 Remembering

PART-B
Q.no Question Mark BTL Competence
1 Describe the process involved in converting 8421 code to Excess 3 13 BTL2 Understanding
code with neat sketch. (OR) Design a code converter that converts a
8421 to BCD Code
2(a) Examine the following Boolean function using 8 to 1 Multiplexer. 06 BTL4 Analyzing
F(A,B,C,D)=A’BD’ + ACD + B'CD + A'C'D.
2(b) Discover the above function using 16 to 1 Multiplexer. 07 BTL4 Analyzing
3 Describe the procedure of converting 8421 to Gray code converter 13 BTL2 Understanding
also realize the converter using only NAND gates.
4 Design 2-bit magnitude comparator and write a verilog HDL code. 13 BTL6 Creating
5(a) Examine the following Boolean functions with a multiplexer. 06 BTL4 Analyzing
F(w,x,y,z) = ∑ (2,3,5,6,11,14,15)
5(b) Construct a 5 to 32 line decoder using 3 to 8 line decoders and 2 to 4 07 BTL3 Applying
line decoder.
6(a) Explain the Analysis procedure. Analyze the following logic 06 BTL5 Evaluating
diagram.

www.AUNewsBlog.net
www.AUNewsBlog.net

6(b) With neat diagram explain the 4 bit adder with Carry look ahead. 07 BTL5 Evaluating
7 Design Full subtractor and derive expression for difference and 13 BTL6 Creating
borrow. Realize using gates.
8 Design the full adder with inputs x,y,z and two outputs S and C. The 13 BTL6 Creating
circuits perform x+y+z is the input carry, C is the output carry and S
is the Sum & realize it’s using only NOR gates
9 Design a logic circuit that accepts a 4-bit gray code and converts it to 13 BTL6 Creating
4-bit binary code
10(a) Design a 2 bit binary multiplier to multiply two binary numbers and 06 BTL1 Remembering
produce a 4-bit result.
10(b) Construct a 4-bit odd parity generator circuit using gates 07 BTL3 Applying
11 Recall the design procedure for a combinational circuit to perform 13 BTL1 Remembering
BCD addition.
12 Define priority encoder and design 8 to 3 priority encoder 13 BTL1 Remembering
13(a) Explain the design procedure for combinational circuits with suitable 07 BTL5 Evaluating
examples
13(b) Construct 16X1 multiplexer with two 8X1 and 2X1 multiplexer. Use 06 BTL3 Applying
Block diagrams
14(a) Write the HDL gate level description of the priority encoder circuit. 07 BTL2 Understanding
14(b) Find the design procedure for a 4 –bit parallel binary adder / 06 BTL1 Remembering
subtractor.

PART-C
Q.no Question Mark BTL Competence
1 How to design a 4 bit magnitude comparator with 3 outputs 15 BTL2 Understanding
A>B,A=B,A<B
2a Implement the following function using 8 to 1 multiplexer f(a,b,c,d)= 08 BTL5 Evaluating
∑m(0,1,3,5,9,12,14,15)
2b Implement the following function using multiplexer f(a,b,c,d)= 07 BTL5 Evaluating
∑m(0,1,3,4,8,9,15)
3 Design a binary to gray code converter circuit & a BCD to 7- Segment 15 BTL6 Creating
code converter circuit
4 Find the design procedure for binary multiplier 15 BTL6 Creating

www.AUNewsBlog.net
www.AUNewsBlog.net

UNIT III - SYNCHRONOUS SEQUENTIAL LOGIC


Sequential Circuits - Storage Elements: Latches , Flip-Flops - Analysis of Clocked Sequential Circuits - State
Reduction and Assignment - Design Procedure - Registers and Counters - HDL Models of Sequential Circuits.
PART-A
Q.no Question BTL Competence
1 Summarize the characteristic table and equation of JK flip flop. (OR) State the BTL2 Understanding
excitation table of JK-flip flop
2 Write any two application of shift register. BTL2 Understanding
3 With reference to a JK flip flop what is racing? BTL1 Remembering
4 Identify how many JK- flip-flops are required to design a MOD 35 counter? BTL3 Applying
5 What are the significances of state assignment? BTL1 Remembering
6 How many states are there in a 3-bit ring counter? what are they? BTL5 Evaluating
7 Give block diagram of Master -Slave D Flip flop BTL1 Remembering
8 Draw the diagram of T- Flip flop and discuss its working. BTL3 Applying
9 Classify the shift registers. (OR) What is shift register ? BTL4 Analyzing
10 Analyze how many flip-flops are required to design a synchronous MOD 60 BTL4 Analyzing
counter?
11 Develop the HDL code to realize a D - flip flop BTL6 Creating
12 State the rules for state assignment BTL1 Remembering
13 Realize a JK flip flop using D flip flop. BTL3 Applying
14 Write down the steps involved in the design of synchronous sequential BTL2 Understanding
circuits.
15 Recall the Characteristics equation of JK-flip flop (OR) Characteristics BTL1 Remembering
equation of JK-flip flop SR flip flop
16 Explain the difference between the performance of asynchronous and BTL5 Evaluating
synchronous counter
17 Differentiate between latch and flip flop. BTL4 Analyzing
18 Define Ripple counter ( OR) What is ring counter? BTL1 Remembering
19 Select and list any two mechanisms to achieve edge triggering of flip flop BTL2 Understanding
20 Design a 4 bit binary synchronous counter with D flip flops. BTL6 Creating
PART-B
Q.no Question Mark BTL Competence
1 Implement T flip-flop using D flip-flop and JK using D flip flop. 13 BTL5 Evaluating
2 Design a synchronous counter with the following sequence: 0,1,3,7,6,4 13 BTL6 Creating
and repeats. Use JK Flip flop.

www.AUNewsBlog.net
www.AUNewsBlog.net

3 Design a MOD-10 Synchronous counter using JK flip-flop. Write 13 BTL6 Creating


execution table and state table. (OR) Design MOD 6 counter circuit.
4(a) How a race condition can be avoided in a flip-flop. 06 BTL1 Remembering
4(b) Realize the sequential circuit for the state diagram shown below. 07 BTL4 Analyzing

a/0

X=1 X=0,X=1

c/1 b/0
X=0

X=0,X=1

5a Analyse the difference between a state table, characteristic table and 06 BTL4 Analyzing
an excitation table.
5b Write the HDL code for up-down counter using behavioural model. 07 BTL3 Applying
6 Consider the design of a 4 bit BCD counter that counts in the following 13 BTL3 Applying
way: 0000 , 0010 , 0011 , ………. , 1001 , and back to 0000.
(i) Draw the state diagram.(04)
(ii) List the next state table. (04)
(iii) Draw the logic diagram of the circuit.(05)
7 Design a sequence detector to detect the input sequence 13 BTL6 Creating
101(overlapping ).Use JK Flip flops.
8 Write the design procedure for a three bit synchronous counter with T 13 BTL1 Remembering
flip flop and draw the diagram.
9 Design the sequential circuit specified by the following state diagram 13 BTL6 Creating
using T flip flops

10(a) Write the design procedure for a 3-bit synchronous up counter using JK 06 BTL1 Remembering
flip flop and draw the diagram.
10(b) Write the design procedure for 3 bit parallel- in serial-out shift register 07 BTL1 Remembering

www.AUNewsBlog.net
www.AUNewsBlog.net

and write the HDL code to realize it.


11 Illustrate a serial adder using a full adder and a flip flop 13 BTL2 Understanding
12 Explain the operation of master slave flip flop and show how the race 13 BTL5 Evaluating
around condition is eliminated in it.
13 Write the HDL description of T flip-flop , JK flip-flop ,SR flip flop and 13 BTL2 Understanding
D flip-flops.
14(a) Draw the block diagram of Johnson counter and explain. 06 BTL5 Evaluating
14(b) Explain the different types of shift registers with neat diagram. 07 BTL2 Understanding

PART-C
Q.no Question Mark BTL Competence
1 Design a synchronous counter which counts in the sequence 15 BTL6 Creating
000,001,010,011,100,101,110,111,000 using D flip-flop.
2 A sequential circuit with two D flip-flops A and B, one input x , and one 15 BTL5 Evaluating
output z is specified by the following next state and output equations:
A(t+1) = A'+B, B(t+1)=B'X, Z =A+B'
(i)Draw the logic diagram of the circuit. (05)
(ii)Derive the state table. (05)
(iii)Draw the state diagram of the circuit.(05)
3 Design sequence detector that detects a sequence of three or more 15 BTL6 Creating
consecutive 1’s in a string of bits coming through an input line and
produces an output whenever this sequence is detected.
4 Analyze and design a sequential circuit with two T Flip flop A and B, 15 BTL6 Creating
one input x and one output z is specified by the following next state and
output equation is
A(t+1)= BX’+B’X
B(t+1)=AB+BX+AX
Z=AX’+A’B’X
(i)Draw the logic diagram of the circuit. (ii) List the state table for the
sequential circuit (iii) Draw the Corresponding state diagram.

UNIT IV- ASYNCHRONOUS SEQUENTIAL LOGIC


Analysis and Design of Asynchronous Sequential Circuits – Reduction of State and Flow Tables – Race-free State
Assignment – Hazards.
PART-A
Q.no Question BTL Competence
1 Define race around conditions. BTL1 Remembering
2 Define hazards. What are the types of hazards? BTL1 Remembering
3 Define Merger graph. BTL1 Remembering

www.AUNewsBlog.net
www.AUNewsBlog.net

4 How the Moore circuit differ from Mealy circuit? BTL1 Remembering
5 Define flow table in asynchronous sequential circuits BTL1 Remembering
6 Compare asynchronous and synchronous sequential circuit. BTL3 Applying
7 What are race? BTL2 Understanding
8 Compare the critical race and non critical race BTL3 Applying
9 What is lockout? How it is avoided? BTL2 Understanding
10 Estimate the wave forms showing static 1 hazards (OR) Write short notes BTL6 Creating
on Static -1 hazards.
11 List the characteristics of fundamental mode circuit. BTL2 Understanding
12 Define primitive flow table BTL2 Understanding
13 Show the diagram for debounce circuit. BTL3 Applying
14 Distinguish between fundamental mode circuit and pulse mode circuit. BTL4 Analyzing
15 Point out the steps involved in the designing an asynchronous sequential BTL1 Remembering
circuits.
16 How can we change the hazards into hazards free circuit? BTL5 Evaluating
17 Differentiate transition table and flow table. BTL4 Analyzing
18 Compare static and dynamic hazards. BTL4 Analyzing
19 Is it essential to have race free assignment? Justify. BTL5 Evaluating
20 Differentiate conventional flow table and primitive flow table. BTL4 Analyzing

PART-B
Q.no Question Mark BTL Competence
1 Explain the steps for the design of asynchronous sequential circuits 13 BTL5 Evaluating
with an example.
2 Construct the switching function F=∑m(1,3,5,7,8,9,14,15) by a static 13 BTL3 Applying
hazard free two level AND-OR gate network.
3 What are hazards and its types? How can you design a hazard free 13 BTL1 Remembering
circuits, explain with example.
4 Analyze the following clocked sequential circuit and obtain the state 13 BTL4 Analyzing
equation and state diagram.

www.AUNewsBlog.net
www.AUNewsBlog.net

5(a) Describe the race free state assignment procedure. 06 BTL1 Remembering
5(b) Reduce the number of state in the following state diagram. Tabulate 07 BTL3 Applying
the reduced state and draw the reduced diagram.
Present state Next state Output
x=0 x=1 x=0 x=1
a a b 0 0
b c d 0 0
c a d 0 0
d e f 0 1
e a f 0 1
f g f 0 1
g a f 0 1
6 Explain the hazards in combinational circuit and sequential circuit 13 BTL2 Understanding
and also demonstrate a hazards and its removal with example.
7 Discuss about Pulse mode & Fundamental mode asynchronous 13 BTL6 Creating
sequential circuits
8 Discuss in detail the procedure for reducing the flow table with an 13 BTL6 Creating
example.
9(a) Explain the two types of asynchronous sequential circuit with 06 BTL2 Understanding
suitable example.
9(b) What is flow table? Explain with suitable example. 07 BTL1 Remembering
10(a) What is the objective of state assignment in asynchronous circuit? 06 BTL1 Remembering
Explain how race to be avoided with an example.
10(b) Summarize about static, dynamic and essential hazards in 07 BTL2 Understanding
asynchronous sequential circuits
11 Consider the asynchronous sequential circuits which is driven by the 13 BTL4 Analyzing

www.AUNewsBlog.net
www.AUNewsBlog.net

pulses, as in the following figure. Analyse the circuit

12 Analyze the fundamental mode asynchronous sequential circuit given 13 BTL4 Analyzing
in the following figure.

13 Explain with a neat example for minimization of primitive flow 13 BTL4 Analyzing
table.
14 Design a circuit with inputs A and B to give an output Z=1 when 13 BTL6 Creating
AB=11 but only if A becomes 1before B, by drawing total state
diagram, primitive flow table and output map in which transient state
is included.
PART-C
Q.no Question Mark BTL Competence
1 An asynchronous sequential circuit is described by the following 15 BTL5 Evaluating
excitation and output function. Y=X1X2+(X2+X3)Y and Z=Y
i. Draw the logic diagram of the circuit. (06)
ii. Derive the transition table and output map.(06)
iii. Describer the behaviour of the circuit.(03)
2 Design an asynchronous sequential circuit with inputs X1 and X2 and 15 BTL6 Creating
one output Z. Initially and at any time if both the inputs are 0, output is

www.AUNewsBlog.net
www.AUNewsBlog.net

equal to 0.When X1 or X2 becomes 1, Z becomes 1. When Second input


also becomes 1, Z=0; The output stays at 0 until circuit goes back to
initial state.
3 An asynchronous sequential circuit is described by the following 15 BTL5 Evaluating
excitation and output function. X = (Y1Z1'W2)X + (Y1'Z1 W2') & S = X'
(i) Draw the logic diagram of the circuit. (06)
(ii) Derive the transition table and output map.(06)
(iii) Describe the behavior of the circuit. (03)
4 Design an asynchronous sequential circuit with two input x and y and 15 BTL6 Creating
with one output z whenever y is 1, input x is transferred to z. When y is
0, the output does not change for any change in x. Use SR latch for
implementation of the circuit.

UNIT V - MEMORY AND PROGRAMMABLE LOGIC


RAM – Memory Decoding – Error Detection and Correction - ROM - Programmable Logic Array – Programmable
Array Logic – Sequential Programmable Devices.
PART-A
Q.no Question BTL Competence
1 What is memory decoding? BTL1 Remembering
2 Define ASIC. BTL1 Remembering
3 Justify whether PAL is same as PLA. BTL5 Evaluating
4 What is volatile memory? Give example. BTL1 Remembering
5 Differentiate between EEPROM and PROM. BTL4 Analyzing
6 How to detect double error and correct single error? BTL1 Remembering
7 What is memory address register? BTL1 Remembering
8 Write short notes on PLA. BTL2 Understanding
9 A seven bit hamming code is received as 1111110. What is the correct code? BTL1 Remembering
10 List the types of memories. BTL2 Understanding
11 Define combinational PLD. BTL1 Remembering
12 Compare DRAM and SRAM. BTL5 Evaluating
13 Develop the maximum range of a memory that can be accessed using 10 BTL3 Applying
address lines.
14 Identify the comparison between EPROM and PLA BTL3 Applying
15 Differentiate error detection and correction technique. BTL4 Analyzing
16 Give the details about write and read operations in RAM. BTL2 Understanding
17 Design the logic diagram of a memory cell. BTL6 Creating
18 Write down the different types of PLDs. BTL2 Understanding
19 Classify the types of RAM. BTL2 Understanding
20 Differentiate between PLA and ROM. BTL4 Analyzing

www.AUNewsBlog.net
www.AUNewsBlog.net

PART-B
Q.no Question Mark BT L Competence
1 Implement the following function using PLA A(X,Y,Z)=∑m(1,2,4,6), 13 BTL5 Evaluating
B(X,Y,Z)=∑m(0,1,6,7),
C(X,Y,Z)=∑m(2,6)
2 Explain in detail about the Programmable Logic Array & Programmable 13 BTL1 Remembering
array logic.
3 Design a BCD to Excess 3 code converter and implement using suitable 13 BTL6 Creating
PLA.
4 Recall the concept of working and application of semiconductor 13 BTL1 Remembering
memories.
5(a) Write short notes on Address Multiplexing. 06 BTL2 Understanding
5(b) Briefly discuss the sequential programmable devices. 07 BTL2 Understanding
6(a) Implement the following Two Boolean function with a PLA 06 BTL5 Evaluating
F1=AB'+AC'+A'BC' F2=(AC+BC+AB)'
6(b) Give the Internal block diagram of 4 x 4 RAM. 07 BTL2 Understanding
7 Implement the following using PAL F1(A,B,C)= ∑(1,2,4,6); F2(A,B,C) 13 BTL5 Evaluating
=∑(0,1,6,7) ; F3(A,B,C)= ∑(1,2,3,5,7)
8 Design a combinational circuit using ROM that accepts a three bit 13 BTL6 Creating
binary number and outputs a binary number equal to the square of the
input number.
9 Draw a neat sketch showing implementation of Z1= ab’d’e + 13 BTL3 Applying
a’b’c’e+bc+de, Z2= a’c’e, Z3=bc+de+c’d’e+db and Z4=a’c’e +ce
using 5*8*4 PLA.
10(a) How to implement the two following Boolean functions using 8X2 06 BTL1 Remembering
PROM
10(b) Construct the following two Boolean functions using PLA with 3 inputs, 07 BTL3 Applying
4 Product terms, and 2 outputs. F1=∑m(3,5,6,7) and F2=∑m(1,2,3,4)
11 Implement the following using PAL 13 BTL5 Evaluating
W(A,B,C,D) = ∑(0,2,6,7,8,9,12,13);
X(A,B,C,D) =∑(0,2,6,7,8,9,12,13,14) ;
Y(A,B,C,D) = ∑(2,3,8,9,10,12,13);
Z(A,B,C,D)= ∑(1,3,4,6,9,12,14);
12 List the features of PROM, PAL and PLA & Discuss the sequential 13 BTL1 Remembering
programmable devices
13(a) Compare PROM, PLA, PAL 07 BTL4 Analyzing
13(b) Compare SRAM and DRAM. 06 BTL4 Analyzing
14 Discuss the various types of RAM and ROM with architecture. 13 BTL2 Understanding
PART-C
1 Design the following Boolean function using 8X2 PROM. 15 BTL6 Creating
F1=∑m(3,5,6,7) F2=∑m(1,2,3,4)
2 Design a 16 bit RAM array (4X4 RAM) and explain the operation. 15 BTL6 Creating
3 Explain about error detection and correction using 15 BTL5 Evaluating
Hamming codes.
4 The following message have been coded in the even parity hamming 15 BTL5 Evaluating
code and transmitted through a noisy channel. Decode the message
assuming that at most a single error occurred in each codeword.
i) 1001001 (04) ii) 0111001 (04)
iii) 1110110 (04) iv) 0011011 (03)

www.AUNewsBlog.net

You might also like