# Welcome back

## Find a book, put up your feet, stay awhile

Sign in with Facebook

Sorry, we are unable to log you in via Facebook at this time. Please try again later.

or

Welcome to Scribd. Sign in or start your free trial to enjoy unlimited e-books, audiobooks & documents.Find out more

Download

Standard view

Full view

of .

Look up keyword

Like this

Share on social networks

19Activity

×

0 of .

Results for: No results containing your search query

P. 1

r059210504 Digital Logic DesignRatings:

4.0

(1)|Views: 2,966|Likes: 22Published by prakash.paruchuri

JNTU OLD QUESTION PAPERS

2 B.TECH 1 SEM CSE

2 B.TECH 1 SEM CSE

JNTU OLD QUESTION PAPERS

2 B.TECH 1 SEM CSE

2 B.TECH 1 SEM CSE

See more

See less

https://www.scribd.com/doc/2079496/r059210504-Digital-Logic-Design

11/11/2011

text

original

Code No: R059210504

Set No. 1

II B.Tech I Semester Regular Examinations, November 2007DIGITAL LOGIC DESIGN( Common to Computer Science & Engineering, Information Technologyand Computer Science & Systems Engineering)Time: 3 hours Max Marks: 80Answer any FIVE QuestionsAll Questions carry equal marks

⋆⋆⋆⋆⋆

1. (a) Perform subtraction with the following unsigned decimal numbers by taking10’s complement of the subtrahend. Verify the result. [3+3+3+3]i. 5250 - 1321ii. 1753 - 8640iii. 20 - 100iv. 1200 - 250(b) Convert the given gray code number to equivalent binary1001001011110010 [4]2. (a) Draw the logic diagram corresponding to following expressions without sim-plifying them.i. (A + B) (C + D) ( A’ + B + D)ii. (AB + A’B’)(CD’ + C’D)(b) Obtain the complement of the following Boolean expressions. [8+8]i. x’yz + x’yz’ + xy’z’ + xy’zii. x’yz + xy’z’ + xyz + xyz’iii. x’z + x’y + xy’z + yziv. x’y?z’ + x’yz’ + xy’z’ + xy’z + xyz’.3. (a) Show that

A

⊕

B

= (

A

+

B

)+

A

+

B

and draw the circuit implementationtwo-level NOR-NOR form and NAND-AND form.(b) Obtain minimal POS expression for the given Boolean function

f

(

A,B,C,D

) =

0

,

1

,

2

,

3

,

4

,

8

,

9

,

12 And draw the circuits with two ?levelNOR-NOR form and AND- OR form. [8+8]4. (a) Implement 64

×

1 multiplexer with four 16

×

1 and one 4

×

1 multiplexer.(Use only block diagram).(b) A combinational logic circuit is deﬁned by the following Boolean functions.

F

1

=

ABC

+

AC F

2

=

ABC

+

ABF

3

=

ABC

+

AB

Design the circuit with a decoder and external gates. [8+8]5. (a) Draw the circuit diagram of clocked D- ﬂip-ﬂop with NAND gates and explainits operation using truth table. Give its timing diagram.1 of 2

Code No: R059210504

Set No. 1

(b) Explain the procedure for the design of sequential circuits with example. [8+8]6. (a) Write the HDL structural description of the 4- bit binary counter with parallelload.(b) Design a 4-bit ring counter using D- ﬂip ﬂops and draw the circuit diagramand timing diagrams. [8+8]7. Tabulate the PLA programming table for the four Boolean functions:A(x,y,z) = Σ ( 1,2,4,6)B(x,y,z) = Σ ( 0,1,6,7)C(x,y,z) = Σ ( 2,6)D(x,y,z) = Σ ( 1,2,3,5,7)Minimize the number of product terms and also show the internal logic in the PLAstructure. [16]8. (a) Give the implementation procedure for a SR Latch using NOR gates.(b) An asynchronous sequential circuit is described by the excitation and outputfunctions.Y =

x

1

x

′

2

+ (

x

1

+

x

′

2

)yZ = yImplement the circuit deﬁned above with a NOR SR latch. Repeat with aNAND SR latch. [6+10]

⋆⋆⋆⋆⋆

2 of 2

Code No: R059210504

Set No. 2

II B.Tech I Semester Regular Examinations, November 2007DIGITAL LOGIC DESIGN( Common to Computer Science & Engineering, Information Technologyand Computer Science & Systems Engineering)Time: 3 hours Max Marks: 80Answer any FIVE QuestionsAll Questions carry equal marks

⋆⋆⋆⋆⋆

1. (a) Perform the following using BCD arithmetic. [4+4]i. 7129

10

+ 7711

10

ii. 8124

10

+ 8127

10

(b) Convert the following:i.

AB

16

= ( )

10

ii. 1234

8

= ( )

10

iii. 10110011

2

= ( )

10

iv. 772

10

= ( )

16

[2+2+2+2]2. (a) Simplify the following Boolean functions.i. x”yz + x’yz’ + xy’z’ + xy’zii. x’yz + xy’z’ + xyz + xyz’iii. x’z + x’y + xy’z + yziv. x’y’z’ + x’yz’ + xy’z’ + xy’z + xyz’.(b) Obtain the complement of the following Boolean expressions. [8+8]i. A’C’ + ABC + AC’ii. (x’y’ + z)’ + z + xy + wziii. A’B(D’ + C’D) + B(A +A’CD)iv. (A’ + C)(A’ + C’)(A + B + C’D).3. (a) Implement the following Boolean function F using no more than two NOR -gates and draw the circuit.

F

(

A,B,C,D

) =

(0

,

1

,

2

,

9

,

11) +

d

(8

,

10

,

14

,

15)(b) Implement the following Boolean function using two - level forms: [6+10]i. NAND - ANDii. AND - NORiii. OR - NAND andiv. NOR - OR and draw the circuits.

F

(

A,B,C,D

) = Π5

,

7

,

9

,

11

,

12

,

13

,

14

,

154. (a) Using K-map design a combinational logic circuit to obtain 2’s complementfor the given 4-bit binary number. Draw the circuit using only two inputexclusive-OR gates and 2- input OR gates. What is the output expression for5 inputs?1 of 2

You've already reviewed this. Edit your review.

1 hundred reads

1 thousand reads

Anupam Gupta liked this

roopali_hbti liked this

subash17 liked this

gowdamandavi liked this

Jojo Cansino liked this

Kartheek Bobby liked this

Neha Singh liked this

zm_butt2006 liked this

- Read and print without ads
- Download to keep your version
- Edit, email or read offline

© Copyright 2015 Scribd Inc.

Language

Choose the language in which you want to experience Scribd:

Sign in with Facebook

Sorry, we are unable to log you in via Facebook at this time. Please try again later.

or

Password Reset Email Sent

Join with Facebook

Sorry, we are unable to log you in via Facebook at this time. Please try again later.

or

By joining, you agree to our

read free for two weeks

Unlimited access to more than

one million books

one million books

Personalized recommendations

based on books you love

based on books you love

Syncing across all your devices

Join with Facebook

or Join with emailSorry, we are unable to log you in via Facebook at this time. Please try again later.

Already a member? Sign in.

By joining, you agree to our

to download

Unlimited access to more than

one million books

one million books

Personalized recommendations

based on books you love

based on books you love

Syncing across all your devices

Continue with Facebook

Sign inJoin with emailSorry, we are unable to log you in via Facebook at this time. Please try again later.

By joining, you agree to our

Are you sure?

This action might not be possible to undo. Are you sure you want to continue?

CANCEL

OK

You've been reading!

NO, THANKS

OK

scribd