Scribd
Upload
20 views

Assignment

This document contains instructions for 9 assignments involving binary arithmetic, Boolean algebra, logic circuits, and sequential/combinational logic. Assignment 1 involves binary subtraction using 1's and 2's complements, converting between binary and gray code, and De Morgan's laws. Assignment 2 involves reducing Boolean expressions, proving identities, and simplifying expressions with don't care conditions. It also asks to draw a logic circuit, define sequential/combinational logic, and design a full subtractor.

Uploaded by

shiva
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
20 views

Assignment

This document contains instructions for 9 assignments involving binary arithmetic, Boolean algebra, logic circuits, and sequential/combinational logic. Assignment 1 involves binary subtraction using 1's and 2's complements, converting between binary and gray code, and De Morgan's laws. Assignment 2 involves reducing Boolean expressions, proving identities, and simplifying expressions with don't care conditions. It also asks to draw a logic circuit, define sequential/combinational logic, and design a full subtractor.

Uploaded by

shiva
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 1

Assignment 1

1. Given the two binary numbers X = 1010100 and Y = 1000011, perform the subtraction (a)
X -Y and (b) Y - X using 2’s complements.
2. Given the two binary numbers X = 1010100 and Y = 1000011, perform the subtraction (a)
X -Y and (b) Y - X using 1’s complements.
3. Using 10’s complement subtract 72532 – 3250.
4. Convert 10111011 is binary into its equivalent gray code.
5. Substract 1 1 1 0 0 12 from 1 0 1 0 1 1 2 using 2’s complement method
6. Find the complement of the functions F1= x’yz’ + x’y’z and F2= x(y’z’ + yz) by applying De
Morgan’s theorem as many times as necessary.
7. Find the complements of the functions F1 = x’yz’ + x’y’z and F2 = x(y’z’ + yz) by taking
their duals and complementing each literal.
8. Reduce A’B’C’ + A’BC’ + A’BC

Assignment 2
1. Reduce AB + (AC)’ + AB’C(AB + C)
2. Show that (X + Y’ + XY)( X + Y’)(X’Y) = 0
3. Prove that ABC + ABC’ + AB’C + A’BC = AB + AC + BC
4. Simplify the following expression
a. y = (A + B) (A + C) (B + C)
b. F= x (x + y)
c. F= xy+ x’z + yz
5. Obtain the simplified expression in sum of products for the given Boolean function
a. F (x, y, z) = (2,3,6,7)

6. Simplify the Boolean function F in sum of products using don’t care conditions
F= B’C’D’ + BCD+ABCD’
D= A’BC’D + ACD + AB’D’
7. Draw the logic circuit for the following Boolean function
a. ABD + A’C’D’ + A’B + A’CD’ +AB’D’
8. What is sequential logic and combinational logic? What are the important features of these
logic?
9. Design a full subtractor with truth table and logic gates.

Submission Date: 10th July, 2018

You might also like