[go: up one dir, main page]
Scribd
Upload
161 views2 pages

Practice Problems - 1: Department of Electrical Engineering

This document contains 21 practice problems related to digital logic design and Boolean algebra. The problems cover a range of topics including number system conversion, binary arithmetic, logic gate implementation, Boolean expressions, Karnaugh maps, and combinational logic circuits. Students are asked to complete tasks such as converting between binary, decimal, hexadecimal and octal number systems, performing arithmetic in 2's complement, drawing logic gate schematics, minimizing Boolean expressions, and designing combinational circuits from Boolean equations.

Uploaded by

Malay Kumar Mohanta
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
161 views2 pages

Practice Problems - 1: Department of Electrical Engineering

This document contains 21 practice problems related to digital logic design and Boolean algebra. The problems cover a range of topics including number system conversion, binary arithmetic, logic gate implementation, Boolean expressions, Karnaugh maps, and combinational logic circuits. Students are asked to complete tasks such as converting between binary, decimal, hexadecimal and octal number systems, performing arithmetic in 2's complement, drawing logic gate schematics, minimizing Boolean expressions, and designing combinational circuits from Boolean equations.

Uploaded by

Malay Kumar Mohanta
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

EE370A – Fall 2020

Indian Institute of Technology Kanpur


Department of Electrical Engineering

Practice Problems - 1
(Much of this is based on what you studied in ESC 201A)

1. Convert the following numbers into the number system indicated:


a. (1010.011)2 to decimal b. (FA)16 to decimal
c. (101110101101)2 into hexadecimal and octal d. (FA)16 to binary

2. Convert the decimal number 27.25 into a binary number.

3. What is the largest decimal number that you can represent using 8 bits? How many bits are
required to represent decimal numbers less than or equal to 106?

4. Determine the number system in which the following arithmetic operations have been carried out.
Give justifications for your answer
a. 24 + 17 = 40 b. 22 x 5 = 132
5. Obtain 1’s and 2’s complement of the following binary numbers
a. 10000000 b. 10101010
c. 01110101 d. 10011100

6. (a) What is the minimum number of bits required to represent -32 in 2’s complement form?

(b) 11011111 is a number in 2’s complement. Is it positive or negative? What is its magnitude?

7. Carry out the following four operations using 8bit 2’s complement representation:
24  32
Verify that operations have been properly carried out.

8. Draw the circuits which will implement the following functions using CMOS technology.
Assume the true and complement of the independent variables are available. [In CMOS technology
digital circuit implementation, the ‘pull down circuit’ consists of NMOSFETs and ‘pull up circuit’
consists of PMOSFETs.]

(a) F1 = A’ + B’ (b) F2 = A’B’ (c) F3 = A  B (d) F4 = (AB+C)D+E


9. Design a combinational circuit with 3 inputs and 1 output
(a) The output is 1 when the binary value of the inputs is less than 3. The output is 0 otherwise
(b) The output is 1 when the binary value of inputs is an odd number.
EE370A – Fall 2020

10. Design a half subtractor circuit with inputs x and y and outputs Diff. and Bout. The circuit
subtracts the bits x-y and places the result in Diff. and borrow in Bout.

11. Show that the Boolean expression x  x. y is equivalent to x  y using basic postulates and
theorems of Boolean algebra
12. Reduce the following expressions to a minimum number of literals.

a. f  ( x  y  z ).( y  z ) b. f  ( x  y ).( y  x )

c. f  ABCD  ABD  ABCD

13. Obtain the truth table for the following function: (x.y+z)(y+x.z) and write it as sum of products
(SOP) and product of sums (POS).
14. Implement an 8 input OR gate using only 2 input AND and 2 input OR gates.
15. Show that you can implement 2 input AND, 2 input OR and NOT gates using only 2 input
NAND gates. Similarly show that you can implement 2 input AND, 2 input OR and NOT gates
using only 2 input NOR gates.
16. Implement a 2-input exclusive OR gate with only 2 input NAND gates .
17. Simplify the following 4-variable functions into sum-of-products form using K-map.

a.  (1,5, 6, 7,14) b.  (0, 4, 6,8)


c.  (0,1, 4, 6,8,9,14) d.  (1, 4, 7,11,13,14)
18. Simplify the following 4-variable functions into product-of-sums form using K-map

a.  (1,3,5,7,13,15) b.  (1,3,6,9,11,12,14)

c.  (1,3,5,7,9,11,12,13,14,15,) d.  (0,1,3, 4,5,7,12,13,15)

19. Simplify the following expressions into sum-of-products form using the don’t care conditions
into account.

F ( A, B, C , D)   (4,5, 7,12,13,14) F ( A, B, C , D)   (1, 2,12,13,14)


a. b.
d ( A, B, C , D )   (1,9,11,15) d ( A, B, C , D)   (8,9,10,11)

20. For the Boolean expression given below, implement it using two levels of logic first as AND-OR
and then as OR-AND.
F (a, b, c, d )  (ab  cd )(ab  cd  ac )
21. Implement the following expression using only 2-input NAND gates and then repeat the problem
with only 2 input NOR gates.
F (a, b, c, d )  ab  abc  abcd

You might also like