CT 02 Syllabus

From Digital Logic and Computer Design by Morris Mano:

Chapter 2: 2-1, 2-2, 2-3, 2-4, 2-5, 2-6

Chapter 3: 3-1, 3-2, 3-3, 3-4, 3-5, 3-6, 3-8

And Number System (Class lecture)

Assignment One

1. Number System Conversion

a)

111012 – ( )10 111012 – ( )7

b)

258 - ( )2 258 - ( )16 258 - ( )10

c)

10101.11102 - ( )8 124.510 - ( )16

2. Convert (3 7)10 into Binary, BCD, Excess-3 and 2421?

3. Explain the Gray code with a proper example?

4. Subtract 1000112 from 0100112 using Complementary method?

5. Convert the decimal digits (6, 7)10 into 753-6, 85421 and Biquinary?

6. Convert the decimal number 250.5 to base 3, base 4, base 7, base 8 and base 16

7. Obtain 1’s, 2’s, 9’s and 10’s complement of the following numbers: 1010101

8. Perform the subtraction with the following decimal numbers using (1) 10’s complement and
(2) 9’s complement. Check the answer by straight subtraction

(a) 5250 – 321 (b) 753 – 864

9. Simplify the following Boolean functions to a minimum number of literals

(a) xy+xy` (b) y(wz`+wz) + xy

10. Reduce the following Boolean expressions to the required number of literals
 (a) ABC + A`B`C + A`BC + ABC` + A`B`C

11. Find the complement of the following Boolean functions and reduce them to a minimum
number of literals

(a) (BC` + A`D) (AB` + CD`) (b) B`D + A`BC` + ACD + A`BC

12. Express the following functions in a sum of minterms and a product of maxterms

(a) F(A, B, C, D) = (A + B` + C) (A + B`) (A + C` + D`) (b) F(x, y, z) = 1

13. Convert the following to the other canonical form

(a) F(x, y, z) = ∑ (b) F(x, y, z) = ∏

14. The sum of all minterms of a Boolean function of n variables is 1

(a) Prove the above statement for n = 3

(b) Suggest a procedure for a general proof

15. The product of all maxterms of a Boolean function of n variables is 0

(a) Prove the statement for n = 3

(b) Suggest a procedure for a general proof. Can we use the duality principle after
proving (b) of problem 21?

16. Show that a positive logic AND gate is a negative logic OR gate and vice versa

17. Obtain the simplified expressions in sum of products for the following Boolean fundtions

(a) A`B`C`D + AC`D + B`CD` + A`BCD + BC`D

(b) F (A, B, C, D, E) = ∑

18. Obtain the simplified expressions in product of sums

(a) F(x, y, z) = ∏

(b) (A` + B` + D`) (A + B` + C`) (A` + B + D`) (B + C` + D`)

20. Simplify following functions and implement them with NAND gates

(a) F = (B` + D`) + (A` + C` + D) (A + B` + C` + D) (A` + B + C` + D`)

21. Draw Haf adder and full adder with NAND gate, NOR gate

22. What are the limitations of Half adder