Scribd Logo
Upload

Welcome to Scribd!

  • 7 views

    imp_ques_CS-304-1

    Uploaded by

    jyotibh966

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    imp_ques_CS-304-1

    Uploaded by

    jyotibh966
    7 views2 pages

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    7 views2 pages

    imp_ques_CS-304-1

    Uploaded by

    jyotibh966

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    You are on page 1of 2

    SHIVAJIRAO KADAM INSTITUTE OF TECHNOLOGY AND

    MANAGEMENT-TECHNICAL CAMPUS

    Important Questions
    Digital Systems (CS-304)

    1. What is Boolean algebra? Compare it with Karnaugh map. Also simplify the following expression using
    k-map. 𝑌 = 𝐴̅𝐵̅𝐶̅ + 𝐵̅𝐶 + 𝐴̅𝐵
    2. If X = 111.101 and Y = 101.110. Calculate x + y, and x–y and y–x by 2's complement method.
    3. What are the universal Gate? Why we call them universal? Explain it with examples.
    4. What do you mean by logic gates? Describe the various types of gates.
    5. What is the weighted code? Explain any two weighted code.
    6. Given the following Boolean function: F(W,X,Y,Z)=WXꞌ(Yꞌ+Zꞌ) + Xꞌ.Zꞌ.(WꞌΘY) where Θ
    represents the XNOR operation, determine the simplified (minimal) SOP expression for F using
    Boolean algebra & implement the given function using NOR-NOR logic.
    7. Simplify the Boolean function F together with the don’t-care condition d in the following
    forms:
    i. Sum of products
    ii. Product of sums
    F(w,x,y,z)= Σ0,1,2,3,7,8,10
    d(w,x,y,z)= Σ5,6,11,15
    8. What is the difference between combinational circuit and sequential circuit?
    9. Design a combinational circuit to convert the binary input ABCD to gray code.
    10. Implement the function f A,B,C,DΣ0,1,5,7,10,14,15using 8:1multiplexer.
    11. Convert (138.32)10 to
    i. Binary
    ii. Octal
    iii. Hexadecimal
    12. What is decoder? Explain BCD to decimal decoder.
    13. Explain the addition of 10102 to 10112 using full adder step by step.
    14. Convert Decimal to Binary
    i. (1024)10
    ii. (23.25)10
    15. Explain synchronous and Asynchronous counter.
    16. Design the binary to octal decoder and explain its working using Block diagram.
    17. Design a synchronous counter to count in the random sequence 0,2,4,5,7,0,2,4,5,7 using D
    flilp-flop.
    18. Write short notes on
    i. Semiconductor memories
    ii. DRAM
    19. What is Flip-Flop? Explain Master Slave J-K flip-flop.

    Dr. Moumita Das, Associate Professor, EC, SKITM


    SHIVAJIRAO KADAM INSTITUTE OF TECHNOLOGY AND
    MANAGEMENT-TECHNICAL CAMPUS

    20. Write short notes on


    i.Schmitt trigger
    ii.Karnaugh Map
    iii.Look ahead carry generator
    21. Design a 8x1 multiplexer using one 4x1 multiplexer and four 2x1 multiplexers.
    22. What is meant by “edge triggered”? Differentiate SR-FF and JK-FF with their functional
    operation and excitation tables.
    23. Describe a 4-bit up/down synchronous binary counter, Explain with a neat timing diagram.
    24. Draw and explain astable multivibrator.
    25. A n-bit Analog to Digital Converter (ADC) is required to convert an analog input in the range
    0-5 V dc to an accuracy of 5mv. Find the value of n.
    26. With a neat diagram, explain the operation of 8 bit successive approximation ADC.
    27. Explain TTL with circuit diagram.
    28. Explain interfacing between TTL and MOS with example.
    29. Realize the function f(A,B,C,D)=π(1,4,6,10,14)+d(0,8,11,15) using
    i. 16:1 MUX
    ii. 8:1 MUX
    30. Write short notes on
    i. A/D & D/A converter
    ii. CMOS logic
    31. Design a combinational logic circuit to convert the BCD to excess -3 code.
    32. Design 3x8 decoder using 1x2 decoder and two 2x4 decoder with Enable input.
    33. Implement the following circuit using CMOS logic
    i. Y =A .B
    ii. Y = A + B
    34. Compare the BPSK & BFSK modulation schemes.
    35. Short note on: PCM, BPSK, Sampling theorem
    36. Write short note on:
    i. Shannon’s theorem for channel capacity
    ii. Nyqyist sampling theorem.
    37. With the help of block diagram explain the working of BPSK modulation scheme.
    38. What do you understand by Adder Circuit? Design and implement Full adder using 2 half
    adder & OR gate.
    39. Convert the following expression into Sum of product and Product of sums:
    Xꞌ + X(X+Yꞌ)(Y+Zꞌ)
    40. Design Half adder using NAND gates. Also draw the diagram.

    Dr. Moumita Das, Associate Professor, EC, SKITM

    You might also like

    pFad - Phonifier reborn

    Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

    Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


    Alternative Proxies:

    Alternative Proxy

    pFad Proxy

    pFad v3 Proxy

    pFad v4 Proxy