Aspire Faculty ID #12067 · Topic: CUET 2025 · Just now
CUET 2025

Which of the following statement is true about IEEE754 representation of +0 and -0?

Solution

EEE-754 Floating-Point Standard (+0 vs −0)

  • +0 and −0 are distinct bit patterns in IEEE-754.

  • They differ only in the sign bit:

    • +0 → sign bit = 0, exponent = all 0s, mantissa = all 0s.

    • −0 → sign bit = 1, exponent = all 0s, mantissa = all 0s.

  • The exponent and mantissa fields are identical (all zeros).

  • Mathematically, +0 and −0 compare equal, but they behave differently in some operations (e.g., 1/(+0) = +∞, 1/(−0) = −∞).

← Previous Next →

Previous 10 Questions — CUET 2025

Nearest first
1
Which of the following is not an application of DFS?
Topic: CUET 2025

Next 10 Questions — CUET 2025

Ascending by ID
1
Match List-I with List-II List I - (Letter Number Seires)  List II - (Missing Term)  (A) D4,F6…
Topic: CUET 2025
 2
Which CPU scheduling algorithm prefers the process with the shortest burst time?
Topic: CUET 2025
 3
Complete the following statement by choosing the correct option. For a deadlock to occur, the four conditions name…
Topic: CUET 2025
 4
The length of major axis and coordinate of vertices for the ellipse $3x^{2}+2y^{2}=6$ respectively are:
Topic: CUET 2025
 5
The Dining Philosopher’ problem can be solved by:
Topic: CUET 2025
 6
The points $(K,2-2K)$, $(-K+1,2K)$ and $(-4-K,6-2K)$ are collinear if:(A) $K=\frac{1}{2}$ (B) $K=\frac{-1}{2}$ (C) $K=\…
Topic: CUET 2025
 7
Consider the following Karnaugh Map (K-map). Minimal Function generated by this Karnaugh map is?1. $Q'S+P'Q$2. $Q'S'+P'…
Topic: CUET 2025
 8
In a binary search tree, the worst case time complexity of inserting and deleting a key is:
Topic: CUET 2025
 9
Match List-I with List-II List-I List-II         (A) If $\begin{vmatrix}\l…
Topic: CUET 2025
 10
In an examination, a student scores 4 marks for every correct answer and loses 1 mark for every wrong answer. If she/he…
Topic: CUET 2025
Ask Your Question or Put Your Review.

loading...