Scribd
Upload
220 views

Questions DE-1

This document provides examples of number conversion between different number systems including binary, decimal, octal, and hexadecimal. It also includes examples of arithmetic operations like addition, subtraction using different number representations and signed number conversions between sign-magnitude, 1's complement, and 2's complement forms. Finally, it discusses conversions between binary coded decimal (BCD), excess-3 code and Gray code alongside arithmetic operations using these codes.

Uploaded by

Riddhesh Patil
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
220 views

Questions DE-1

This document provides examples of number conversion between different number systems including binary, decimal, octal, and hexadecimal. It also includes examples of arithmetic operations like addition, subtraction using different number representations and signed number conversions between sign-magnitude, 1's complement, and 2's complement forms. Finally, it discusses conversions between binary coded decimal (BCD), excess-3 code and Gray code alongside arithmetic operations using these codes.

Uploaded by

Riddhesh Patil
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/ 9

Unit – I : Number System

Number Conversion
1. Convert following decimal numbers into Binary, Octa-decimal, Hexa-decimal numbers
a) 58
b) 72
c) 126
d) 234
e) 510
f) 1300
2. Convert following Binary numbers into Decimal, Octa-decimal, Hexa-decimal numbers
a) 1101101010
b) 101011
c) 101110110001
d) 111110000100
e) 100100010000100101
3. Convert following Octa-decimal numbers into Decimal, Binary, Hexa-decimal numbers
a) 254
b) 72
c) 564
d) 732
e) 25356
f) 77752
4. Convert following Hexa-decimal numbers into Decimal, Binary, Octa-decimal numbers
a) 5896
b) A58B27
c) DE587C
d) A584CDE
e) 589ABE45
f) ABCDE
5. Convert following numbers into respective number system
a) (89ADEC45)16 = ( )12
b) (57AD4C45)16 = ( )14
c) (8985245)10 = ( )16
d) (120120121)3 = ( )2
e) (999857789)10 = ( )20

Addition
6. Perform the following addition operations:
a) (275.75)10 + (37.875)10
b) (AF1.B3)16 + (FFF.E)16
c) (89AB.B3)16 + (8952.567)10
d) (275)10 + (75)16 + (275)8
e) (11011010011101)2 + (9584)10 + (AE58)16 + (57645)8
f) (1101101111101)2 + (9584)11 + (AE58)16 + (57645)9
g) (9584)12 + (85758)13 + (57645)14

Sign Number
7. Convert following numbers into 6-bit sign number presentation
a) +24
b) -18
c) -8
d) +31
e) -30
8. Convert following numbers into 6-bit 1s complement presentation
a) +24
b) -19
c) +12
d) -31
e) +29
f) -1
9. Convert following numbers into 6-bit 2s complement presentation
a) -32
b) -64
c) -63
d) +32
e) +28
f) +1
10. Consider the signed binary number 10111011. What is the decimal equivalent of this number
if it is in signed-magnitude form or in 1’s complement form or in 2’s complement form?

Subtraction
11. Add −118 and −32 firstly using eight-bit 2’s complement arithmetic and then using 16-bit 2’s
complement arithmetic. Comment on the results.
12. Subtract (1110.011)2 from (11011.11)2 using basic rules of binary subtraction and verify the
result by showing equivalent decimal subtraction.
13. Subtract (a) (−64)10 from (+32)10 and (b) (29.A)16 from (4F.B)16. Use 2’s complement
arithmetic.
14. Subtract 284 to 491 firstly using 16-bit 2’s complement arithmetic and then using 16-bit 2’s
complement arithmetic.
15. Perform the following operations using 2’s complement arithmetic:
a) (+43)10 − (−53)10.
b) (1ABC)16 + (1DEF)16.
c) (3E91)16 − (1F93)16.
16. Subtract 52 to 40 firstly using 10-bit 2’s complement arithmetic and then using 10-bit 2’s
complement arithmetic.
17. Perform the following subtraction using 2s complement form
a) (275.75)8 - (37.875)16
b) (AF1.B3)16 - (8FF.E)16
c) (89AB.B3)16 + (9952.567)10
d) (775.75)8 - (72.85)16
e) (5BF1.A5)16 - (68FC.B)16
f) (89AB.B3)16 + (7952.567)14

BCD, Excess – 3, and Gray Code


