NEW
New Website Launch
Experience the best way to solve previous year questions with mock tests (very detailed analysis), bookmark your favourite questions, practice etc...
VISIT NOW

GATE CSE

Computer Arithmetic

Computer Organization

Previous Years Questions

Marks 1

More
The decimal value $$0.5$$ in $$IEEE$$ single precision floating point representation has
GATE CSE 2012
In the $$IEEE$$ floating point representation the hexadecimal value $$0\, \times \,00000000$$ corresponds to
GATE CSE 2008
What is the result of evaluating the following two expressions using three $$-$$ digit floating point arithmetic with ro...
GATE CSE 2004
In $$2’s$$ complement addition, the overflow
GATE CSE 2002
An $$N$$-bit carry look ahead adder, where $$N$$ is a multiple of $$4,$$ employs $${\rm I}cs$$ $$74181$$ ($$4$$bit $$ALU...
GATE CSE 1997
Both’s algorithm for integer multiplication gives worst performance when the multiplier pattern is
GATE CSE 1996

Marks 2

More
The value of a float type variable is represented using the single-precision $$32$$-bit floating point format of $$IEEE-...
GATE CSE 2014 Set 2
In a look $$-$$ ahead carry generator, the carry generate function $${G_i}$$ and the carry propagate function $${P_i}$$ ...
GATE CSE 2007
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 repres...
GATE CSE 2006
The data given below. Solve the problems and choose the correct answer. The normalized representation for the above f...
GATE CSE 2005
The data given below. Solve the problems and choose the correct answer. Mantissa is a pure fraction in sign - magnitu...
GATE CSE 2005
$$A$$ $$4$$-bit carry look ahead adder, which adds two $$4$$-bit numbers, is designed using $$AND,$$ $$OR,$$ $$NOT,$$ $$...
GATE CSE 2004
The following is a scheme for floating point number representation using $$16$$ bits. Let $$s, e,$$ and $$m$$ be the n...
GATE CSE 2003
Sign extension is the step in
GATE CSE 2002
Booth’s coding in $$8$$ bits for the decimal number –$$57$$ is:
GATE CSE 1999
The number of full and half-adders required to add 16-bit numbers is:
GATE CSE 1999
Consider the following floating point number representation The exponent is in $$2’s$$ complement representation and m...
GATE CSE 1996

Marks 5

More
State the Both's algorithm for multiplication of two numbers, Draw a block diagram for the implementation of the Booth's...
GATE CSE 1990

Joint Entrance Examination

JEE Main JEE Advanced WB JEE

Graduate Aptitude Test in Engineering

GATE CSE GATE ECE GATE EE GATE ME GATE CE GATE PI GATE IN

Medical

NEET

CBSE

Class 12