Tutorials-2

1. Consider an arbitrary number system with the independent digits as 0, 1 and X. What is
the radix of this number system? List the first 10 numbers in this number system.
2. The decimal equivalent of the binary number (1001.0101)2
3. The decimal equivalent of the octal number (137.21)8 is
4. The decimal equivalent of the hexadecimal number (1E0.2A)16 is
5. Find the decimal equivalent of the following binary numbers expressed in the 2’s
complement format: (a) 00001110; (b) 10001110.
6. Find the binary equivalent of (13.375)10.
7. Find the octal equivalent of (73.75)10
8. Determine the hexadecimal equivalent of (82.25)10
9. Find the binary equivalent of (374.26)8 and the octal equivalent of (1110100.0100111)2
10. Find the binary equivalent of (17E.F6)16 and the hex equivalent of
(1011001110.011011101)2.
11. Find the octal equivalent of (2F.C4)16 and the hex equivalent of (762.013)8
12. Assume an arbitrary number system having a radix of 5 and 0, 1, 2, L and M as its
independent digits. Determine:
(a) The decimal equivalent of (12LM.L1);
(b) The total number of possible four-digit combinations in this arbitrary number
system.
13. Determine the floating-point representation of (−142) 10 using the IEEE single-precision
format.
14. Determine the equivalent decimal numbers for the following floating-point numbers:
(a) 00111111 01000000 00000000 00000000 (IEEE-754 single-precision format);
(b) 11000000 00101001 01100……45 0s (IEEE-754 double-precision format).
15. Two possible binary representations of (−1) 10 are (10000001)2 and (11111111)2. One of
them belongs to the sign-bit magnitude format and the other to the 2’s complement
format. Identify.
16. Assume a radix-32 arbitrary number system with 0–9 and A–V as its basic digits. Express
the mixed binary number (110101.001)2 in this arbitrary number system.
17. What is meant by the radix or base of a number system? Briefly describe why hex
representation is used for the addresses and the contents of the memory locations in the
main memory of a computer.
18. What do you understand by the l’s and 2’s complements of a binary number? What will
be the range of decimal numbers that can be represented using a 16-bit 2’s complement
format?
19. Briefly describe the salient features of the IEEE-754 standard for representing floating-
point numbers.
20. Why was it considered necessary to carry out a revision of the IEEE-754 standard? What
are the main features of IEEE-754r (the notation for IEEE-754 under revision)?
21. In a number system, what decides (a) the place value or weight of a given digit and (b)
the maximum numbers representable with a given number of digits?
22. In a floating-point representation, what represents (a) the range of representable numbers
and (b) the precision with which a given number can be represented?
23. Why is there a need to have floating-point standards that can take care of decimal data
and decimal arithmetic in addition to binary data and arithmetic?
24. How many bits would be required to encode decimal numbers 0 to 9999 in straight binary
and BCD codes? What would be the BCD equivalent of decimal 27 in 16-bit
representation?
25. Perform the following addition operations:
a. (275.75)10+ (37.875)10
b. (AF1.B3)16+ (FFF.E)16
26. Find out whether 16-bit 2’s complement arithmetic can be used to add 14,276 and 18,490.
27. 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.
28. Subtract (1110.011)2 from (11011.11)2 using basic rules of binary subtraction and verify
the result by showing equivalent decimal subtraction.
29. Subtract (a) (−64)10 from (+32)10 and (b) (29.A)16 from (4F.B)16. Use 2’s complement
arithmetic.
30. Add (a) (39)10 and (19)10 and (b) (1E)16 and (F3)16 using floating-point numbers. Verify the
answers by performing equivalent decimal addition.
31. Subtract (17)8 from (21)8 using floating-point numbers and verify the answer.
32. Outline the different steps involved in the addition of larger-bit binary numbers for the
following two cases: (a) The larger of the two numbers is positive and the other number is
negative. (b) The larger of the two numbers is negative and the other number is positive.
33. Outline the different steps involved in the subtraction of larger-bit binary numbers for the
following two cases: (a) The minuend is positive. The subtrahend is negative and smaller
in magnitude. (b) The minuend is positive. The subtrahend is negative and larger in
magnitude.
34. What decides whether a particular binary addition or subtraction operation would be
possible with 2’s complement arithmetic?
35. Why in microprocessors and microcomputers is the ‘repeated add and right-shift’
algorithm preferred over the ‘repeated left-shift and add’ algorithm for binary
multiplication? Briefly outline the procedure for multiplication in the case of the former.
36. How would you hardware-implement a four-input OR gate using two-input OR gates
only?
37. Show the logic arrangement for implementing a four-input AND gate using two-input
AND gates only.
38. How can you implement a NOT circuit using a two-input EX-OR gate?
39. What are Universal Gates? List them.
40. Identify the practical application of the OR gate shown in the industrial plant bellow:
41. Write the output for a given logic circuit (Consider the current state of the output is 1)

42. Draw the truth table of the logic circuit shown in Fig

43. Find (a) the dual of AB’ +BC’ +CD’ and (b) the complement of [(A.B’ +C’).D+E’]F.
44. Simplify:
45. Prove that

Can be simplified to AB.

48. Write the simplified Boolean expression given by the Karnaugh map shown in Fig.

49. Simplify the following Boolean expressions:

Questions from 1 to 51: refer Digital Electronics by Anil K Maini.

52. Simplify the Boolean function

53. Simplify the Boolean function