18. Convert following numbers into respective codes
a) (8AEC5)16 = ( )BCD
b) (5AD4C5)16 = ( )BCD
c) (85245)10 = ( )BCD
d) (120120121)3 = ( )BCD
e) (989)10 = ( )XS – 3
f) (A5BC)10 = ( )XS – 3
g) (539)10 = ( )XS – 3
h) (469)10 = ( )XS – 3
19. Convert following Binary numbers into Gray-codes
a) 10111101
b) 01000101
c) 11110110
d) 11111000
e) 11001100
f) 10101010
20. Convert following Gray-code into Binary number
a) 10111101
b) 01000101
c) 11110110
d) 11111000
e) 11001100
f) 10101010
21. Perform following addition using BCD codes
a) (275.75)10 + (37.85)10
b) (981.75)10 + (527.85)10
c) (11001100.101010)2 + (001100110.10100)2
d) (10111001100.101110)2 + (1001001100110.10101)2
e) (11001001101.101010)2 + (11001011110.110011)2
f) (10000111101.111110)2 + (11100011010.1101001)2
22. Perform following addition using Excess-3 codes
a) (275.75)10 + (37.85)10
b) (981.75)10 + (527.85)10
c) (11001100.101010)2 + (001100110.10100)2
d) (10111001100.101110)2 + (1001001100110.10101)2
e) (11001001101.101010)2 + (11001011110.110011)2
f) (10000111101.111110)2 + (11100011010.1101001)2
23. Perform following subtraction using BCD codes 9s complement
a) (175.55)10 - (37.85)10
b) (681.75)10 - (527.85)10
c) (11001100.101010)2 - (001100110.10100)2
d) (10111001100.101110)2 - (1001001100110.10101)2
e) (11001001101.101010)2 - (11001011110.110011)2
f) (10000111101.111110)2 - (11100011010.1101001)2
24. Perform following subtraction using XS - 3 codes 9s complement
a) (575.75)10 - (37.85)10
b) (581.75)10 - (527.85)10
c) (11001100.101010)2 - (001100110.10100)2
d) (10111001100.101110)2 - (1001001100110.10101)2
e) (11001001101.101010)2 - (11001011110.110011)2
f) (10000111101.111110)2 - (11100011010.1101001)2
25. Add (0011 0101 0110) BCD and (0101 0111 1001) BCD using the excess-3 addition method and
verify the result using equivalent decimal addition.
26. Perform (185) 10 −(8)10 using the excess-3 code.
27. Let A = 1111 1011 and B = 0000 1011 be two 8-bit signed 2’s complement numbers. What
will be the product in 2’s complement representation?
General Questions
28. Find the value of r, for which SQRT [(224) r] = (13)r is valid expression.
29. Find 15’s complement of (C A F A) 16
30. The operation 35 + 26 = 63 is true in number system with radix x. Find value of x.
31. Given the two binary numbers X = 1010100 and Y = 1000011, perform the subtraction (a) X
- Y and (b) Y - X by using 2's complements.
32. (a) Find the 16's complement of BZFA.
(b) Convert B2FA to binary.
33. The two numbers represented in signed 2’s complement form are P = 11101101 and Q =
11100110. If Q is subtracted from P, the value obtained in signed 2’s complement form is----
34. Let A = 1111 0011 and B = 0110 1011 be two 8-bit signed 2’s complement numbers. What
will be the product in 2’s complement representation?

Unit – II : Boolean Algebra


1. Find the dual of F = xy + xz + yz is?
2. Find the minimal expression
Sm (1, 5, 6, 12, 13, 14) + d (2, 4)
3. Find the minimal expression for Sm (1, 2, 4, 6, 7) and implement it using basic gates.
4. Find the minimal expression for
Sm (2,3,6,7,8,10,11,13,14)
5. Three Boolean functions are defined as f1 = Sm (0, 1, 3, 5, 6), f2 = Sm (4, 6, 7), and f3 =
Sm(1, 4, 5, 7). Find f.
6. What is the literal count for the minimized SOP and minimized POS form for the function?
f(A, B, C, D) = Sm(0, 1, 2, 5, 12) + f d(7, 8, 10, 13, 15)
7. How many number of NAND gates are required to implement F(A, B, C) = AB + BC + AC?
8. Find the number of NAND gates required for the implementation of f(A, B) = A+ BC is….
9. How many number of NOR gates are required to implement f = A + BC?
10. How many number of 2 input NAND/NOR gates are required to implement 3 input
NAND/NOR gates, respectively?
11. Find the minimized expression of

12. Simplify the Boolean function, x y + x’z + y z


13. The output of the given circuit is equal to

14. The circuit shown in the figure is functionally equivalent to

15. In the figure shown, y2, y1, and y0 will be 1’s complement of x2, x1, and x0 if z = ?
16. The output y of the circuit shown in the figure is….

17. Simplify the following function

18. The output of the following circuit is…..

19. For the logic circuit shown in figure, the simplified Boolean expression for the output y is ….
20. The standard form of expression AB + ACD + AC is…..
21. Find the function represented by the figure

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy