Scribd Logo
Upload

Welcome to Scribd!

  • 15 views

    DE Question Bank

    Uploaded by

    Karee Mullah
    The document contains questions related to digital logic design topics like Boolean algebra, combinational logic design, sequential circuits, number systems, codes and basics of semiconductor memories. Some of the questions ask to state principles, theorems or explain concepts while others require designing combinational or sequential logic circuits for given functions or specifications using techniques like K-map, tabulation and PLA/PLD. Questions also involve conversions between number systems, codes and arithmetic operations using binary, hexadecimal, octal, excess-3 code and binary coded decimal. Design of basic building blocks like full adder, full subtractor, multiplexer, encoder, decoder and counters is also covered.

    Copyright:

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

    DE Question Bank

    Uploaded by

    Karee Mullah
    15 views5 pages
    The document contains questions related to digital logic design topics like Boolean algebra, combinational logic design, sequential circuits, number systems, codes and basics of semiconductor memories. Some of the questions ask to state principles, theorems or explain concepts while others require designing combinational or sequential logic circuits for given functions or specifications using techniques like K-map, tabulation and PLA/PLD. Questions also involve conversions between number systems, codes and arithmetic operations using binary, hexadecimal, octal, excess-3 code and binary coded decimal. Design of basic building blocks like full adder, full subtractor, multiplexer, encoder, decoder and counters is also covered.

    Original Title

    DE question bank

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document contains questions related to digital logic design topics like Boolean algebra, combinational logic design, sequential circuits, number systems, codes and basics of semiconductor memories. Some of the questions ask to state principles, theorems or explain concepts while others require designing combinational or sequential logic circuits for given functions or specifications using techniques like K-map, tabulation and PLA/PLD. Questions also involve conversions between number systems, codes and arithmetic operations using binary, hexadecimal, octal, excess-3 code and binary coded decimal. Design of basic building blocks like full adder, full subtractor, multiplexer, encoder, decoder and counters is also covered.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    15 views5 pages

    DE Question Bank

    Uploaded by

    Karee Mullah
    The document contains questions related to digital logic design topics like Boolean algebra, combinational logic design, sequential circuits, number systems, codes and basics of semiconductor memories. Some of the questions ask to state principles, theorems or explain concepts while others require designing combinational or sequential logic circuits for given functions or specifications using techniques like K-map, tabulation and PLA/PLD. Questions also involve conversions between number systems, codes and arithmetic operations using binary, hexadecimal, octal, excess-3 code and binary coded decimal. Design of basic building blocks like full adder, full subtractor, multiplexer, encoder, decoder and counters is also covered.

    Copyright:

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

    1) State and prove Demorgans theorem

    2) State the principle of Duality with an example.


    3) State and prove
    3) Simplify
    i) Y(A,B,C)=∑m (1,3,7)
    ii)Y=∑m(1, 2, 3)
    4) Draw the Digital equivalent symbol, Truth table, and equation of the circuit given below

    5) Subtract 1000102 – 1001012 using 2’s Complement subtraction.


    6) Convert
    a) 561.2308 to Hexadecimal
    b) 10100.10 to Base 8
    c) CAA16 to Base 2
    7) Which code is called self complimentary code and why is it called so.
    8) Convert the given gray code 1000011 to its equivalent binary
    9) Convert the given binary 10111110112 to its equivalent gray code
    10) Convert 99910 to BCD
    11) Convert 100102 to Excess 3
    12) Simplify using Boolean Theorems and Postulates
    a) x+x’y
    b) AB+ (AC)’+AB’C (AB+C)
    c) A+AB+A’+B
    d) (BC’+A’D)(AB’+CD’)
    13) Convert the given SOP in to its equivalent Canonical SOP
    F(a,b,c,d)=(ab+a’c+d’d+cd)
    14) Convert the given POS in to its equivalent standard POS
    F(a,b,c,d)=(a+b)(a’+c’)(c+d)(a’+d’)
    15) Design a combinational circuit which has 3 inputs and 2 outputs, one of its outputs should go high when all
    the inputs are equal and the other output should go high only when any two outputs are high.
    16) Design a combinational circuit which has 4 inputs and 1 output, its output should go high when any three
    inputs are high.
    17) A Circuit has the following function
    y=∑m (7, 9, 10, 11, 12, 13, 14, 15) Design its equivalent circuit.
    18) A Circuit has the following function
    y=∏M (1, 3, 6, 13, 14) Design its equivalent circuit.
    19) Design a circuit for the given function using Tabulation method F(A,B,C,D) =∑m (0,2,3,6,7,8,10,12,13).
    20) Design a circuit for the given function using Tabulation method
    F (A, B, C, D) =A’BC’D’+A’BC’D+ABC’D’+ABC’D+AB’C’D+A’B’CD’.
    21) a) Implement AND gate using only NOR gate.
    b) Implement OR gate using only NOR gate.
    c) Implement NOT gate using only NOR gate.
    22) a) Implement AND gate using only NAND gate.
    b) Implement OR gate using only NAND gate.
    c) Implement NOT gate using only NAND gate.
    23) When both the gates are equal output is high which gate satisfies this condition draw its
    Symbol, truth table and its equation.
    24) Design a circuit that receives 2 inputs and generates its sum and carry.
    25) Design a circuit that receives 2 inputs and generates its difference and borrow.
    26) Design a circuit that receives 3 inputs and generates its sum and carry.
    27) Design a circuit that receives 3 inputs and generates its difference and borrow.
    28) Convert
    a)DADH in to its corresponding Binary, Decimal, Octal
    b) 55.58 in to its corresponding Binary, Decimal, Hexadecimal
    c) 123.4 in to its corresponding Binary, Octal, Hexadecimal
    29) Solve using K-map
    F (W, X, Y, Z) =∑m (0, 7, 8, 9, 10, 12) + ∑d (2, 5, 13)
    30)Solve using tabulation method
    F(W,X,Y,Z)=∑m(1,2,3,5,9,12,14,15)+ ∑d(4,8,11)
    31) Design a circuit for the given function using Tabulation method
    F(A,B,C,D,E,F,G) =∑m (20,28,52,60).
    32) Using 1’s complement subtraction find
    a) 467810-234610
    b) 1000012-1111112

    33) i) Convert : (a) 5671.23 8 to Hexadecimal


    (b) 100.10 to Base 8
    (ii) Convert : (a) FAF 16 to Base 2
    (b) 99 10 to BCD

    34) Convert

    a)DAD H in to its corresponding Binary, Decimal & Octal


    b) 55.5 8 in to its corresponding Binary, Decimal & Hexadecimal
    c) 123.4 in to its corresponding Binary, Octal & Hexadecimal

    35) Simplify the following Boolean function F, using Quine Mccluskey method and verify the results using K-Map
    F(A,B,C,D)=M(0,3,5,9,11)+d(4,10,15)

    36) Design a circuit for the given function using Tabulation method and verify using Karnaugh map
    F (A, B, C, D) =A’BC’D’+A’BC’D+ABC’D’+ABC’D+AB’C’D+A’B’CD’.

    37) Design BCD to Excess-3 code converter and draw the logic diagram.
    38) Design Excess3 to BCD code converter and implement using only NAND gate.
    39) Design a MOD 10 counter.
    40) Explain the operation of SISO, SIPO, PISO and PIPO.
    41) Explain in detail about the working of Bipolar SRAM cell and singletransistor DRAM cell with neat sketches.
    42) A combinational circuit is defined by the functions: A = XY +XZ’
    B = XY’+YZ+XZ’ Implement the circuit with PLA having three inputs.
    43) Give the classifications of semiconductor memories and explain with necessary diagrams.
    44) Simplify
    i) A B (A C)’ + A B’ C (A B + C)
    (ii) Prove the following Boolean identities.
    (x 1 + x 2 ) (x 1 ’ x 3 ’ + x 3 ) (x 2 ’ + x 1 x 3 )’ = x 1 ’ x 2
    45) (i) State and prove De Morgan’s theorem.
    (ii) Implement XOR gate using only Nand gate.
    46) Simplify the following Boolean function F, using Quine Mccluskey method and verify the results using K-Map
    F(A,B,C,D)=m(0,3,5,9,11,12,13)+d(2,4,10,15)
    47) Simplify the following Boolean function F, using K-Map
    F(A,B,C,D,E)=m(0,3,5,9,11,12,13,18, 20, 25, 28, 30)
    48) Design a 4-bit magnitude comparator.
    49) Design a circuit to convert BCD code to binary code.
    50) Design a 3 bit up/down counter.
    51) Explain the working of SR, JK, D, T flip-flop and give its truth table, excitation table and characteristic
    equation.
    52) Implement a circuit which has 3 inputs and 2 outputs, one of its outputs should go high when all the inputs
    are equal and the other output should go high only when any two outputs are high using PLA.
    53) Compare the following semiconductor memories RAM, ROM, PROM and EPROM.
    Write short notes on FPGA architecture.
    54) Design an asynchronous sequential circuit with two inputs X and Y and with one output Z. Whenever Y is 1,
    input X is transferred to Z. When Y is 0, the output does not change for any change in X.
    55) Design an asynchronous sequential circuit with two inputs T and C. The output attains a value of 1 when T=1
    and C moves from 1 to 0. Otherwise, the output is 0.
    56) Design an asynchronous sequential circuit with inputs A and B and an output Y. Initially and at any time if
    both the inputs are 0, the output, Y is equal to 0. When A and B becomes 1, Y becomes 1. When the other the
    other input also becomes 1, Y becomes 0. The output stays at 0 until circuit goes back to initial state.
    57) Design a circuit with inputs A and B to give an output Z=1 when AB=11 but only if A becomes 1 before B, by
    drawing total state diagram, primitive flow table and output map in which transient state is included.
    State the principle of Duality with an example.
    State De-morgans theorem.
    Draw the diagram of 4X1 Multiplexer.
    Differentiate Encoder and Decoder.
    What is a Flip Flop?
    Give the excitation table of JK flip flop.
    What is one hot statement assignment?
    What is fundamental mode sequential circuit?
    Give the feature of flash memory.
    Differentiate volatile and non-volatile memory?

    Design a combinational circuit for the given equation


    y=∑m (0,1,7, 9, 10, 11, 12, 13, 14).
    Design a combinational circuit for the given equation
    y= ∏M (1, 3, 6, 14) Design its equivalent circuit.

    Design a circuit for the given function using Tabulation method


    F(A,B,C,D) =A’BC’D’+A’BC’D+ABC’D’+ABC’D+AB’C’D+A’B’C’D’.

    Design Excess-3 to BCD code converter and draw the logic diagram.

    Design a Full adder circuit.

    Design a Full Subtractor circuit.

    Design a MOD 10 counter.

    Design a 3 bit up / down counter.

    Design an asynchronous sequential circuit with two inputs, X and Y,


    and with one output, Z. Whenever Y is 1, input X is transferred to Z.
    When Y is 0; the output does not change for any change in X.

    Design an asynchronous sequential circuit with inputs A and B and an


    output Y. Initially and at any time, if both the inputs are 0, the output,
    Y, is equal to 0. When A and B become 1, Y becomes 1. When the
    other input also becomes 1, Y becomes 0. The output stays at 0 until
    the circuit goes back to the initial state.
    A combinational circuit is defined by the functions: A = XY +XZ’
    B = XY’+YZ+XZ’ Implement the circuit with PLA having three inputs.
    Explain in detail about the working of Bipolar SRAM cell

    Give the classifications of semiconductor memories and explain with


    necessary diagrams.
    Write short notes on FPGA architecture.

    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