# Computer Arithmetic · Computer Organization · GATE CSE

Start Practice## Marks 1

GATE CSE 2012

The decimal value $$0.5$$ in $$IEEE$$ single precision floating point representation has

GATE CSE 2008

In the $$IEEE$$ floating point representation the hexadecimal value $$0\, \times \,00000000$$ corresponds to

GATE CSE 2004

What is the result of evaluating the following two expressions using three $$-$$ digit floating point arithmetic with rounding?
$$\eqalign{
& \l...

GATE CSE 2002

In $$2’s$$ complement addition, the overflow

GATE CSE 1997

An $$N$$-bit carry look ahead adder, where $$N$$ is a multiple of $$4,$$ employs $${\rm I}cs$$ $$74181$$ ($$4$$bit $$ALU$$) and $$74182$$ ($$4$$ bit c...

GATE CSE 1996

Both’s algorithm for integer multiplication gives worst performance when the multiplier pattern is

## Marks 2

GATE CSE 2014 Set 2

The value of a float type variable is represented using the single-precision $$32$$-bit floating point format of $$IEEE-754$$ standard that uses $$1$$...

GATE CSE 2007

In a look $$-$$ ahead carry generator, the carry generate function $${G_i}$$ and the carry propagate function $${P_i}$$ for inputs, $${A_i}$$ and $${B...

GATE CSE 2006

Given two three bit number $${a_2}{a_1}{a_0}$$ and $${b_2}{b_1}{b_0}$$ and $$c,$$ the carry in the function that represents the carry generate functi...

GATE CSE 2005

The data given below. Solve the problems and choose the correct answer.
Mantissa is a pure fraction in sign - magnitude form. The decimal number $$...

GATE CSE 2005

The data given below. Solve the problems and choose the correct answer.
The normalized representation for the above format is specified as follows....

GATE CSE 2004

$$A$$ $$4$$-bit carry look ahead adder, which adds two $$4$$-bit numbers, is designed using $$AND,$$ $$OR,$$ $$NOT,$$ $$NAND,$$ $$NOR$$ gates only. As...

GATE CSE 2003

The following is a scheme for floating point number representation using $$16$$ bits.
Let $$s, e,$$ and $$m$$ be the numbers represented in binary i...

GATE CSE 2002

Sign extension is the step in

GATE CSE 1999

The number of full and half-adders required to add 16-bit numbers is:

GATE CSE 1999

Booth’s coding in $$8$$ bits for the decimal number –$$57$$ is:

GATE CSE 1996

Consider the following floating point number representation
The exponent is in $$2’s$$ complement representation and mantissa is in the sign magnitu...

## Marks 5

GATE CSE 1990

State the Both's algorithm for multiplication of two numbers, Draw a block diagram for the implementation of the Booth's algorithm for determining the...