Let the representation of a number in base 3 be 210. What is the hexadecimal representation of the number?
Show Hint
- 15
- 21
- D2
- 528
The Correct Option is A
Solution and Explanation
Step 1: Convert the base-3 number to decimal.
The given number is (210)3.
(210)3 = 2 × 32 + 1 × 31 + 0 × 30
= 18 + 3 + 0 = 21
Step 2: Convert the decimal number to hexadecimal.
Convert 2110 to base 16:
21 = 1 × 16 + 5
Hence, the hexadecimal representation is (15)16.
Final Conclusion:
The hexadecimal equivalent of (210)3 is:
15
Top Questions on Number Representations
Assume that a 12-bit Hamming codeword consisting of 8-bit data and 4 check bits is $d_8 d_7 d_6 d_5 c_8 d_4 d_3 d_2 c_4 d_1 c_2 c_1$, where the data bits and the check bits are given in the following tables. Which one of the following choices gives the correct values of $x$ and $y$?
- GATE CS - 2021
- Digital Logic
- Number Representations
- Consider the following representation of a number in IEEE 754 single-precision floating point format with a bias of 127.
\[ S : 1 E : 10000001 F : 11110000000000000000000 \] Here \( S \), \( E \), and \( F \) denote the sign, exponent, and fraction components of the floating-point representation.
The decimal value corresponding to the above representation (rounded to 2 decimal places) is \(\underline{\hspace{2cm}}\).- GATE CS - 2021
- Digital Logic
- Number Representations
If \( x \) and \( y \) are two decimal digits and \( (0.1101)_2 = (0.8xy5)_{10} \), the decimal value of \( x + y \) is \(\underline{\hspace{2cm}}\).
- GATE CS - 2021
- Digital Logic
- Number Representations
- Want to practice more? Try solving extra ecology questions todayView All Questions
Questions Asked in GATE CS exam
A database has 25,000 fixed-length records of 100 bytes (primary key 15 bytes). The data file is block-aligned so each record is fully contained within a block. The file is indexed by a primary index file, also block-aligned and ordered. Block size is 1024 bytes and a block pointer is 5 bytes. Each index entry stores the block’s anchor key (15 bytes) and a pointer (5 bytes). Binary search on an index file of \(b\) blocks needs \(\lceil \log_2 b \rceil\) block accesses in the worst case. Given a key, the number of block accesses required to identify the data file block that may contain the record, in the worst case, is ____________.
- GATE CS - 2023
- Database Management Systems