e = 1…254 → 2^−126 … 2^127 · max ≈ (2 − 2^−23)·2^127 ≈ 3.4×10^38
Double value
(−1)^s × (1 + f/2^52) × 2^(e − 1023)
Booth steps
n steps for n-bit multiplier; product needs 2n bits
Overflow detect
V = C_in(MSB) ⊕ C_out(MSB)
Decimal digits
n bits ≈ n × 0.301 decimal digits
What GATE asks from this
Question types seen repeatedly in past papers. More stars means more frequent.
★★★
IEEE 754: hex ↔ decimal
Given a 32-bit hex pattern, find the value; or represent a decimal such as −5.75 in IEEE format. Mind bias and hidden 1.
★★★
Range / overflow in 2's complement
Which operations overflow; value after adding two n-bit numbers; result of sign-extension or shift.
★★★
Booth multiplication trace
Content of A,Q registers after k steps, or number of add/sub operations.
★★★
Adder delay / carry-lookahead
Gate-delay of ripple vs CLA for n bits.
★★★
Floating-point properties
Smallest/largest, precision loss, ordering of FP numbers by bit pattern, effect of rounding or non-associativity.
Ratings are approximate, based on recurring patterns in past GATE CSE papers.
Previous year questions
19 real questions from the official GATE CSE papers (2012 to 2025), newest first, each with the official answer key and a worked solution. Questions are the property of the GATE organising institutes; this copy is for your personal study.
19 questions · 0 correct of 0 attempted · marks 0 / 25
Year:
GATE 2025 CS1 · Q25MSQ1 mark
The number −6 can be represented as 1010 in 4-bit 2's complement representation. Which of the following is/are CORRECT 2's complement representation(s) of −6?
One or more options may be correct. Select all that apply, then submit.
GATE 2025 CS2 · Q32NAT1 mark
The following two signed 2's complement numbers (multiplicand M and multiplier Q) are being multiplied using Booth's algorithm: M = 1100 1101 1110 1101 and Q = 1010 0100 1010 1010. The total number of addition and subtraction operations to be performed is ______ (answer in integer).
GATE 2025 CS2 · Q49MSQ2 marks
Three floating point numbers X, Y and Z are stored in registers RX, RY and RZ in IEEE 754 single precision format, in hexadecimal: RX = 0xC1100000, RY = 0x40C00000, RZ = 0x41400000. Which of the following option(s) is/are CORRECT?
One or more options may be correct. Select all that apply, then submit.
GATE 2024 CS1 · Q13MCQ1 mark
A system uses 5 bits for representing signed integers in 2's complement. Two integers A and B are represented as A = 01010 and B = 11010. Which one of the following operations will result in either an arithmetic overflow or an arithmetic underflow?
GATE 2024 CS2 · Q14MCQ1 mark
The format of a single-precision floating-point number as per IEEE 754 is Sign (1 bit), Exponent (8 bits), Mantissa (23 bits). Choose the largest floating-point number among the following options. (A) 0 | 01111111 | 11111111111111111111111 (B) 0 | 11111110 | 11111111111111111111111 (C) 0 | 11111111 | 11111111111111111111111 (D) 0 | 01111111 | 00000000000000000000000
GATE 2023 · Q45MCQ2 marks
Consider the IEEE-754 single precision floating point numbers P = 0xC1800000 and Q = 0x3F5C2EF4. Which one of the following corresponds to the product of these numbers (P × Q) in the IEEE-754 single precision format?
GATE 2022 · Q18MCQ1 mark
Let R1 and R2 be two 4-bit registers that store numbers in 2's complement form. For the operation R1 + R2, which one of the following values of R1 and R2 gives an arithmetic overflow?
GATE 2022 · Q41MCQ2 marks
Consider three floating point numbers A, B and C stored in registers RA, RB and RC as per IEEE-754 single precision format. RA = 0xC1400000, RB = 0x42100000, RC = 0x41400000. Which one of the following is FALSE?
GATE 2021 Set 1 · Q24NAT1 mark
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 ______.
GATE 2020 · Q29MCQ2 marks
Consider three registers R1, R2 and R3 that store numbers in IEEE-754 single precision floating point format. Assume that R1 and R2 contain the values (in hexadecimal notation) 0x42200000 and 0xC1200000, respectively. If R3 = R1 / R2, what is the value stored in R3?
GATE 2019 Set 2 · Q4MCQ1 mark
In 16-bit 2's complement representation, the decimal number −28 is:
GATE 2019 Set 2 · Q8MCQ1 mark
Consider Z = X − Y, where X, Y and Z are all in sign-magnitude form. X and Y are each represented in n bits. To avoid overflow, the representation of Z would require a minimum of:
GATE 2018 · Q33MCQ2 marks
Consider the unsigned 8-bit fixed point binary number representation b7 b6 b5 b4 b3 . b2 b1 b0, where the position of the binary point is between b3 and b2 (b7 is the most significant bit). Some of the decimal numbers listed below cannot be represented exactly in this representation: (i) 31.500 (ii) 0.875 (iii) 12.100 (iv) 3.001. Which one of the following statements is true?
GATE 2017 Set 1 · Q7MCQ1 mark
The n-bit fixed-point representation of an unsigned real number X uses f bits for the fraction part. Let i = n − f. The range of decimal values for X in this representation is
GATE 2017 Set 1 · Q9MCQ1 mark
When two 8-bit numbers A7…A0 and B7…B0 in 2's complement representation (with A0 and B0 as the least significant bits) are added using a ripple-carry adder, the sum bits obtained are S7…S0 and the carry bits are C7…C0. An overflow is said to have occurred if
GATE 2016 Set 1 · Q7NAT1 mark
The 16-bit 2's complement representation of an integer is 1111 1111 1111 0101; its decimal representation is ______.
GATE 2016 Set 1 · Q33MCQ2 marks
Consider a carry lookahead adder for adding two n-bit integers, built using gates of fan-in at most two. The time to perform addition using this adder is
GATE 2013 Code A · Q4MCQ1 mark
The smallest integer that can be represented by an 8-bit number in 2's complement form is
GATE 2012 Code A · Q7MCQ1 mark
The decimal value 0.5 in IEEE single precision floating point representation has
Extra practice (GATE-style)
More questions in the same formats, each with a full solution. These are original questions written to follow the patterns above, not past-paper questions.
5 questions · 0 correct of 0 attempted · marks 0 / 6
Q1NAT1 mark
The 32-bit pattern 0x41200000 is interpreted as an IEEE 754 single-precision number. Its decimal value is ____.
Q2NAT1 mark
In 8-bit 2's complement, −100 and −50 are added. The 8-bit result, read as a signed decimal, is ____.
Q3MCQ2 marks
Booth's algorithm multiplies by the 4-bit multiplier 0110. Counting from the right with Q₋₁ = 0, the operations performed are
Q4NAT1 mark
The unbiased exponent of the smallest positive normalised IEEE 754 single-precision number is ____.
Q5MCQ1 mark
In an 8-bit 2's complement system, which value has no positive counterpart?
Common traps
Stored exponent for 1.0 is 127 (0x3F800000), not 0.
Denormals have no hidden 1 and use exponent −126 (not −127).
−2^(n−1) has no positive counterpart in 2's complement.
Booth: the A register shifts arithmetically (sign preserved).