Scribd Logo
Upload

Welcome to Scribd!

  • 13 views

    Unit 1

    Uploaded by

    Inzamam Pasha
    This document contains 5 units covering topics in digital logic including: 1) Converting between number bases, representing signed numbers, and performing binary arithmetic. 2) Boolean algebra laws and theorems, simplifying Boolean functions, and constructing logic diagrams. 3) Minimizing Boolean functions using Karnaugh maps and implementing functions with logic gates. 4) Additional Boolean function minimization techniques including tabulation and applying decomposition rules. 5) Examples of simplifying Boolean expressions using Karnaugh maps and implementing logic functions.

    Copyright:

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

    Unit 1

    Uploaded by

    Inzamam Pasha
    13 views2 pages
    This document contains 5 units covering topics in digital logic including: 1) Converting between number bases, representing signed numbers, and performing binary arithmetic. 2) Boolean algebra laws and theorems, simplifying Boolean functions, and constructing logic diagrams. 3) Minimizing Boolean functions using Karnaugh maps and implementing functions with logic gates. 4) Additional Boolean function minimization techniques including tabulation and applying decomposition rules. 5) Examples of simplifying Boolean expressions using Karnaugh maps and implementing logic functions.

    Original Description:

    dfsdfsdf

    Original Title

    New Microsoft Word Document

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document contains 5 units covering topics in digital logic including: 1) Converting between number bases, representing signed numbers, and performing binary arithmetic. 2) Boolean algebra laws and theorems, simplifying Boolean functions, and constructing logic diagrams. 3) Minimizing Boolean functions using Karnaugh maps and implementing functions with logic gates. 4) Additional Boolean function minimization techniques including tabulation and applying decomposition rules. 5) Examples of simplifying Boolean expressions using Karnaugh maps and implementing logic functions.

    Copyright:

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

    Unit 1

    Uploaded by

    Inzamam Pasha
    This document contains 5 units covering topics in digital logic including: 1) Converting between number bases, representing signed numbers, and performing binary arithmetic. 2) Boolean algebra laws and theorems, simplifying Boolean functions, and constructing logic diagrams. 3) Minimizing Boolean functions using Karnaugh maps and implementing functions with logic gates. 4) Additional Boolean function minimization techniques including tabulation and applying decomposition rules. 5) Examples of simplifying Boolean expressions using Karnaugh maps and implementing logic functions.

    Copyright:

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

    Unit-1

    1.(a) Convert the following numbers:


    i. (6753)8 to base 10
    ii. (00111101.0101)2 to base 8 and base 4
    iii. (95.75)10 to base 2.(b) Represent +65 and -65 in sign-magnitude, sign1s complement and sign2s Complement representation.
    2.Given a = 10101001 and b = 1101
    find:i. a + b ii. a b iii. a . b iv. a / b.
    3.What is the Gray code? What are the rules to construct Gray code? Developthe 4
    bit Gray code for the decimal 0 to 15.
    4.What are the rules for XS3 addition? Add the two decimal numbers 123 and 658
    XS3 code.
    5.Define a single error correcting code for a 11 bit group 01101110101
    Unit-2
    1.State and prove the following Boolean laws:
    i. Commutative ii. Associative iii. Distributive.
    2.Simplify the following Boolean functions to minimum number of literals:
    i. ( a + b ) ( a+ b ) ii. y(wz + wz) + xy

    3. State Duality theorem. List Boolean laws and their Duals.


    4. Prove that OR-AND network is equivalent to NOR-NOR network and AND-OR
    network isequivalent to NAND-NAND network
    5.For the given Boolean function F=xyz+xyz+wxy+wxy+wxy
    i. Draw the logic diagram ii. Simplify the function to minimal literals using Boolean
    algebra.
    Unit-3
    1.Simplify the following Boolean expressions using K-map and implement them using
    NOR gates:
    F (A, B, C, D) = ABC + AC + ACD
    2.List the Boolean function simplification rules using Tabulation method.
    3.Simplify the Boolean function using K-map and implement using NAND gates
    F=m(0,2,3,4,5,6)
    4.Reduce the given function using tabular minimization method
    F(A,B,C,D)=(0,1,3,4,
    5,6,7,8,9)+d(10,11,12,13,14,15)

    5.Simplify the Boolean expression using K-map F=A1+AB+ABD1+AB1D1+C

    You might also like