SRI MUTHUKUMARAN INSTITUTE OF TECHNOLOGY

(Approved by AICTE, accredited by NAAC and Affiliated to Anna University, Chennai)

Chikkarayapuram (Near Mangadu), Chennai- 600 069.

Department Of Electronics and Communication Engineering

Odd Semester July ’23 -Nov ‘23

YEAR: II SEM: III

EC3352/ MR3391 - DIGITAL SYSTEM DESIGN/DIGITAL ELECTRONICS &

MICROPROCESSORS
(ECE, MECHATRONICS & ROBO & AUTOMATION)

UNIT 1 - BASIC CONCEPTS

PART A
1. Convert 0.35 to equivalent hexa decimal number.

0.35x16=5.6
0.6x16=9.6
0.6x16=9.6
=0.59916
2. What is the binary output of decimal number 240?

Ans = 11110000

3.Subtract using 2s complement method: (74)10-(85)10.

(85)10=1010101
(74)10=1001010
2scomplement of1010101 is 0101011
0101011
(+)1001010
1110101
There is no carry, Answerisanegativenumber.2scomplement of
result is - 0001011.
 4. Convert (1947) 10 into equivalent Octal and Hexa decimal number.
i) 194710 to Octal - 8] 1947 ii) 194710 to Hex 16]1947
8]243-4 16]121-11
8]30-3 16]7-4
8]3-6
Ans: 36348 Ans: 74B

5. Prove the Boolean theorem x + xy=x.

x+xy=x
x+xy=x.1+xy [ x.1=x]
=x(1+y)
=x(1) [ x+1=1]
=X
6. State DeMorgan’s theorem.

(i) (A+B)’=A’.B’
(ii) (A.B)’=A’+B’

7. Mention any two applications of Demorgan’s theorem.

i) SimplificationofBooleanexpression
ii) To convert AND to OR and vice versa

8. Apply De-Morgan’s theorem to[(A+B)+C]’

=(A+B)’+C’
=A’B’+C’
9. Simplify the following Boolean expression into one literal.
W’X(Z’+YZ)+X(W+Y’Z)
=W’XZ’+W’XYZ+XW+XY’Z
=W’XZ’+XW+XY’Z+XZW (A+A’B)=A+B
=W’X(Z+Z’)+XW+XY’Z
=W’X+XW+XY’Z
=X(W+W’)+XY’Z
=X(1+ZY’)
=X
10. What are Don’t care terms?
Don't-care term is an input-sequence (a series of bits) to a function
that the designer does not care about, in that input would not result in any
changes to the output. it may also be called an X value.

11.What are the disadvantages of Karnaugh mapping technique?

i) As the number of variablesincreases it is difficult to make judgements
aboutwhich combinations from the minimum expression. In case of complex
problem with 7, 8, or even 10 variables it is almost an impossible task to
simplify expression by the mapping method.
 ii) K-maps implification is manual techniques and simplification process is
heavily depends on the human abilities

12. What is PrimeImplicant?

Primeimplicant is a product term obtained by combining the
maximum possible number of adjacent squares in the map.

13.Implement Using NAND gates only F= xyz + x’y’

14.Implement the given function using NAND gates F(x,y,z)=∑(0,6).

=xyz + x’y’z’

15.Map the standard SOP expression on a Karnaugh map:

(AB)’C+ A’BC’+ A(BC)’+ ABC.

=(A’+B’)C+A’BC’+A(B’+C’)+ABC

=A’C+B’C+A’BC’+AB’+AC’+ABC
=A’C(B+B’)+B’C(A+A’)+A’BC’+AC’(B+B’)+AB
=A’BC+A’B’C+AB’C+A’B’C+A’BC’+ABC’+AB’C’+ABC
 =A’BC+A’B’C+AB’C+A’BC’+ABC’+AB’C’+ABC
=m3+m1+m5+m2+m6+m4+m7
=∑m(1,2,3,4,5,6,7)

16.What is the gray code for 9? Represent 9 in 2421 coding?

Graycodefor 9 is 1101 and2421 code for 9 is 1111.

17.Convert (11001011)2 into gray code

(11001011)2=10101110

18. Draw the logic diagram for X=AB+B’C

19. Implement F=(AB’+A’B)(C+D’) with only NOR gate.

F=(AB’+A’B)(C+D’)
F=AB’C+A’BC+AB’D’+A’BD’
F‘=(A’+B+C’)(A+B’+C’)(A’+B+D)(A+B’+D)

20. Write the Boolean function of an XOR gate, give its truth table.
 Y=A’B+AB’
21. Find the relation between the I/Ps and O/P, shown in figure. Name
the operation performed.

A Y
B

Y=A’.B’ =(A+B)’
This gate performs the NOR operation

22. Find the complement of the following function.

