For the students of CSE 207, section N
Prepared by: Dr. Rajendra Kumar
Please read the passage before you attempt the questions.
The first electronic digital computers, developed in the late 1940s, were used primarily for
numerical computations. Digital computers use the binary number system, which has two
digits: 0 and 1. A binary digit is called a bit. Information is represented in digital computers
in groups of bits. By using various coding techniques, groups of bits can be made to represent
not only binary numbers but also other discrete symbols, such as decimal digits or letters of
the alphabet. By judicious use of binary arrangements and by using various coding
techniques, the groups of bits are used to develop complete sets of instructions for performing
various types of computations [1].
So now, here are the questions. If you need any help, feel free to ask me.
A. Number system: (10 questions)
1. List the first 20 digits for a number system of base-13. Use A, B, C to represent the
last three digits i.e., for Ten, Eleven and Twelve.
2. Convert following numbers from binary to decimal: 1100111, 10100110, 111001.10,
1101.1101
3. Convert following numbers,
a. From decimal to binary: 582, 134.45
b. From decimal to octal: 878, 7562.43
c. From decimal to hexadecimal: 1948.257
4. Convert FCA736 from hexadecimal to octal and binary.
5. Find the value of base-x if (574)8 = (462)𝑥
6. Find 1’s and 2’s complements of following binary numbers: 10101110, 10000001
7. Convert 110100101, 101101 from binary to gray and, 10110100, 110110 from gray to
binary.
8. Represent 8964 and 8456 from Decimal to BCD and 1100101, 110110 from BCD to
decimal.
9. Perform following BCD additions: 67+21, 92+89.
10. Represent the decimal numbers 8645, 8631 in excess-3 code.
11. Perform the following operations:
a. Addition of binary numbers: 11001101 + 1011011, 1001101 + 11011101
b. Subtraction of binary numbers: 1011011 – 1011, 101011 – 100110
12. Perform following binary operations using 1’s compliments:
a. (110101)2 – (100101)2
b. (101011)2 – (111001)2
13. Perform following binary operations using 2’s compliments:
c. (1111)2 – (1010)2
d. (1000)2 – (1010)2
For the students of CSE 207, section N
Prepared by: Dr. Rajendra Kumar
B. Boolean algebra: (10 questions)
1. Minimize the following Boolean expressions:
𝐴 + 𝐴𝐵
𝐴𝐵 + 𝐴𝐵′
𝐴′ 𝐵 + 𝐴𝐵𝐶 ′ + 𝐴𝐵𝐶
(𝐵𝐶 ′ + 𝐴′𝐷)(𝐴𝐵 ′ + 𝐶𝐷′)
2. Find the value of 𝐴 + 𝐴′𝐵 + 𝐴′𝐵′.
3. Find the complement (inverse) of Boolean expression 𝐹 = 𝑥 ′ 𝑦 + 𝑥𝑦𝑧′ using D-
Morgan theorem.
4. Fill in the table given below appropriately. The first cell shows an example.
XYZ Minterm Designation Maxterms Designation
101 XY’Z 𝑚5 X’ + Y + Z’ 𝑀5
111
110
011
000
110
5. Output of a 3-variable digital circuit for different variants of the inputs is summarized
in the table below:
XYZ Output (F)
000 1
001 0
010 0
011 1
100 1
101 0
110 0
111 1
Find the Boolean expression which describes this digital circuit. (Please do not
simplify it, just write it in a preliminary form).
6. Draw the logic diagram of following Boolean expressions without solving them
a. 𝐹 = 𝐵𝐶 ′ + 𝐴𝐵 + 𝐴𝐶𝐷
b. 𝐹 = (𝐴 + 𝐵)(𝐶 + 𝐷)(𝐴′ + 𝐵 + 𝐷)
For the students of CSE 207, section N
Prepared by: Dr. Rajendra Kumar
7. For the Boolean expression,
𝐹 = 𝑥𝑦 ′ 𝑧 + 𝑥 ′ 𝑦 ′ 𝑧 + 𝑥𝑦𝑧
a. Form the truth table,
b. Draw the logic diagram without simplifying it,
c. Draw the logic diagram after simplifying it.
8. Express the Boolean expression 𝐹(𝐴, 𝐵, 𝐶) = 𝐴 + 𝐵′𝐶 with sum of minterms i.e.,
𝐹(𝐴, 𝐵, 𝐶) = ∑( 𝑚𝑖 )
9. Express the Boolean expression 𝐹(𝐴, 𝐵, 𝐶) = (𝐴𝐵 + 𝐶)(𝐴𝐶 + 𝐵) with product of
maxterms i.e.,
𝐹(𝐴, 𝐵, 𝐶) = ∏(𝑀𝑖 )
10. Write the following expressions in terms of Boolean variables, sum of products
𝐹1 (𝐴, 𝐵, 𝐶) = ∑(3,4,5,7)
𝐹2 (𝐴, 𝐵, 𝐶) = ∏(0,1,2,6)
Prove that,
𝐹1 (𝐴, 𝐵, 𝐶) + 𝐹2 (𝐴, 𝐵, 𝐶) = 1
C. Karnaugh map (K-map): (6 questions)
Solve the following Boolean expressions using 3-variable k-maps
11. 𝐹(𝐴, 𝐵, 𝐶) = ∑(0,1,5,7)
12. 𝐹(𝐴, 𝐵, 𝐶) = ∑(0,1,2,3,6,7)
13. 𝐹(𝐴, 𝐵, 𝐶) = ∑(3,5,6,7)
Solve the following Boolean expressions using 4-variable k-maps
14. 𝐹(𝐴, 𝐵, 𝐶, 𝐷) = ∑(1, 4, 5, 6, 12, 14, 15)
15. 𝐹(𝐴, 𝐵, 𝐶, 𝐷) = ∑(0, 1, 2, 4, 5, 7, 11, 15 )
16. 𝐹(𝐴, 𝐵, 𝐶, 𝐷) = ∑(0,2,4,5,6,7,8,10,13,15)
Find the prime implicants, essential prime implicants for the following 4-variable k-
map:
17. 𝐹(𝐴, 𝐵, 𝐶, 𝐷) = ∑(1, 3, 4,5 10,11,12,13,14,15)
For the students of CSE 207, section N
Prepared by: Dr. Rajendra Kumar