Scribd Logo
Upload

Welcome to Scribd!

  • Digital

    Uploaded by

    Vikrant Sahu
    88 views2 pages
    The document contains an assignment for a digital electronics and microprocessor course. It includes 20 questions covering various topics in digital logic design and Boolean algebra, such as converting between binary, decimal, and BCD numbers; implementing Boolean functions with logic gates; obtaining truth tables and expressions in sum-of-products and product-of-sums forms; simplifying Boolean functions; designing combinational logic circuits like adders, decoders, multiplexers and comparators; and explaining concepts like carry lookahead adders and priority encoders. Students are asked to complete the questions involving numeric conversions, logic circuit design and analysis, and short explanations of digital logic concepts.

    Original Description:

    Good one

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document contains an assignment for a digital electronics and microprocessor course. It includes 20 questions covering various topics in digital logic design and Boolean algebra, such as converting between binary, decimal, and BCD numbers; implementing Boolean functions with logic gates; obtaining truth tables and expressions in sum-of-products and product-of-sums forms; simplifying Boolean functions; designing combinational logic circuits like adders, decoders, multiplexers and comparators; and explaining concepts like carry lookahead adders and priority encoders. Students are asked to complete the questions involving numeric conversions, logic circuit design and analysis, and short explanations of digital logic concepts.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    88 views2 pages

    Digital

    Uploaded by

    Vikrant Sahu
    The document contains an assignment for a digital electronics and microprocessor course. It includes 20 questions covering various topics in digital logic design and Boolean algebra, such as converting between binary, decimal, and BCD numbers; implementing Boolean functions with logic gates; obtaining truth tables and expressions in sum-of-products and product-of-sums forms; simplifying Boolean functions; designing combinational logic circuits like adders, decoders, multiplexers and comparators; and explaining concepts like carry lookahead adders and priority encoders. Students are asked to complete the questions involving numeric conversions, logic circuit design and analysis, and short explanations of digital logic concepts.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 2

    EE 242 DIGITAL ELECTRONICS &MICROPROCESSOR

    ASSIGNMENT-2

    1. Convert the following 2s complement numbers to their signed decimal


    equivalents:
    (a)0111010 (b)010111001
    (c)0101111001
    (d)010010010001
    2. Convert the following 8421 BCD numbers to their decimal equivalents:
    (a) 1010 (b) 10000110 (c) 010101000011
    (d) 0001000000000000.0101
    3. Convert the following decimal numbers to their 8421 BCD equivalents:
    (a) 6, (b) 13, (c) 99.9, (d) 872.8, (e) 145.6 (f) 21.001.
    4. Implement the Boolean function
    F=xy + xy + yz
    5. (a) With AND, OR, and inverter gates
    (b) With OR and inverter gates
    (c) With AND and inverter gates
    (d) With NAND and inverter gates
    (e) With NOR and inverter gates
    6. Obtain the truth table of the following functions, and express each function
    in sumofminterms and productofmaxterms form:
    (a) (b +cd)(c +bd) (b) (cd +bc +bd)(b +d)
    7. Simplify the following Boolean functions, using three-variable maps:
    (a) = (1,2,3,7)
    (b) = (0,2,4,5)
    8. Draw a NAND logic diagram that implements the complement of the
    following function: F(A, B, C, D) = (1,2,3,6,10,11,14)
    9. Convert the following Boolean function from a sum-of-products form to a
    simplified product-of-sums form.
    F(x, y, z) = (0,1,2,5,8,10,13)
    10.Show that the dual of the exclusive-OR is also its complement.

    11.What is Combinational Circuit? What Are the Characteristic of


    combinational circuit?
    12.Draw the logic diagram of a full adder using AND, XOR, and OR gates.

    13.Draw a diagram of a 6-bit parallel adder using one HA and five FAs.
    14.What is multiplexer? Design 16x1 multiplexer using 4x1 multiplexer.

    15.Write a short Note on 2 Bit Comparator and Design it.


    16.Draw three to eight Decoder and explain via truth Table.

    17.Why carry look ahead adder is better than series/parallel adder. Explain
    with example.
    18.What do you mean by priority Encoder? Draw 8x3 Priority Encoder.
    19. Implement the following Boolean function with a multiplexer.
    (a) F(A, B, C, D) =(0, 2, 5, 8, 10, 14)
    20.Design a combinational circuit with three inputs and one output.
    (a) The output is 1 when the binary value of the inputs is less than 3. The
    output is 0 otherwise.
    (b) The output is 1 when the binary value of the inputs is an even
    number.

    You might also like