Scribd
Upload
2 views3 pages

pyq unit-1

The document contains previous year university questions organized by unit from 2016 to 2024, focusing on topics related to logic gates, Boolean algebra, and K-map simplifications. Each year features various types of questions including truth tables, simplifications, and circuit design. The questions assess knowledge of fundamental concepts in digital logic design and Boolean expressions.

Uploaded by

pradeepyadav2618
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
2 views3 pages

pyq unit-1

The document contains previous year university questions organized by unit from 2016 to 2024, focusing on topics related to logic gates, Boolean algebra, and K-map simplifications. Each year features various types of questions including truth tables, simplifications, and circuit design. The questions assess knowledge of fundamental concepts in digital logic design and Boolean expressions.

Uploaded by

pradeepyadav2618
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

University Previous year Questions Unit wise

Unit-1
MAY-2016
1. What are logic gates ?Draw the Schematic block diagram of a3-input AND gate. Give its Truth table. CO1,(K3),3
2 Draw K-Map and Simplify the following Boolean Expression: CO1,(K3),7.5
Y(A,B,C,D)=∑(0,2,4,6,8,10,12,14,15)
2. Explain the various Boolean laws and simplify thefollowingBoolean expressions: CO1,(K3),15

MAY-2017
1. What is truth table? What is its significance? CO1,(K1),3
2. Why are NAND and NOR gates more popular? CO1,(K1),3
3. Using K-map method simplify the following Boolean function: CO1,(K3),7½
F(A, B, C, D)=∑m (0,2,3,6,7)+∑d (8,10,11,15)

MAY-2018
1. What are universal gates ? Explain how basic gates can be realize using NAND or NOR gates. CO1,(K2),3
2. Why are NAND and NOR gates more popular? CO1,(K2),3
3. Reduce the following Boolean expression using k-map F(P,Q,R,S)=∑(0,3,5,6,7,11,12,15) CO1,(K3),7.5
4. State and verify De Morgan’s Law in following Boolean Algebra. 7½

5. Draw the Logic circuit diagram for the Boolean Expression X.(Y΄ +Z) CO1,(K1),7.5

6. Simplify the following Boolean Expression CO1,(K3),15


MAY-2019
1. Give the truth table and symbol for X-OR logic gate. CO1,(K1),3
2. State the Boolean Distributive law. CO1,(K1),3
3. Simplify the given function using k-maps: CO1,(K1),7½
F(A,B,C,D)=∑(0,2,3,5,6,7,9,11,13,14)
4. Derive the Boolean expression for logic circuit shown below: CO1,(K3),7½

5. Discuss the various types of logic gates .Also discuss their applications. CO1,(K3),15

NOV-2021

1. Prove that NOR and NAND gates are universal gates.[,CO1,k1,7.5]


2. Simplify the expression using k map method [,CO1,k2,15]
ABC+ABC+ABC+ABC+ABC+ABC
3. What do you know about K-map?[CO1,k1,7.5]
4. State De-Morgan’s theorem of Boolean algebra and prove them. What is the physical significance of these
theorem.[ CO1,k3,22.5]
5. Design a Combinational circuit whose input is a four bit number and whose output is the 2’s compliment of the
input number.[k3,22.5]

June 2022

1. Write DE Morgan’s law.[CO1,K1,3]


2. Differentiate between combinational logic circuit and sequential circuit.[CO1,K1,3]
3. Minimize the following Boolean function using k-map
F(A,B,C,D)=∑(3,4,5,7,9,13,14,15)
4. Which gates are called universal gates and why?[CO1,k2,5]

June 2023
1. State and prove De-Morgan theorem. [CO1,k2,3]

MAY-2024

1-NAND Gate is known as Universal gate. Realize the basic gates from this universal gate.[CO1,K1]
2-.Minimize the following Boolean function using K-map-[CO1,K2,7.5]
F(A,B,C,D)=∑(0,3,6,7,9,13,14,15)
3-An AND gate has four inputs A,B,C,D and an Output Y.[CO1,K2,15]

i-write the Boolean expression and sequential diagram.

ii-When does the above gate will give high output? Draw the truth table.

iii-For Y’ write the Boolean expression and sequential diangram.

4-(a) Draw the logic circuit for the Boolean Equation

Y=[AB’(C+BD)+AB’]C.

(b)-Simplify the expression and draw logic circuit for the simplifies expression.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy