We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 3
GOKARAJU RANGARAJU
Institute of Engineering and Technology
(Autonomous Institute under JNTU Hyderabad) II B Tech I Semester – 2017-18 – GR15 Regulation DIGITAL LOGIC DESIGN Problem Sheet 1 – Unit I (Binary Systems, Boolean Algebra and Logic Gates)
Syllabus: Binary Systems: Digital Systems, Binary Numbers, Number Base
Conversions, Octal and Hexadecimal Numbers, Complements, Signed Binary Numbers, Binary Codes, Binary Storage and Registers, Binary Logic. Boolean Algebra And Logic Gates: Basic Definitions, Axiomatic definition of Boolean Algebra, Basic theorems and properties of Boolean Algebra, Boolean Functions, Canonical and Standard Forms, Other Logic Operations, Digital Logic Gates, Integrated Circuits.
1. List the Octal and Hexadecimal numbers from 16 to 32.
Ans. Decimal 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 Octal 20 21 22 23 24 25 26 27 30 31 32 33 34 35 36 37 40 Hexadecimal 10 11 12 13 14 15 16 17 18 191A 1A 1C 1D 1E 1F 20 2. Convert the following numbers with the indicated bases to decimal: a) (4310)5 b) (198)12 c) (735)8 d) (525)6 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 4. Convert the hexadecimal number 68BE to binary, and then convert it from binary to octal. 5. Express the following numbers in decimal: a) (10110.0101)2 b) (16.5)16 c) (1010.1010)2 6. Convert the following binary numbers to hexadecimal and to decimal: a) 1.10010 b) 110.010 c) 1010.1010 7. Obtain the 1’s and 2’s complement of the following binary numbers: a) 10000000 b) 11011010 c) 10000101 8. Find the 9’s and 10’s complement of the following decimal numbers: a) 12345678 b) 52784630 c) 25000000 9. Using 10’s and 9’s complement, find a) 6428-3409 b) 125-1800 c) 2043-6152 10. Using 2’s and 1’s complement find a) 10011-10001 b) 100010-100011 c) 1001-101000 11. Find the sum of the following signed numbers, using signed 10’s complement form: a) (+9286)+(-801) b) (-9286)+(+801) c) (-9286)+(-801) 12. Find the difference of the following signed numbers, using signed 10’s complement form: a) (+9286) - (-801) b) (-9286) - (+801) c) (-9286) - (-801) 13. Represent the unsigned decimal numbers 842 and 535 in BCD. 14. Write the gray codes for the decimal numbers from 16 to 32. 15. Simplify the following Boolean expressions to a minimum number of literals: a) xy+xy’ b) xyz+x’y+xyz’ c) xy+xy’+x’y 16. Draw the logic diagrams for the following Boolean functions that implement the original and simplified expressions. a) xy+xy’ b) xyz+x’y+xyz’ c) xy+xy’+x’y 17. Find the complement of the following expressions: a) xy’+x’y b) (x’+y+z’)(x+y’)(x+z) c) xy+xy’+x’y 18. List the truth table of the function: a) F=xy+xy’+y’z b) F=x’z’+yz 19. For the Boolean function F=xy’z+x’y’z+w’xy+wx’y+wxy 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 e) Draw the logic diagram from the simplified expression. 20. Express the following function as a sum of minterms and as a product of maxterms: F(A,B,C,D)=B’D+A’D+BD 21. Express the Complement of the following function in sum of minterms form: a) F(A,B,C,D)=∑(3,5,9,11,15) b) F(x,y,z)=∏(2,4,5,7) 22. Convert each of the following to the other canonical form: a) F(x,y,z)= ∑ (2,4,5,6) b) F(A,B,C,D)=∏(0,1,2,4,7,9,12) 23. Convert each of the following expressions into sum of products and product of sums: a) (AB+C)(B+C’D) b) x’+x(x+y’)(y+z’) 24. Draw the logic diagram corresponding to the following Boolean expressions without simplifying them: a) B'C +AB + ACD b) (A + B)(C + D)(A' + B + D) c) (AB + A'B')(CD' + C'D) d) A + CD + (A + D')(C' + D) 25. Write the Boolean equations and draw the logic diagram of the circuit whose outputs are defined by the following truth table: A B C F1 F2 0 0 0 1 0 0 0 1 0 0 0 1 0 0 1 0 1 1 1 1 1 0 0 0 1 1 0 1 0 1 1 1 0 1 1 1 1 1 1 0
26. Write Boolean expressions and construct the truth tables describing the outputs of the circuit described by the following logic diagrams: