Data representation: number systems, fixed and floating point representation, complements, error-detection codes and computer arithmetic algorithms. - One Line Questions

1. What is the typical range of values for the exponent field in IEEE 754 single-precision floating-point representation (before bias)? — -128 to 127
2. If a data stream is 1011001 and an odd parity bit is used, what would be the parity bit? — 1
3. If a system uses even parity and transmits the byte 11001010, what would be the parity bit added? — 0
4. Consider the decimal number 15. What is its representation in one's complement using 8 bits? — 00001111
5. What is the result of the one's complement of the binary number 101101? — 010010
6. Perform subtraction using two's complement: 1010 - 0101 (assuming 4-bit representation). — 0101
7. What is the result of adding binary numbers 1011 and 0101? — 10000
8. Which of the following binary numbers has an odd number of 1s? — 1000001
9. What is the result of the binary division 1101 / 10? — 110 with remainder 1
10. Convert the decimal number 25 to its binary representation. — 11001
11. What is the result of the binary multiplication 110 * 101? — 100010
12. What is the two's complement representation of -5 in an 8-bit system? — 11111011
13. What is the bias value used in IEEE 754 single-precision floating-point representation? — 127
14. Consider the binary number 1101. What is its octal equivalent? — 13
15. Convert the binary number 10110 to its decimal equivalent. — 22
16. In the IEEE 754 single-precision floating-point format, how many bits are typically used for the exponent? — 8
17. Convert the binary number 111010 to its hexadecimal equivalent. — 3E
18. What is the decimal value of the hexadecimal number 3A? — 58
19. What is the decimal value of the octal number 72? — 58
20. What is the base of the binary number system? — 2
21. In the IEEE 754 single-precision floating-point format, how many bits are typically used for the mantissa (significand)? — 23
22. What is an 'even parity' bit? — A bit added to make the total number of 1s even
23. What is a 'normalized' floating-point number? — A number where the leading digit of the mantissa is non-zero
24. What is a 'bias' in floating-point representation? — A value added to the exponent to ensure it's always positive
25. In a fixed-point representation, where is the binary point assumed to be located? — Always at the rightmost end of the number
26. In one's complement, how is the negative of a number represented? — By inverting all the bits
27. Which number system is natively used by computers for all internal operations? — Binary
28. Which number system is often used as a shorthand for binary due to its relationship (3 bits per octal digit)? — Octal
29. Which of the following is a method to represent numbers that can be very large or very small with a limited number of bits, sacrificing some precision? — Floating-point representation
30. Which standard defines the format for floating-point numbers in most modern computers? — IEEE 754
31. How do you obtain the two's complement of a binary number? — Invert all bits and add 1
32. What is the main drawback of one's complement representation? — It has two representations for zero (+0 and -0)
33. What does the 'guard bit' do in certain arithmetic algorithms? — It helps in rounding during operations like addition and subtraction
34. Which number system uses digits 0-9 and letters A-F? — Hexadecimal
35. Which arithmetic algorithm is commonly used for fast multiplication of binary numbers? — Booth's Multiplication Algorithm
36. Which of the following is a common method for representing signed integers in computers? — All of the above
37. Which representation method is most commonly used for signed integers due to its efficient arithmetic operations? — Two's Complement
38. What is the primary advantage of using CRC (Cyclic Redundancy Check) over simple parity bits? — Can detect more complex error patterns, including burst errors
39. What is the primary advantage of using two's complement over sign-magnitude for arithmetic? — Eliminates the need for separate addition and subtraction circuits
40. In Booth's multiplication algorithm, what action is taken when the current and previous bits of the multiplier are '01'? — Add multiplicand
41. What is the range of numbers representable by a fixed-point system limited by? — The total number of bits and the position of the binary point
42. In floating-point representation, what does the 'mantissa' (or significand) represent? — The significant digits of the number
43. What is the 'exponent' in floating-point representation? — Determines the position of the binary point
44. What is the purpose of the 'sign bit' in sign-magnitude representation? — To indicate whether the number is positive or negative
45. What is the purpose of a 'carry-lookahead adder'? — To speed up the addition process by anticipating carries
46. What is the primary goal of using fixed-point representation? — To simplify hardware implementation for arithmetic operations
47. What is a 'checksum' used for in data communication? — To detect errors by summing up data segments
48. Which of the following is a method used for detecting errors in data transmission or storage? — Parity Check
49. In the context of computer arithmetic, what is an 'overflow'? — When the result of an operation exceeds the maximum representable value
50. What does the special exponent value of all 1s in IEEE 754 represent? — Infinity or NaN (Not a Number)
All One Line Questions
E-Book Data representation: number systems, fixed and floating point representation, complements, error-detection codes and computer arithmetic algorithms. Online Test Data representation: number systems, fixed and floating point representation, complements, error-detection codes and computer arithmetic algorithms. Question Bank Data representation: number systems, fixed and floating point representation, complements, error-detection codes and computer arithmetic algorithms.