Recent questions tagged number-representation / GATE Overflow for GATE CSE

0 votes

1 answer

1

GATE CSE 2024 | Set 2 | Question: 4
The format of a single-precision floating-point number as per the $\text{IEEE 754}$ standard is: Sign Exponent Mantissa $(1 \mathrm{bit})$ $(8 \mathrm{bits})$ $(23 \mathrm{bits})$ Choose the largest floating- ... $0$ $11111111$ $11111111111111111111111$ Sign Exponent Mantissa $0$ $01111111$ $00000000000000000000000$

The format of a single-precision floating-point number as per the $\text{IEEE 754}$ standard is:Sign ExponentMantissa$(1 \mathrm{bit})$ $(8 \mathrm{bits})$ $(23 \ma...

Arjun

2.5k views

Arjun asked Feb 16

1 votes

1 answer

2

GATE CSE 2024 | Set 2 | Question: 39
Which of the following is/are EQUAL to $224$ in radix - $5$ (i.e., base - $5$) notation? $64$ in radix -10 $100$ in radix -8 $50$ in radix -16 $121$ in radix -7

Which of the following is/are EQUAL to $224$ in radix - $5$ (i.e., base - $5$) notation?$64$ in radix -10$100$ in radix -8$50$ in radix -16$121$ in radix -7

Arjun

1.8k views

Arjun asked Feb 16

4 votes

1 answer

3

GO Classes Test Series 2024 | Mock GATE | Test 14 | Question: 29
The largest positive number in 2's complement format represented with 8-bits is: $(\mathrm{FF})_{16}$ $(128)_{10}$ $(777)_8$ $(01111111)_2$

The largest positive number in 2's complement format represented with 8-bits is:$(\mathrm{FF})_{16}$$(128)_{10}$$(777)_8$$(01111111)_2$

GO Classes

502 views

GO Classes asked Feb 5

5 votes

2 answers

4

GO Classes Test Series 2024 | Mock GATE | Test 14 | Question: 61
According to the IEEE standard, a 32-bit, single-precision, floating-point number $N$ is defined to be $ N=(-1)^S \times 1 . F \times 2^{E-127} $ where $S$ is the sign bit, $F$ the fractional mantissa, and $E$ the biased exponent. A floating- ... $\left(1-2^{-23}\right) * 2^{128}$ $\left(1+\left(1-2^{-23}\right)\right) * 2^{128}$

According to the IEEE standard, a 32-bit, single-precision, floating-point number $N$ is defined to be$$N=(-1)^S \times 1 . F \times 2^{E-127}$$where $S$ is the sign bit,...

GO Classes

616 views

GO Classes asked Feb 5

5 votes

1 answer

5

GO Classes Test Series 2024 | Mock GATE | Test 13 | Question: 29
In two's complement, what is the minimum number of bits needed to represent the numbers $-1$ and the number $1$ respectively? $1$ and $2$ $2$ and $2$ $2$ and $1$ $1$ and $1$

In two's complement, what is the minimum number of bits needed to represent the numbers $-1$ and the number $1$ respectively?$1$ and $2$$2$ and $2$$2$ and $1$$1$ and $1$

GO Classes

514 views

GO Classes asked Jan 28

9 votes

2 answers

6

GO Classes Test Series 2024 | Mock GATE | Test 13 | Question: 53
Suppose we use $\textsf{IEEE-754}$ single precision floating point format to represent the numbers in binary. What will be the hexadecimal representation of $-2^{-146}?$ $\textsf{0x80000004}$ $\textsf{0x80000008}$ $\textsf{0x80000010}$ $\textsf{0x80000002}$

Suppose we use $\textsf{IEEE-754}$ single precision floating point format to represent the numbers in binary. What will be the hexadecimal representation of $-2^{-146}?$$...

GO Classes

827 views

GO Classes asked Jan 28

5 votes

1 answer

7

GO Classes Test Series 2024 | Mock GATE | Test 13 | Question: 58
Your code is required to perform the function $(\text{M}\%16) \ast 3.$ What should you do to eliminate multiplication ($\ast$) and mod($\%$), assuming $\mathrm{M}$ is $32$ bits wide? shift $\text{M}$ right by $4,$ ... $0000000 \mathrm{Fh}$, save the result, shift result left by $2,$ and add the saved result to current result.

Your code is required to perform the function $(\text{M}\%16) \ast 3.$ What should you do to eliminate multiplication ($\ast$) and mod($\%$), assuming $\mathrm{M}$ is $32...

GO Classes

434 views

GO Classes asked Jan 28

4 votes

1 answer

8

GO Classes Test Series 2024 | Mock GATE | Test 11 | Question: 17
Consider the bit pattern $10110110.$ Interpret this bit pattern as a $8$-bit $2$'s complement number. What is the largest magnitude negative number that can be added to this value without causing $8$-bit $2$'s complement overflow? (Write your answer in decimal, only the magnitude, not the sign)

Consider the bit pattern $10110110.$ Interpret this bit pattern as a $8$-bit $2$'s complement number. What is the largest magnitude negative number that can be added to t...

GO Classes

592 views

GO Classes asked Jan 13

0 votes

1 answer

9

GATE 2018 MOCK | GFG | Digital Logic
IEEE Standard 754 floating point is the most common representation today for real numbers on computers. The diagram below shows these parts are store--d in memory: The IEEE 754 standard includes special cases for numbers that are difficult to represent, ... $+/-$ Denormalized number (C) Code-3 represented $+/-$ Infinity (D) Code-4 represented number Zero

IEEE Standard 754 floating point is the most common representation today for real numbers on computers. The diagram below shows these parts are store d in memory:The IEEE...

rajveer43

153 views

rajveer43 asked Jan 12

3 votes

1 answer

10

madeeasy
The decimal equivalent of given 2’s complement number $(110101011.1101)_2$ is:

The decimal equivalent of given 2’s complement number $(110101011.1101)_2$ is:

nihal_chourasiya

395 views

nihal_chourasiya asked Nov 1, 2023

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true