0% found this document useful (0 votes)
11 views2 pages

Assignment 1

random

Uploaded by

Ankit Kapadnis
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
11 views2 pages

Assignment 1

random

Uploaded by

Ankit Kapadnis
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

ASSIGNMENT - 1

1. Represent the decimal numbers 682 and 814 in BCD, and then show the steps necessary to
form their sum.

2. Convert the following pairs of decimal numbers to 5-bit 2’s-complement numbers, then
perform addition and subtraction on each pair. Indicate whether or not overflow occurs for
each case.
(a) 7 and 13 (b) −12 and 9

3. Determine the base of the numbers in each case for the following operations to be correct:
(a) 14/2 = 5 (b) 54/4 = 13,
(c) 24 + 17 = 40 (d) 312/20 = 13.1

4. (a) Find the 16's complement of B2FA.


(b) Convert B2FA to binary.
(c) Find the 2's complement of the result in (b).
(d) Convert the answer in (c) to hexadecimal and compare with the answer in (a).

5. Perform the following binary multiplications:


(a) 1101 × 1011 (b) 1010110 ÷ 101
(c) 100111 × 011011 (d) 111101 ÷ 1001

6. Prove the following using Boolean algebra laws

̅̅̅̅̅̅̅̅̅̅̅̅̅
(𝐴 + 𝐵). (𝐴 + 𝐴̅𝐵̅ ). 𝐶 + (𝐴 ̅. (𝐵 + 𝐶̅ )) + 𝐴̅. 𝐵 + 𝐴. 𝐵. 𝐶 = 𝐴 + 𝐵 + 𝐶

7. Find the complements of the following functions

8. For the Boolean function


𝐹 = 𝑥𝑦̅𝑧 + 𝑥̅ 𝑦̅𝑧 + 𝑤
̅𝑥𝑦 + 𝑤𝑥̅ 𝑦 + 𝑤𝑥𝑦

(a) Obtain the truth table of F.


(b) Draw the logic diagram using the original Boolean expression.
(c) Use Boolean algebra to simplify the function to a minimum number of literals,
(d) Obtain the truth table of the function from the simplified expression and show that it is
the same as the one in part (a),
(e) Draw the logic diagram from the simplified expression and compare the total number
of gates with the diagram of part (b)
9. Optimize the following Boolean expressions using Kmap

in Sum of Products form using Kmap

in Product of Sums form using Kmap

using Quine-McCluskey method

10. Show the truth table of a function that outputs a 1 whenever the 4-bit input, treated as
representing a 4-bit unsigned binary number, is divisible by 4. Derive a simplified logical
expression using the Kmap method. Show an implementation of this function.

11. Show how to implement the following function using six or fewer two-input NAND gates.
Complemented input variables are not available.
𝐹 = 𝐴𝐵 + 𝐶̅ + 𝐴̅𝐷

12. For the circuit given below, find the corresponding Boolean function

(a)

Simplify it using Boolean Laws and draw the simplified circuit.

(b)

Simplify the function using the Kmap method and draw the simplified circuit.

You might also like