Professional Documents
Culture Documents
com
www.GATEpaper.in
www.SatishKashyap.com
7. Perform following subtraction using 15’s complement method
a. FA64 – 12AB
b. 357F – 4AC5
10. For the signed Decimal numbers, fill the table using 8-bit representation.
11. Find the equivalent Hamming code for 4 bit Excess – 3 codes.
12. Find the required extra bit to maintain odd parity/even parity for given 8 bit messages.
www.GATEpaper.in
www.SatishKashyap.com
1. The truth table shown may expressed by which of the following canonical
representations?
2. A B C | F
3. ---------+----
4. 0 0 0 | 0
5. 0 0 1 | 0
6. 0 1 0 | 1
7. 0 1 1 | 0
8. 1 0 0 | 1
9. 1 0 1 | 0
10. 1 1 0 | 1
11. 1 1 1 | 0
1. SUM m(2,4,6)
2. PRD M(2,4,6)
3. SUM m(0,1,3,5,7)
4. PRD M(1,3,5,7)
5. None of the above
2. The truth table shown may be expressed by which of the following canonical
expressions?
1. A B C | F
1. ---------+----
12. 0 0 0 | 1
13. 0 0 1 | 0
14. 0 1 0 | 1
15. 0 1 1 | 1
16. 1 0 0 | 0
17. 1 0 1 | 0
18. 1 1 0 | 1
19. 1 1 1 | 0
20.
1. SUM m(1,4,5,7)
2. PRD M(0,2,3,6)
3. SUM m(0,1,2,3,6)
4. PRD M(1,4,5,7)
5. SUM m(0,2,3,5)
6. m3
7. m4
8. M3
9. M4
10. m5
www.GATEpaper.in
www.SatishKashyap.com
11. 6
12. 31
13. 3
14. 4
15. 5
16. F = m0
17. F = M0
18. F = m7
19. F = M7
20. F = M3
22. Given that F = SUM m(0,2,4,6), which of the following correctly describes
F'?
1. F' = PRD M(0,2,4,6)
2. F' = PRD M(1,2,4,6)
3. F' = PRD M(1,3,5,7)
4. F' = SUM m(0,1,2,3)
5. F' = SUM m(0,2,4,6)
24. Given that F1 = SUM m(0,1,2) and F2 = PRD M(2,3,4,5), which of the
following represent the only correct expression for F1 + F2?
1. F1 + F2 = SUM m(0,1,2,3,4,5)
2. F1 + F2 = SUM m(0,1,2,6,7)
3. F1 + F2 = SUM m(0,1,6,7)
4. F1 + F2 = PRD M(0,1,3,4,5)
5. F1 + F2 = PRD M(2,3,4,5,6,7)
25. Given that F1 = SUM m(1,2,4,6,7) and F2 = PRD M(3,5,6) which of the
following represent the only correct expression for F1*F2?
1. F1*F2 = PRD M(0,3,5,6)
2. F1*F2 = SUM m(1,3,5,7)
3. F1*F2 = SUM m(0,3,5,6)
4. F1*F2 = PRD M(1,2,4,7)
5. F1*F2 = PRD M(2,4,6,7)
26. (mi)' + Mi = ?
1. 1
2. 0
3. mi
4. Mi
5. mi + (Mi)'
www.GATEpaper.in
www.SatishKashyap.com
This quiz is designed to give you practice in simplifying Boolean expressions through the use
of K-Maps. Read the appropriate sections in the text and answer the
questions below.
www.GATEpaper.in
www.SatishKashyap.com
6. Identify the simplest POS expression which generates the K-
map shown.
1. (A+C')(A+B+C)
2. (A+B)(A+C')(B+C')
3. (A'+B')(A'+C)(B'+C)
4. (A'+C)(A'+B'+C')
5. (A+B)(A'+C)(B'+C)
10. The most reduced expression which can be obtained from the
K-map illustrated is:
1. BD + A'B'CD' + AB'C
2. BD + B'CD'
3. C'D' + CD
4. B'D' + BD
5. none of the above
www.GATEpaper.in
www.SatishKashyap.com
11. The most reduced expression which can be obtained from the
K-map illustrated is:
1. A + D
2. C
3. A + B
4. A
5. A + B + D
12. The most simple expression which can be obtained from the
K-map illustrated is:
1. 1
2. 0
3. A'
4. B'D'
5. A'C
www.GATEpaper.in