dpsd-am-2010

Upload: sara-patrick

Post on 04-Jun-2018

217 views

Category:

Documents


0 download

TRANSCRIPT

  • 8/13/2019 DPSD-AM-2010

    1/3

    Reg. No. :

    B.E./B.Tech. DEGREE EXAMINATION, APRIL/MAY 2010.

    Third Semester

    Computer Science and Engineering

    CS2202 DIGIAL PRINCIPLES AND SYSTEMS DESIGN

    (Common to Information Technology)

    (Regulation 2008)

    Time: Threehours Maximum: 100 Marks

    Answer ALL Questions

    PART A (10 2 = 20 Marks)

    1. Convert the 10)513.153( to Octal.

    2. Simplify the following Boolean functions to a minimum number of literals

    (a) ))(( yxyx ++

    (b) yzzxxy ++ .

    3. Distinguish between the combinational and sequential logic circuits.

    4. What do you mean by HDL?

    5. What is Multiplexer?

    6. Define Encoder.

    7. Differentiate Flip-Flop from Latches.

    8. Draw the excitation table and state diagram for JK and SR Flip-Flop.

    9. What is Race Conditions?

    10. What happens when a Hazard happens in a logic circuit?

    Question Paper Code:E3060

    NOTES.PMR-INSIGNIA.ORG

    NOTES.PMR-INSIGNIA.ORG

    http://notes.pmr-insignia.org/http://notes.pmr-insignia.org/http://notes.pmr-insignia.org/http://notes.pmr-insignia.org/http://notes.pmr-insignia.org/http://notes.pmr-insignia.org/http://notes.pmr-insignia.org/http://notes.pmr-insignia.org/http://notes.pmr-insignia.org/http://notes.pmr-insignia.org/http://notes.pmr-insignia.org/http://notes.pmr-insignia.org/http://notes.pmr-insignia.org/http://notes.pmr-insignia.org/http://notes.pmr-insignia.org/http://notes.pmr-insignia.org/http://notes.pmr-insignia.org/http://notes.pmr-insignia.org/http://notes.pmr-insignia.org/http://notes.pmr-insignia.org/http://notes.pmr-insignia.org/http://notes.pmr-insignia.org/http://notes.pmr-insignia.org/http://notes.pmr-insignia.org/http://notes.pmr-insignia.org/http://notes.pmr-insignia.org/http://notes.pmr-insignia.org/http://notes.pmr-insignia.org/http://notes.pmr-insignia.org/http://notes.pmr-insignia.org/http://notes.pmr-insignia.org/http://notes.pmr-insignia.org/http://notes.pmr-insignia.org/http://notes.pmr-insignia.org/http://notes.pmr-insignia.org/http://notes.pmr-insignia.org/http://notes.pmr-insignia.org/http://notes.pmr-insignia.org/
  • 8/13/2019 DPSD-AM-2010

    2/3

    E 30602

    PART B (5 16 = 80 Marks)

    11. (a) (i) Simplify the following Boolean function F together with dont-care

    condition d, and then express the simplified function in sum of

    minterms

    )5,2,0()15,11,7,3,1(),,,( dzyxwF += (10)

    (ii) Implement the following Boolean function with NAND gates.

    )7,5,4,3,2,1(),,( =zyxF (6)

    Or

    (b) Determine the prime-implicants of the Boolean function by using the

    tabulation method.

    )15,11,10,9,8,7,6,4,1(),,,( =zyxwF (16)

    12. (a) Design a combinational logic diagram for BCD to Excess-3 code

    converter. (16)

    Or

    (b) (i) Design a Full Adder circuit with necessary diagram. (10)

    (ii) Write the HDL description of the circuit specified by the following

    Boolean function. (6)

    Cy

    CABx

    =

    +=

    13. (a) (i) Design a 3 to 8-line decoder with necessary diagram. (8)

    (ii) Implement the given Boolean function using 4 1 multiplexer.

    ( )7,6,2,1),,( =zyxF (8)

    Or

    (b) We have found a minimum sum of products expression for each of two

    function, F and G, minimizing them individually (no sharing)

    ZYXYWF +=

    ZYWYXYXWG ++= .

    (i) Implement them with a ROM. (8)

    (ii) Implement them in the PLA using no more than four terms. (8)

    NOTES.PMR-INSIGNIA.ORG

    NOTES.PMR-INSIGNIA.ORG

    http://notes.pmr-insignia.org/http://notes.pmr-insignia.org/http://notes.pmr-insignia.org/http://notes.pmr-insignia.org/http://notes.pmr-insignia.org/http://notes.pmr-insignia.org/http://notes.pmr-insignia.org/http://notes.pmr-insignia.org/http://notes.pmr-insignia.org/http://notes.pmr-insignia.org/http://notes.pmr-insignia.org/http://notes.pmr-insignia.org/http://notes.pmr-insignia.org/http://notes.pmr-insignia.org/http://notes.pmr-insignia.org/http://notes.pmr-insignia.org/http://notes.pmr-insignia.org/http://notes.pmr-insignia.org/http://notes.pmr-insignia.org/http://notes.pmr-insignia.org/http://notes.pmr-insignia.org/http://notes.pmr-insignia.org/http://notes.pmr-insignia.org/http://notes.pmr-insignia.org/http://notes.pmr-insignia.org/http://notes.pmr-insignia.org/http://notes.pmr-insignia.org/http://notes.pmr-insignia.org/http://notes.pmr-insignia.org/http://notes.pmr-insignia.org/http://notes.pmr-insignia.org/http://notes.pmr-insignia.org/http://notes.pmr-insignia.org/http://notes.pmr-insignia.org/http://notes.pmr-insignia.org/http://notes.pmr-insignia.org/http://notes.pmr-insignia.org/http://notes.pmr-insignia.org/http://notes.pmr-insignia.org/http://notes.pmr-insignia.org/http://notes.pmr-insignia.org/http://notes.pmr-insignia.org/
  • 8/13/2019 DPSD-AM-2010

    3/3

    E 30603

    14. (a) Design a synchronous sequential circuit using JK flip-flop to generate the

    following sequence and repeat. (16)

    0, 1, 2, 4, 5, 6

    Or

    (b) What is the aim of state reduction? Reduce the given state diagram and

    prove that the both state diagrams are equal. (16)

    15. (a) With suitable example and diagram explain the hazards in combinational

    and sequential logic circuits. (16)

    Or

    (b) With necessary example and diagram explain the concept of reduction of

    state and flow tables. (16)

    NOTES.PMR-INSIGNIA.ORG

    NOTES.PMR-INSIGNIA.ORG

    http://notes.pmr-insignia.org/http://notes.pmr-insignia.org/http://notes.pmr-insignia.org/http://notes.pmr-insignia.org/http://notes.pmr-insignia.org/http://notes.pmr-insignia.org/http://notes.pmr-insignia.org/http://notes.pmr-insignia.org/http://notes.pmr-insignia.org/