Number Representation MCQ Quiz - Objective Question with Answer for Number Representation - Download Free PDF
Last updated on May 6, 2025
Latest Number Representation MCQ Objective Questions
Number Representation Question 1:
What is the octal equivalent of (F3B1)16?
Answer (Detailed Solution Below)
Number Representation Question 1 Detailed Solution
The correct answer is 171661
Key Points
- To find the octal equivalent of a hexadecimal number, you can convert each hexadecimal digit to its binary equivalent and then group the binary digits into groups of three (since each octal digit represents three binary digits).
- Let's convert each hexadecimal digit of (F3B1)16 to binary:
- F = 1111
- 3 = 0011
- B = 1011
- 1 = 0001
- Now group the binary digits into sets of three:
- 1111 0011 1011 0001
- Now convert each set of three binary digits to octal:
- 001 111 001 110 110 001
- Combine these octal digits: 171661.
Therefore, the octal equivalent of (F3B1)16 is option 3) 171661.
Number Representation Question 2:
The range of integers that can be represented by a 2's complement number system is ________.
where is n is number of bits in number.
Answer (Detailed Solution Below)
Number Representation Question 2 Detailed Solution
Key Points
- In a 2's complement number system, the range of integers that can be represented depends on the number of bits, n.
- The most significant bit (MSB) in a 2's complement representation indicates the sign of the number.
- If the MSB is 0, the number is positive or zero. If the MSB is 1, the number is negative.
- The range of integers that can be represented with n bits in 2's complement is from -2n-1 to 2n-1 - 1.
- This range allows for an equal number of positive and negative values, with one additional value for negative numbers.
Important Points
- For example, with 8 bits (n=8), the range is from -128 to 127.
- Understanding the range of 2's complement numbers is crucial for tasks involving binary arithmetic and computer architecture.
Additional Information
- 2's complement representation simplifies the implementation of arithmetic operations in computer systems.
- It allows for the use of the same addition and subtraction circuits for both signed and unsigned integers.
- It is the standard method for representing signed integers in modern computing systems.
Number Representation Question 3:
Convert the decimal number 1234 to binary, octal, and hexadecimal. Which of the following options correctly represents these conversions?
Answer (Detailed Solution Below)
Number Representation Question 3 Detailed Solution
The correct answer is Option 1.
Key Points
- To convert the decimal number 1234 to binary, octal, and hexadecimal, we perform the following steps:
- Binary: Convert the decimal number to binary by continuously dividing by 2 and noting the remainders. The binary representation of 1234 is 10011010010.
- Octal: Convert the decimal number to octal by continuously dividing by 8 and noting the remainders. The octal representation of 1234 is 2322.
- Hexadecimal: Convert the decimal number to hexadecimal by continuously dividing by 16 and noting the remainders. The hexadecimal representation of 1234 is 4D2.
Additional Information
- Binary, octal, and hexadecimal are different numeral systems used in computing and digital electronics.
- Binary is a base-2 system, octal is a base-8 system, and hexadecimal is a base-16 system.
- These conversions are important for various applications, including computer programming, networking, and electronics.
- Understanding these conversions helps in debugging, memory addressing, and optimizing program performance.
Number Representation Question 4:
What is the decimal value of the binary number (101010)?
Answer (Detailed Solution Below)
Number Representation Question 4 Detailed Solution
To convert the binary number 101010 to decimal, you can use the positional value of each bit, which is based on powers of 2.
Calculation:
The binary number 101010 can be broken down as follows:
\(1 \times 2^5 + 0 \times 2^4 + 1 \times 2^3 + 0 \times 2^2 + 1 \times 2^1 + 0 \times 2^0\)
Calculating each term:
1 x 25 = 32
0 x 24 = 0
1 x 23 = 8
0 x 22 = 0
1 x 21 = 2
0 x 20 = 0
Summing it all up: 32 + 0 + 8 + 0 + 2 + 0 = 42
Conclusion:
The decimal value of the binary number 101010 is 42.
Number Representation Question 5:
What is the decimal value of the binary number (101010)?
Answer (Detailed Solution Below)
Number Representation Question 5 Detailed Solution
To convert the binary number 101010 to decimal, you can use the positional value of each bit, which is based on powers of 2.
Calculation:
The binary number 101010 can be broken down as follows:
\(1 \times 2^5 + 0 \times 2^4 + 1 \times 2^3 + 0 \times 2^2 + 1 \times 2^1 + 0 \times 2^0\)
Calculating each term:
1 x 25 = 32
0 x 24 = 0
1 x 23 = 8
0 x 22 = 0
1 x 21 = 2
0 x 20 = 0
Summing it all up: 32 + 0 + 8 + 0 + 2 + 0 = 42
Conclusion:
The decimal value of the binary number 101010 is 42.
Top Number Representation MCQ Objective Questions
Convert the hexadecimal number C6 to binary number.
Answer (Detailed Solution Below)
Number Representation Question 6 Detailed Solution
Download Solution PDFThe correct answer is 11000110
Key Points
- To convert the hexadecimal number C6 to a binary number, you can convert each hexadecimal digit to its 4-bit binary representation.
- C in hexadecimal is 12 in decimal, which is 1100 in binary.
- 6 in hexadecimal is 6 in decimal, which is 0110 in binary.
- So, the binary representation of C6 is 11000110.
Additional InformationHere are the decimal numbers 1 to 15 represented in both hexadecimal and binary forms:
- Decimal 1: Hexadecimal 1, Binary 0001
- Decimal 2: Hexadecimal 2, Binary 0010
- Decimal 3: Hexadecimal 3, Binary 0011
- Decimal 4: Hexadecimal 4, Binary 0100
- Decimal 5: Hexadecimal 5, Binary 0101
- Decimal 6: Hexadecimal 6, Binary 0110
- Decimal 7: Hexadecimal 7, Binary 0111
- Decimal 8: Hexadecimal 8, Binary 1000
- Decimal 9: Hexadecimal 9, Binary 1001
- Decimal 10: Hexadecimal A, Binary 1010
- Decimal 11: Hexadecimal B, Binary 1011
- Decimal 12: Hexadecimal C, Binary 1100
- Decimal 13: Hexadecimal D, Binary 1101
- Decimal 14: Hexadecimal E, Binary 1110
- Decimal 15: Hexadecimal F, Binary 1111
The 8-bit 2's complement form of the number -14 is ______.
Answer (Detailed Solution Below)
Number Representation Question 7 Detailed Solution
Download Solution PDFCalculation:
14 in binary form is represented as:
1410 = (00001110)2
Taking the 1's complement of the above, we get 11110001
Adding 1 to the 1's complement, we get the 2's complement representation of the number, i.e. 11110010
Since there is a 1 in the MSB, the number is a negative number with value -14.
∴ The 2's complement of -6410 contains 7 bits.
Which of the following pairs of octal and binary numbers are NOT equal?
Answer (Detailed Solution Below)
Number Representation Question 8 Detailed Solution
Download Solution PDFThe correct answer is (11010)2 = (62)8
Key Points
Binary numbers and octal numbers are both used in computing. They are different ways of representing the same value - just like how "10" and "ten" are different ways of expressing the same quantity in decimal.
- Each digit of an octal number represents three binary digits because 23 = 8. Here's the mapping:
- "000" => "0"
- "001" => "1"
- "010" => "2"
- "011" => "3"
- "100" => "4"
- "101" => "5"
- "110" => "6"
- "111" => "7"
- Now let's convert the binary numbers to their equivalent octal numbers.
- (111 110 111)2 = (7 6 7)8
- (110 110 101)2 = (6 6 5)8
- (10 101 . 110)2 = (2 5 . 6)8
- (11 010)2 = (3 2)8 - Corrupted as the corresponding octal number should be (32)8 instead of (62)8.
Therefore, the 4th pair, (11010)2 = (62)8, is not equal.
In 16-bit 2’s complement representation, the decimal number -28 is:
Answer (Detailed Solution Below)
Number Representation Question 9 Detailed Solution
Download Solution PDF
2 |
28 |
|
2 |
14 |
0 |
2 |
7 |
0 |
2 |
3 |
1 |
2 |
1 |
1 |
|
0 |
1 |
2810 = (11100)2 = (0000 0000 0001 1100)2
-2810 = 2’s complement of 0000 0000 0001 1100
2’s complement of 0000 0000 0001 1100 = 1111 1111 1110 0100
Note:
Tricks to find: 2’s complement
Start reading the bits from LSB (right hand side) and write it unless first 1 is encounter, leave the first 1 as it is and complement the remaining bits.What is the 2's complement of 0011 0101 1001 1100?
Answer (Detailed Solution Below)
Number Representation Question 10 Detailed Solution
Download Solution PDFConcept:
1's complement of Binary: 1's complement of a Binary number is defined by the value obtained by inverting all the bit, i.e, 0 as 1 and 1 as 0.
∴ 1's complement of 1100 0110 = 0011 1001
2's complement of Binary: It is the sum of 1's complement of Binary number and 1 to the least significant bit (LSB).
∴ 2's complement = 1's complement + 1 (LSB)
Calculation:
Given Binary Number,
0011 0101 1001 1100
1's complement = 1100 1010 0110 0011
2's complement = 1's complement + 1 (LSB)
Alternate Method
Note: A shortcut method of forming the 2's complement of a binary number is to copy bits from the right until a one-bit has been copied, then invert the remaining bits i.e, 0 as 1 and 1 as 0.
What is the octal equivalent of (F3B1)16?
Answer (Detailed Solution Below)
Number Representation Question 11 Detailed Solution
Download Solution PDFThe correct answer is 171661
Key Points
- To find the octal equivalent of a hexadecimal number, you can convert each hexadecimal digit to its binary equivalent and then group the binary digits into groups of three (since each octal digit represents three binary digits).
- Let's convert each hexadecimal digit of (F3B1)16 to binary:
- F = 1111
- 3 = 0011
- B = 1011
- 1 = 0001
- Now group the binary digits into sets of three:
- 1111 0011 1011 0001
- Now convert each set of three binary digits to octal:
- 001 111 001 110 110 001
- Combine these octal digits: 171661.
Therefore, the octal equivalent of (F3B1)16 is option 3) 171661.
The digits used in a binary number system are ____ and ____.
Answer (Detailed Solution Below)
Number Representation Question 12 Detailed Solution
Download Solution PDFThe correct answer is 0, 1
Key Points
- In binary, we’re only allowed two symbols: 0 and 1. But using those two symbols we can create any number that a decimal system can.
- Example: 0, 1, 10, 11, 100 ....
- The base of each number system is also called the radix.
- The radix of a decimal number is ten, and the radix of binary is two.
- The radix determines how many different symbols are required in order to flesh out a number system.
- In our decimal number system, we’ve got 10 numeral representations for values between nothing and ten somethings: 0, 1, 2, 3, 4, 5, 6, 7, 8, and 9.
- Each of those symbols represents a very specific, standardized value.
Which of the following represents 2's complement of -19?
Answer (Detailed Solution Below)
Number Representation Question 13 Detailed Solution
Download Solution PDFFind the 2s complement of (-19)10
Step 1 :Convert given decimal number into binary
(19)10 = (010011)2
Step 2: Take 1s complement of the binary number by converting 0 with 1 and vice-versa
1s complement : (101100)2
Step 3: Add 1 to 1s complement
101100 + 1 = 101101
Hence correct option is "4"
Important PointsTo find 2s complement quickly
Move from the right of the binary number to left , keep bits till first "1" as it is then complement each bit.
ex : (19)2 = 010011
2s complement : 101101
The range of signed decimal numbers that can be represented by 5 bits 1’s complement number is:
Answer (Detailed Solution Below)
Number Representation Question 14 Detailed Solution
Download Solution PDFConcept:
The range of n bit 1’s complement form is from:
–( 2n-1 -1) to + (2n-1 -1)
The range of n bit 2's complement is:
-2(n - 1) to 2(n - 1) - 1.
Calculation:
For 5 bits, The range of 1’s complement form is
– (2n-1 -1) to + (2n-1 -1)
-15 to 15
Given the following binary number in 32-bit (single precision) IEEE-754 format:
00111110011011010000000000000000
Answer (Detailed Solution Below)
Number Representation Question 15 Detailed Solution
Download Solution PDFConcept:
32-bit floating-point representation of a binary number in IEEE- 754 is
Sign (1 bit) |
Exponent (8 bit) |
Mantissa bit (23 bits) |
Calculation:
Given binary number is
00111110011011010000000000000000
Here, sign bit is 0. So, number is positive.
0 |
01111100 |
11011010000000000000000 |
Exponent bits = E = 01111100 = 124 (in decimal)
Mantissa bits M = 11011010000000000000000
In IEEE-754 format, 32-bit (single precision)
(-1)s × 1.M × 2E – 127
= (-1)0 × 1.1101101 × 2124 – 127
= 1.1101101 × 2-3
= (1 + 2-1 + 2-2 + 2-4 + 2-5 + 2-7) × 2-3