Scribd
Upload
77 views4 pages

Unit-3 QB

Uploaded by

unofficialchandudarshini
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
77 views4 pages

Unit-3 QB

Uploaded by

unofficialchandudarshini
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/ 4

BMS COLLEGE OF ENGINEERING, BANGALORE-19

(Autonomous Institute, Affiliated to VTU)


Department of Electronics and Communication

Question Bank
Unit 3 Boolean Algebra and Logic Circuits
Part-I (Remember/Understand)

No. Question Marks


1 State and prove De Morgan’s law. 5
2 Discuss the universality of NAND and NOR gates 5
3 Write the logic symbol and truth table of Basic Gates 5
4 Explain the laws of Boolean algebra with appropriate examples 9
5 State and prove duality theorem 5
6 Write a short note on binary and hexadecimal number system. 5
7 Briefly explain the concept of combinational logic circuit. Also, list the 5
examples of these circuits
8 List the steps for the design of a generic combinational logic circuit. 5
9 Write the truth table of a half-adder. Also, implement the same using the 6
fundamental logic gates
10 Write the truth table of a full adder. Implement the same using logic 8
gates of your choice.

Part II (Apply)
No. Question Marks
1 Perform the following conversion 10
(i) (25.6)10 = ( )2 = ( )H
(ii) (7BEF)H = ( )10 = ( )2 = ( )8
(iii) (57279)10 = ( )16
2 Perform the following 10
a) (532.65)10 = ( )16
b) (250.67)16 = ( )2 = ( )10
c) (952.01)10 = ( )16 = ( )8
5 Implement the expression F=A(B+CD)+B𝐶 using 6
a) AND –OR-NOT gates.
b) Using only NOR gates
c) Using only NAND gates
6 Simplify the following Boolean expression using Boolean Laws and Realize 10
using fundamental gates
(i) 𝑓(𝑊, 𝑋, 𝑌, 𝑍) = 𝑊𝑋𝑌𝑍 + 𝑋𝑌𝑍 + 𝑋𝑌𝑍 + 𝑋𝑌𝑍
(ii) 𝑓(𝐴, 𝐵, 𝐶) = 𝐴𝐵 + 𝐴𝐵𝐶 + 𝐴𝐶 + 𝐴𝐵𝐶
7 Simplify the following Boolean expression using Boolean Laws and Realize 10
this expression with logic gates of your choice
(i) 𝑓(𝐴, 𝐵, 𝐶) = 𝐴𝐵 𝐶 + 𝐶 + 𝐵𝐶
(ii) 𝑓(𝐴, 𝐵, 𝐶) = 𝐴𝐵 + 𝐵 + 𝐶𝐴
9 Perform the following 10
i) (1A0.65)16 = ( )2 = ( )10
ii) (876.02)10= ( )16 = ( )8
10 Simplify and realize using logic gates 10
(i)𝑓(𝐴, 𝐵, 𝐶) = 𝐴𝐵 𝐶 + 𝐶 + 𝐵𝐶𝐴 + 𝐵𝐶
(ii) 𝑓(𝐴, 𝐵, 𝐶) = 𝐴𝐵 + 𝐵 + 𝐶𝐴+𝐵𝐶
11 If the variables A, B and C can take only the values 0 and 1, prove the following 10
identities of Boolean algebra
i) 𝐴𝐵𝐶 + 𝐴𝐵𝐶 + 𝐴𝐵𝐶 + 𝐴𝐵𝐶 = 𝐵𝐶 + 𝐴𝐶
ii) AB+C(𝐴⨀𝐵)= AB+BC+CA
iii) 𝑋𝑌𝑍 + 𝑋𝑌𝑍 + 𝑋𝑌𝑍 = 𝑋(𝑌 + 𝑍)
iv) 𝐴𝐵𝐶 + 𝐵𝐶𝐷 + 𝐴𝐷 = 𝐴𝐷 + 𝐵𝐶
12 Simplify the following functions 10
i)𝐹 = 𝐴𝐵 + 𝐴𝐶 + 𝐵𝐶 + 𝐴𝐵𝐶
ii)𝐹 = 𝐴𝐵𝐶 + 𝐴𝐵𝐶 + 𝐴𝐵𝐶 + 𝐴𝐵𝐶
iii)𝐹 = 𝑥𝑦' + 𝑥'𝑦'𝑧 + 𝑥𝑦𝑧'
iv) X = a'b'c' + a'bc' + a'bc + ab'c + abc'

Part III (Analyse, Design, Questions from GATE)

No. Question Marks


1 The rocket motor of an air-launched missile with three inputs (launch, Unsafe- 5
height and target-lock), will operate if and only if any two inputs are high.
Design a suitable logic circuit with minimum logic gates
2 Analyze the logic circuit shown in fig. Determine the Boolean function for y 5
and state its truth table.
3 A logic circuit has 3 inputs A, B, C and one output Y. Y=B XOR C when A=0, 5
and Y=C when A=1. Simplify the output expression and realize the same using
logic gates.
4 Design a logic circuit using minimum number of gates to implement the 5
following expression. 𝑓 (𝐴, 𝐵, 𝐶) = 𝐴 𝐵 + 𝐵 𝐶 + 𝐵𝐶 + 𝐴𝐵𝐶
5 Design a circuit that has three bit binary input and a single output(Z) specified
as follows: 5
● Z = 0 ; when the input is less than (5)10
● Z = 1 ; otherwise
6 A bank locker consists of three keys, the locker will get open if any 2 keys are 5
correctly inserted. Design a digital circuit for this scenario.
7 Analyze the given circuit to identify the logic used in the blocks B1 and B2 to obtain 5
output Y.

8 Analyze the below given logic circuit for an output Y when input C=0. Write 5
expression at each stage

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