Welcome to Scribd, the world's digital library. Read, publish, and share books and documents. See more
Download
Standard view
Full view
of .
Look up keyword
Like this
16Activity
0 of .
Results for:
No results containing your search query
P. 1
DLDA - N_08

DLDA - N_08

Ratings: (0)|Views: 749|Likes:
Published by babu
digital logic design & appliction S.E CMPN
question paper
digital logic design & appliction S.E CMPN
question paper

More info:

Published by: babu on Dec 25, 2009
Copyright:Attribution Non-commercial

Availability:

Read on Scribd mobile: iPhone, iPad and Android.
download as PDF, TXT or read online from Scribd
See more
See less

03/10/2013

pdf

text

original

 
1
 
S.E. Sem. III [CMPN]
Digital Logic Design and Applications
 Nov. '08
: Mumbai University
Examination Paper Solution
 
Time : 3hrs] [Marks : 100N.B. :
(1) Question No.
1
is
compulsory
.(2) Attempt any
four
questions out of remaining
six
questions.(3) Assume
suitable
data and state it
clearly
.
1. (a)
Convert (157.63)
8
into decimal, binary and hexadecimal system.
[4]Soln.:
(157.63)
8
 
Octal to Decimal :
 Step 1 : Get the octal no. 1 5 7 . 6 3Step 2 : Write corresponding weights 8
2
8
1
8
0
.8
1
8
2
 Step 3 : Multiple columnwise 64 40 7 . 3/4 3/16Step 4 : Add the contents of row 3 = 64 + 40 + 7 +33416
+
= (111.9375)
10
 
Octal to Binary :
 Step 1 : Get the octal no. 1 5 7 . 6 3Step 2 : Convert each digits into binary 001 101 111 . 110 011
(157.63)
8
= (001 101 111 . 110 011)
2
 
Octal to Hexadecimal :
 Step 1 : Convert into binary (0 0 1 1 0 1 1 1 1 . 1 1 0 0 1 1)Step 2 : Convert binary to hexadecimal (0 0110 1111 . 1100 11)
2
 Add three zeros on extreme left (on MSB) andAdd 2 zero on extreme right side.Binary (0000 0110 1111 . 1100 1100) group of 4 bit,Hexa number 0 6 F . C C(157.63)
8
= (6F.CC)
16
 
1. (b)
Simplify using boolean laws : ABAAB
++
.
[4]Soln.:
 Y =(ABAAB)
++
 ButAB=AB
+
… De-Morgan's first theorem
Y =(ABAAB)
+++
 But
AAA
+=
(
A + A = A)
Y =(ABAB)
++
 
Y =A.B.AB But
AAandBB
==
 
Y =A.B.AB ButAB(AB)
=+
… De-Morgan's first theorem
Y =A.B(AB)
+
=
AABABB
+
 ButAA0andBB0
==
 
Y = 0 . B + A . 0= 0 + 0 since 0 . B = 0 and A . 0 = 0
Y = 0
 
(2) S.E.
DLDA (CMPN)
 
2
 
1. (c)
Design full adder using half adders.
[4]Soln.:
 
Full Adder using Half Adder :
 The full adder circuit can be constructed using two half adders as shown in fig.1 and thedetail circuit is shown in fig.2.
Fig.1
 A full adder can be implemented using two half adders and the OR gate as shown in fig.2
Fig.2
Now let us prove that this circuit acts as a full adder.
Proof :
 Refer fig.2 and write the expression for sum output as,S = (A
B)
C
in
= A
B
C
in
 This expression is same as that obtained for the full adder.Now write the expression for carry output C
0
asC
0
= (A
B) C
in
+ ABC
0
=
in
(ABAB)CAB
++
 =
inin
ABCABCAB
++
 =
ininin
ABCABCAB(1C)
+++
 =
ininin
ABCABCABABC
+++
 =
inin
BC(AA)ABCAB
+++
 =
inin
BCABCAB
++
 =
ininin
BCABCAB(1C)
+++
 =
ininin
BCABCABABC
+++
 =
inin
BCABAC(BB)
++++
 
C
0
=
inin
BCABAC
++
 This expression is same that for a full adder. Thus we have proved that circuit shown in fig.2really behaves like a full adder.
Applications of Full Adder :
 The full adder acts as the basic building block of the 4 bit/8 bit binary/BCD adder ICs such as7483.
 
Examination Paper Solution (3)
 
3
 
1. (d)
State and prove De Morgan's theorem.
[4]Soln.:
 
De Morgan's theorem :
 The two theorems suggested by De-Morgen and which are extremely useful in Boolean algebraare as follows :Theorem 1 : ABAB
=+
: NAND = Bubbled OR This theorem states that the complement of a product is equal to addition of the complements.This rule is illustrated fig.1. The left hand side (LHS) of this theorem represents a NANDgate with inputs A and B whereas the right hand side (RHS) of the theorem represents an OR gate with inverted inputs.This OR gate is called as "Bubbled OR". Thus we can state De-Morgans first theorem as, NAND = Bubbled OR 
Fig.1 :
Illustration of De-Morgan's first theorem.This theorem can be verified by writing a truth table as shown in fig.2.Theorem 2 :ABA.B
+=
: NOR = Bubbled ANDThe LHS of this theorem represents a NOR gate with inputs A and B whereas the RHSrepresents an AND gate with inverted inputs.This AND gate is called as "Bubbled AND". Thus we can state De-Morgan's second theorem as : NOR = Bubbled AND
Fig.3 :
Illustration of De-Morgan's second theorem.This theorem can be verified by writing a truth table for both the sides of the theoremstatement. This truth table is shown in fig.4, which shows that LHS = RHS.A BABA B AB
+
 0 0 1 1 1 10 1 1 1 0 11 0 1 0 1 11 1 0 0 0 0
Fig.2
: Verification of the theoremABAB
=+
 LHS RHSABAB
++
 A BAB
+
 A B A.B 0 0 1 1 1 10 1 0 1 0 01 0 0 0 1 01 1 0 0 0 0
Fig.4
: Truth table to verify De-Morgan's theoremLHS RHSABA.B
+=
 

Activity (16)

You've already reviewed this. Edit your review.
1 hundred reads
1 thousand reads
ramanaidu1 liked this
babu liked this
Namrata Patil liked this
Osborne Saldanha liked this
Osborne Saldanha liked this
Gajendra Rajput liked this
Gajendra Rajput liked this
sidhesh liked this

You're Reading a Free Preview

Download
scribd
/*********** DO NOT ALTER ANYTHING BELOW THIS LINE ! ************/ var s_code=s.t();if(s_code)document.write(s_code)//-->