Scribd Logo
Upload

Welcome to Scribd!

  • 39 views

    VL2021220504591 Da

    Uploaded by

    Dattu Gollapinni
    This document provides 20 digital logic and microprocessor lab assignments that are due on April 16th, 2022. The assignments include converting numbers between different number bases, Boolean logic operations like obtaining 1's and 2's complements, implementing Boolean functions using NAND/NOR gates, simplifying Boolean expressions, analyzing combinational circuits, implementing circuits using multiplexers, and designing circuits like full adders, 2's complementers, decoders and magnitude comparators.

    Copyright:

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

    VL2021220504591 Da

    Uploaded by

    Dattu Gollapinni
    39 views2 pages
    This document provides 20 digital logic and microprocessor lab assignments that are due on April 16th, 2022. The assignments include converting numbers between different number bases, Boolean logic operations like obtaining 1's and 2's complements, implementing Boolean functions using NAND/NOR gates, simplifying Boolean expressions, analyzing combinational circuits, implementing circuits using multiplexers, and designing circuits like full adders, 2's complementers, decoders and magnitude comparators.

    Original Description:

    DSA5

    Original Title

    VL2021220504591_DA (1)

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document provides 20 digital logic and microprocessor lab assignments that are due on April 16th, 2022. The assignments include converting numbers between different number bases, Boolean logic operations like obtaining 1's and 2's complements, implementing Boolean functions using NAND/NOR gates, simplifying Boolean expressions, analyzing combinational circuits, implementing circuits using multiplexers, and designing circuits like full adders, 2's complementers, decoders and magnitude comparators.

    Copyright:

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

    VL2021220504591 Da

    Uploaded by

    Dattu Gollapinni
    This document provides 20 digital logic and microprocessor lab assignments that are due on April 16th, 2022. The assignments include converting numbers between different number bases, Boolean logic operations like obtaining 1's and 2's complements, implementing Boolean functions using NAND/NOR gates, simplifying Boolean expressions, analyzing combinational circuits, implementing circuits using multiplexers, and designing circuits like full adders, 2's complementers, decoders and magnitude comparators.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    of 2

    School of Information Technology and Engineering (SITE)

    Course: SWE1003- Digital Logic & Microprocessor Lab

    Digital Assignment

    Last date for submission: 16.04.2022

    1. Write the first 20 decimal digits in base 3.


    2. Convert the decimal number 250.5 to base 3, base 4, base 7, base 8 and base 16.
    3. Convert the binary number to decimal (101110.0101) 2
    4. Convert the decimal number to binary (673.23) 10
    5. Convert the following numbers from the given bases to the base indicated
    (i) (225.225) 10 to binary, octal, and hexa decimal
    (ii) (11010111.110) 2 to decimal, octal and hexa decimal
    (iii) (623.77) 8 to decimal, binary and hexa decimal
    (iv) (2AC5.D) 16 to decimal, octal and binary
    6. Convert the following numbers to decimal
    (i) (12121) 3
    (ii) (0.342) 6
    (iii) (198) 12
    (iv) (4310) 5
    7. Obtain 1’s and 2’s complement for the numbers
    (i) 0111000
    (ii) 10000
    8. Implement the Boolean function using both NAND and NOR Logic
    (a) F = xy + x’y’ + y’z
    (b) F= w(x + y + z) + xyz
    9. Reduce the following Boolean expressions to the indicated number of literals:
    (a) (A’ + C) (A’ + C’) (A + B + C’D) to four literals
    (b) ABC'D + A'BD + ABCD to two literals
    10. Obtain the simplified expressions in sum of products for the following Boolean
    functions:
    (a) D (A’ + B) + B’ (C+ AD)
    (b) k’lm’ + k’m’n + klm’n’ + lmn’
    11. Obtain the simplified expressions in products of sum for the following Boolean
    functions:
    (a) (A+B’+D) (A’+B+D) (C+D) (C’+D’)
    (b) (A’+B’+D’) (A+B’+C’) (A’+B+D’) (B+C’+D’)
    12. Obtain the simplified expressions:
    (a) F(w,x,y,z) = ∑ (2,3,12,13,14,15)
    (b) F(x,y,z) = ∏ (1,3,5,7,13,15)
    13. Simplify the following Boolean function F , together with the don’t-care conditions d, and
    then express the simplified function in sum-of-minterms form:
    (a) F(x, y, z) = ∑(0, 1, 4, 5, 6) ; d(x, y, z) = ∑ (2, 3, 7)
    (b) F (A, B, C, D) = ∑ (0, 6, 8, 13, 14) ; d(A, B, C, D) = ∑ (2, 4, 10)
    14. Analyse the combinational circuit given below and find the outputs of T1,T2,T3 and
    F1,F2 and F3.

    15. Implement the following Boolean function with a 4 x 1 multiplexer and external gates.
    F(A, B, C, D) = ∑(1, 2, 5, 7, 8, 10, 11, 13, 15) connect inputs A and B to the selection lines.
    The input requirements for the four data lines will be a function of variables C and D.
    These values are obtained by expressing F as a function of C and D for each of the four
    cases when AB = 00, 01, 10, and 11. These functions may have to be implemented with
    external gates.
    16. Implement a full adder with two 4 x 1 multiplexers
    17. Design a four-bit combinational circuit 2’s complementer. (The output generates the
    2’s complement of the input binary number.) Show that the circuit can be constructed
    with exclusive-OR gates.
    18. Design a combinational circuit with three inputs and one output. The output is 1 when
    the binary value of the inputs is an even number.
    19. Design a 4 * 16 decoder constructed with two 3 * 8 decoders.
    20. Design a 3 bit Magnitude comparator.

    *************************************ALL THE BEST********************************************

    You might also like