Scribd Logo
Upload

Welcome to Scribd!

  • 23 views

    Solution +tut-4

    Uploaded by

    Aditya
    The document is a tutorial sheet containing 5 questions related to Boolean algebra, binary arithmetic, and logic gate implementations. Question 1 asks to simplify Boolean expressions. Question 2 involves signed 8-bit binary arithmetic using 1's and 2's complement methods. Question 3 identifies which binary addition operations generate overflow. Question 4 involves converting between binary, gray code, BCD, and excess-3. Question 5 asks to implement logic functions using only NAND gates for part A and only NOR gates for part B.

    Copyright:

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

    Solution +tut-4

    Uploaded by

    Aditya
    23 views4 pages
    The document is a tutorial sheet containing 5 questions related to Boolean algebra, binary arithmetic, and logic gate implementations. Question 1 asks to simplify Boolean expressions. Question 2 involves signed 8-bit binary arithmetic using 1's and 2's complement methods. Question 3 identifies which binary addition operations generate overflow. Question 4 involves converting between binary, gray code, BCD, and excess-3. Question 5 asks to implement logic functions using only NAND gates for part A and only NOR gates for part B.

    Original Title

    Solution +Tut-4

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document is a tutorial sheet containing 5 questions related to Boolean algebra, binary arithmetic, and logic gate implementations. Question 1 asks to simplify Boolean expressions. Question 2 involves signed 8-bit binary arithmetic using 1's and 2's complement methods. Question 3 identifies which binary addition operations generate overflow. Question 4 involves converting between binary, gray code, BCD, and excess-3. Question 5 asks to implement logic functions using only NAND gates for part A and only NOR gates for part B.

    Copyright:

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

    Solution +tut-4

    Uploaded by

    Aditya
    The document is a tutorial sheet containing 5 questions related to Boolean algebra, binary arithmetic, and logic gate implementations. Question 1 asks to simplify Boolean expressions. Question 2 involves signed 8-bit binary arithmetic using 1's and 2's complement methods. Question 3 identifies which binary addition operations generate overflow. Question 4 involves converting between binary, gray code, BCD, and excess-3. Question 5 asks to implement logic functions using only NAND gates for part A and only NOR gates for part B.

    Copyright:

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

    THAPAR INSTITUTE OF ENGINEERING &TECHNOLOGY

    (Deemed to be University)

    Department of Electronics and Communication Engineering


    Tutorial Sheet-4 (Electronics Engineering, UEC-001)Odd Semester 2019-20
    Question 1: Simplify the following Boolean expression
    A)

    B)

    Question 2: Solve the following using Signed 8-bit representation


    I. 1’s Complement method
    II. 2’s Compliment method
    a) (6)10-(13)10
    b) (15)10-(8)10

    Question 3: The following binary numbers are 4-bit 2's complement binary numbers. Which
    of thefollowing operations generate overflow? Justify your answers by translating the
    operands and results into decimal.

    A) 0011 + 1100
    B) 0111 + 1111
    C) 1110 + 1000
    D) 0110 + 0010

    Question 4: Do the following code conversions:


    Binary Gray
    ? 0111
    1001 ?
    ? 0100
    0011 ?

    BCD Excess-3
    0010 ?
    ? 1010
    1001 ?
    ? 1011

    Question 5: A) Implement the function using NAND Gates only,F = XZ + Y’Z + X’YZ
    B) Implement the function using NOR Gates only, F = (X+Z) (Y’+Z) (X’+Y+Z)
    Solution 1 (a)

    (b)

    Solution 2
    a) (6)10-(13)10
    b) (15)10-(8)10
    I. A)
    6 = 00110
    +13 = 01101
    1’s Complement of 01101= 10010 (-13)
    After adding 00110+ 10010 = 11000 (As MSB is 1, the number is -7 in 1’s
    complement form)
    B)
    15 = 01111
    +8 = 01000
    1’s Complement of 01000 = 10111 (-8)
    After adding 01111+ 10111 = 00111 (As MSB is 0, the number is +7 in 1’s
    complement form)

    II. A)
    6 = 00110
    +13 = 01101
    2’s Complement of 01101= 10011 (-13)
    After adding 00110+ 10011 = 11001 (As MSB is 1, the number is -7 in 2’s
    complement form)
    B)
    15 = 01111
    +8 = 01000
    2’s Complement of 01000 = 11000 (-8)
    After adding 01111+ 11000 = 100111 (Discard the extra carry)

    00111. (As MSB is 0, the answer is + 7)

    Solution 3:

    Conclusion:
     When adding two numbers, overflow occurs when the two operands have the same leftmost
    bit and the leftmost bit of the answer is different.
     When the operands have differing leftmost bits, overflow cannot occur.

    Question 4

    Binary Gray

    0101 0111

    1001 1101

    0111 0100

    0011 0010

    BCD Excess-3
    0010 0101
    0111 1010
    1001 1100
    1000 1011

    Question 5
    A)

    B)

    You might also like