Scribd
Upload
42 views12 pages

EE112-Tutorials Tutorial 1 Number Systems, Boolean Algebra, Logic Gates, K-MAP

The document provides solutions to 11 tutorial problems related to digital logic design concepts including: 1) Converting between number systems such as binary and hexadecimal 2) Solving Boolean algebra equations by applying rules and identities 3) Deriving truth tables and minimal sums-of-products expressions using Karnaugh maps 4) Writing Boolean expressions for combinational logic circuits such as a 3-bit binary square calculator and a 3-input decoder

Uploaded by

diti sanghai
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
Download as pdf or txt
42 views12 pages

EE112-Tutorials Tutorial 1 Number Systems, Boolean Algebra, Logic Gates, K-MAP

The document provides solutions to 11 tutorial problems related to digital logic design concepts including: 1) Converting between number systems such as binary and hexadecimal 2) Solving Boolean algebra equations by applying rules and identities 3) Deriving truth tables and minimal sums-of-products expressions using Karnaugh maps 4) Writing Boolean expressions for combinational logic circuits such as a 3-bit binary square calculator and a 3-input decoder

Uploaded by

diti sanghai
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
Download as pdf or txt
Download as pdf or txt
You are on page 1/ 12

EE112-Tutorials

Tutorial 1

Number systems, Boolean


Algebra, Logic gates, K-
MAP
1. Convert 672810 to binary.

Solution:
Divide the no by 2 and keep the reminders
or
Here for convenience Convert to Hexadecimal (base
16), by repeated division of 16 and then to binary.
Answer : (1A48)16
2. Base ‘r’: What is the value of r if (222)r=(116)7

Solution:
Convert both sides to base 10 and form quadratic
equation :
2xr2+2xr+2=1x72+1x7+6, solve for r , r = 5.
3. Convert the following BCD numbers to decimal
a. (1011001)BCD
b. (110111010)BCD

Solution:
Verify whether the given number is valid BCD number
or Not
a. ( 101 1001 )BCD=( 5 9 )10
b. (1 1011 1010)BCD----------Invalid BCD
4. Solve the given arithmetic operation
5. If A , C and D are Boolean Variables ,
Simplify: (A + C)(AD + AD’) + AC + C using rules of Boolean Algebra.

Solution:-

(A + C)(AD + AD’) + AC + C Original Expression


(A + C)A(D + D’) + AC + C Distributive
(A + C)A + AC + C Complementary
A((A + C) + C) + C Commutative, Distributive.
A(A + C + C) + C Associative
A(A + C) + C Idempotent.
AA + AC + C Distributive.
A + (A + 1)C Idempotent, Identity, Distributive.
A+C Identity
6. Drive XOR from NAND gates only
K-three
7. For the Map variable SOP expression: F(A,B,C)=Ʃm(0,1,2,3,6,7)
Draw the truth table and derive the minimal by K-Map
.

Solution: Truth Table. K-Map

Inputs Output
A B C Q
0 0 0 1 B
0 0 1 1
0 1 0 1
0 1 1 1
1 0 0 0
1 0 1 0
1
1
1
1
0
1
1
1
A B
8. For the four variable SOP expression: F(P,Q,R,S)=Ʃm(0,1,2,3,8,10,13)
K- Map
Derive the minimal by K-Map
.

Solution
P’Q’

F = P’Q’ + Q’S’ + PQR’S


Q’S’

PQR’S
9. Ques. Convert the SOP expression to an equivalent POS
expression:
A’B’C’ + A’BC’ + A’BC + AB’C + ABC

Solution : The evaluation is as follows: 000 + 010 + 011 + 101 + 111


There are 8 possible combinations. The SOP expression contains five of
these, so the POS must contain the other 3 which are: 001, 100, and 110
= (A+B+C’)(A’+B+C)(A’+B’+C)
10. Figure shows a combinational circuit that accepts a 3-bit number as input and generates an
output binary number equal to square of the input number. Write Boolean expression for each
output
11. For the given decoder circuit determine the Boolean expression for output in terms of input
variables (A,B,C).

Solution:-
If C is LSB then expression for Y= ∑ (4,6)
Y=AB’C’+ABC’
Simplified expression Y = AC’
Though C is fixed to ground Y is 1 if Ais 1

You might also like