F=x’yz’+x’y’z
F’= (x’yz’+x’y’z)’
=(x+y’+z).(x+y+z’).
23. Find the complement of the following function.
F=(xy+y’z+xz)x.
F’=[(xy+y’z+xz) x]’
[(x’+y’).(y+z’).(x’+z’)]+x’
24. Obtain the canonical SOP form of the function:
Y(A,B,C)=A+ABC
= A.(B+B’).(C+C’)+ABC
=(AB+AB’).(C+C’)+ABC
=ABC+ABC’+AB’C+AB’C’+ABC
=ABC+ABC’+AB’C+AB’C’
=m7+m6+ m5+m4`
25. Obtain the canonical POS expression of the functions.
Y=A+B’C
= (A+B’)(A+C)
=(A+B’+C.C’)(A+C+B.B’)
= (A+B’+C)(A+B’+C’)(A+B+C)(A+B’+C)
=(A+B’+C).(A+B’+C’).(A+B+C)
26. Perform subtraction on the following binary numbers using 2’s
complement method

i) 110112 - 110012ii) 1101002 - 101012

i) 11011+ ii) 110100 +
00111 101011
------------ --------------
1) 00010 Discard carry 1) 011111 Discard carry
Ans : 000102 Ans= 0111112
27. Verify Distributive law using truth table
( X + (Y . Z)) = (X+Y). (X+ Z)
28. Write the condition for NAND And NOR gates for getting output as 1.
NAND 0,0; 0,1; 1,0
NOR 0,0
29. Simplify the expression using K- Map .F(A,B,C)= ∑m(1,3,5,7)
A BC 00 01 11 10

0 1 1
1 1 1
F(A,B,C) = C
30. List the switching functions of 2 variables for the universal gates
NAND : (A.B)
NOR : (A+B)

PART B
1. Explain the Boolean Postulates and laws.
Fundamental postulates and laws of Boolean algebra
The most common postulates used are as below:
i) Closure:
AsetSisclosedw.r.t. a binary operator, if for every pair of elements of S, the binary
operator specifies a rule for obtaining a unique element of S. The result of each
operation with operator (+) or (.) is either 1 or 0 and 1,
 ii) Identityelement:
A set S is said to have an identity element w.r.t a binary operation*on S, if there
exists an element Eєs with the property
Identity element w.r.t + operator: 0 eg A+0= A, 0+A = A
Identity element w.r.t * operator: 1 eg. A.1= 1.A= A
iii) Commutativelaw:
Abinaryoperator+onasetSissaidtobecommutative if
A=B= B+A
Abinaryoperator*onasetSissaidtobecommutativeif,
A . B= B.A
iv) Distributivelaw:
If*and •are two binary operators on a set S is said to be distributive over+
whenever,
A+( B.C) = (A+B). ( A+C)
A.( B + C)= (A.B) +(A.C)
v) Inverse:
AsetShavingtheidentityelemente,w.r.t.binaryoperator*issaidtohavean inverse, whenever
A +A’=1, A.A’=0
2. Simplify the expression using Boolean laws

i) AB+(AC)'+AB’C(AB+C)
=AB+(AC)'+AAB'BC+AB'CC

=AB+(AC)'+0+AB'CC [B.B'=0]
=AB+(AC)'+AB'C [C.C=1]
=AB+A'+C'+AB'C [(AC)'=A'+C']
=AB+A’+C'+AB' [C’+AB’C=C’+AB’]
=A'+B+C’+AB’ [A’+AB=A’+B]
Rearranging
=A'+AB’+B+C' [A’+AB=A’+B]
=A'+B’+B+C' [B’+B=1]
=A'+1+C’ [A+1=1]
=1
ii) xy+xyz+xyz’+x’yz
=xy(1+z+z’)+x’yz
 =xy(1)+x’yz
=xy+x’yz
= y(x+x’z) [x+x’y=x+y]
=y( x+z).
3. Simplify the Boolean expression,
Y=A’BC’D’+A’BC’D+ABC’D’+ABC’D+AB’C’D+A’B’CD’ using Karnaugh map.
Solution

Therefore, Y=A’B’CD’+AC’D+BC’
4. Simplify the SOP using K-Map F(w,x,y,z)=∑m(0,1,2,4,5,6,8,9,12,13,14)
Solution:

Therefore,
F=y’+w’z’+xz’
 5. F(A,B,C,D,E)=∑m(0,5,6,8,9,10,11,16,20,24,25,26,27,29,31)

F(A,B,C,D,E)=C’D’E’+A’B’CD’E+A’B’CDE’+AB’D’E’+ABE+BC’

6. Mention the universal gates with neat logic symbols and truth table. Implement
AND and OR logic function using NAND and NOR gates.
The NAND and NOR gates are known as universal gates, since any logic function can be
implemented using NAND or NOR gates.

a) NANDGate:
The NAND gate can be used to generate the NOT function, the AND function
The OR function and the NOR function.
i) NOTfunction:

ii) ANDfunction:
By simply inverting output of the NAND gate. i.e
 ANDfunctionusingNANDg ates

iii) ORfunction:

ORfunctionusingNANDgates
b) NOR function
Similar to NAND gate, the NOR gate is also a universal gate, since it can be
used to generate the NOT, AND, OR and NAND functions.
i) NOT function

NOTfunctionusingNORgates

ii) AND function

BysimplyinvertinginputsoftheNORgate.i.e.,

ANDfunctionusingNORgates
iii) ORfunction:
BysimplyinvertingoutputoftheNORgate.i.e

ORfunctionusingNORgates