Scribd
Upload
126 views2 pages

Digital Logic Design

1. The document discusses topics in digital logic design including binary conversions, logic gates, Boolean algebra, and other digital logic concepts. 2. Key topics covered include binary, hexadecimal, and octal conversions; logic gate workings and properties including NAND, NOR, and inhibition; Boolean simplification techniques using K-maps; don't care conditions; and number systems of different bases. 3. Questions posed cover skills and concepts in logic design including binary arithmetic, logic gate diagrams, Boolean expressions, number representations, and solving problems involving different numeric bases.

Uploaded by

xitih41
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
126 views2 pages

Digital Logic Design

1. The document discusses topics in digital logic design including binary conversions, logic gates, Boolean algebra, and other digital logic concepts. 2. Key topics covered include binary, hexadecimal, and octal conversions; logic gate workings and properties including NAND, NOR, and inhibition; Boolean simplification techniques using K-maps; don't care conditions; and number systems of different bases. 3. Questions posed cover skills and concepts in logic design including binary arithmetic, logic gate diagrams, Boolean expressions, number representations, and solving problems involving different numeric bases.

Uploaded by

xitih41
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

Digital Logic Design

1. Find the binary equivalent of (222)3 and (175.175) 10.

2. Convert the hexadecimal number F3A7C2 to binary, octal and decimal.

3. Determine the value of base x if (211) x = (152)8.

4. Draw and explain the working of NAND and NOR gates using transistor-resistor circuit.

5. Perform the following subtraction: i) 20-100 (using 10’s complement) ii) 1010100-
1010100 (using 2’s complement).

6. Obtain the 5’s complement of numbers (543210), (354322) and (67345) with base 6.

7. Decode the following ASCII code: 1001010, 1101111, 1101000, 0100000, 1100101.

8. Show the bit configuration that represents the decimal number 295 in i) binary, ii) BCD,
iii) ASCII, iv) excess-3, v) Gray codes.

9. Show that the dual of the exclusive-OR gate is equal to its complement.

10. Show the following:


i) the inhibition operation is neither commutative nor associative.
ii) the NAND and NOR operations are commutative and but not associative.

11. Define Fan-out, Fan-in, power Dissipation and Propagation delay.

12. Simplify the following Boolean expressions to a minimum number of literal and draw the
corresponding logic diagram using NAND and NOR gates only: i) xy + x’y’ + x’y
ii) (x + y) (x + y’) iii) xy + x(wz + wz’) iv) (BC’ + A’D) (AB’ + CD’)

13. Find the complement of F= x+ yz; then show that F * F’ = 0 and F + F = 1.

14. Simplify the Boolean expressions using K-map method: i) F(A,B,C) = ∑(0,2,3,4,6) ii)
F(A,B,C,D) = П(1,3,5,7,13,15) iii) F(a,b,c,d,e) = ∑(0,1,4,5,16,17,21,25,29) iv) F(x,y,z) =
∑(0,1,2,4,5) and d(x,y,z) = ∑(3,6,7)

1
15. A logic circuit implements the following Boolean function: F = A’C + AC’D’, it is found
that the circuit input combination A = C = 1 can never occur. Find a simpler expression
for F using the proper don’t care conditions.

16. Prove the following: i) A Ex-OR B = A’ Ex-OR B’ ii) B Ex-OR (B Ex-OR A*C) = A*C

17. Realize the following function using Ex-OR: F = ABC’D’ + AB’C’D + A’B’CD +
A’BCD’.

18. Consider the expression: Z = ABCD…. Show that Z = 1 if an odd number of variables
are 1 and Z = 0, if an even number of variables are 1.

19. Make a k-map for the function F = AB+AC’+C+AD+AB’C+ABC


i) express F in standard SOP form
ii) minimize it and realize the minimized expression using number NAND gate.

20. Answer the following:


i) A printer is capable of printing 132 characters in a single line and each character is
represented by ASCII code. How many bits are used to print each line?
ii) How many bits of memory are required for storing 100 names, assuming that no name
occupies more than 20 characters, including space (each character is represented by
ASCII code with parity bit)?

21. Find the base B of the following:


a) (461/32)(B) = (12 + remainder 11) (8)
b) the (radix-1)’s complement of the number(87) (B) in decimal (25)(10)
c) roots of the quadratic equation x2-13x+36 in number system of base B are 5 and 6

You might also like