Find the signed binary expansion of the number -6.
Find the signed binary expansion of the number -6.
Show Hint
To convert a negative number into its signed binary representation using two’s complement:
- Write the binary of the positive number.
- Invert the bits and add 1.
10110
11010
11100
10101
The Correct Option is B
Solution and Explanation
Step 1: Understanding Signed Binary Representation
In signed binary representation, negative numbers are represented in two’s complement form.
The two’s complement representation uses the most significant bit (MSB) to indicate the sign of the number, where ‘0’ represents positive and ‘1’ represents negative numbers.
Step 2: Find Binary Expansion for 6
The binary representation of +6 is 0110 in 4-bit binary.
Step 3: Apply Two’s Complement to Get -6
To convert 6 to -6, we perform the following steps:
- Invert all the bits of
0110→1001 - Add 1 to the result:
1001 + 1 = 1010Thus, the two’s complement representation of -6 in 4-bit is1010.
Step 4: Extending to 5 Bits for Signed Expansion
To extend this to 5 bits, we need to add an additional '1' at the left for the negative sign, resulting in 11010.
Thus, the correct answer is (B).
Top Questions on Trees
Consider the following code:
int a; int arr[] = {30, 50, 10}; int *ptr = arr[10] + 1; a = *ptr; (*ptr)++; ptr = ptr + 1; printf("%d", a + arr[1] + *ptr);What is the output of the following C code?
void foo(int *p, int x) { *p = x; } void main() { int *z; int a = 20, b = 25; z = a; // Incorrect: Should be z = a; foo(z, b); printf("%d", a); }Issue: The statement
z = a;is invalid becauseais an integer, andzis a pointer.Which of the following is the greatest? \[ 0.6, \ 0.666, \ \frac{5}{6}, \ \frac{2}{3} \]
Given the following information:
The logical address (L.A.) is 32 bits. The physical address (P.A.) is 20 bits. The page size (P.S.) is 2048 bytes (2 KB). What is the maximum number of entries in the page table?Consider the following hierarchical cache system with the following access times:
\[ \begin{array}{|c|c|c|} \hline \textbf{Cache Level} & \textbf{Hit Rate} & \textbf{Access Time} \\ \hline L1 & 90\% & 1 \text{ ns} \\ L2 & 80\% & 10 \text{ ns} \\ L3 & 100\% & 100 \text{ ns} \\ \hline \end{array} \]Find \( T_{avg} \) for hierarchical or simultaneous access.
Questions Asked in GATE CS exam
Match the following layers with their corresponding functionalities:
\[ \begin{array}{|c|c|} \hline \textbf{Layer} & \textbf{Functionality} \\ \hline \text{Networking Layer} & \text{Data packet transfer} \\ \text{Transport Layer} & \text{Host-to-host communication} \\ \text{Data Link Layer} & \text{Error detection and correction} \\ \hline \end{array} \]- GATE CS - 2025
- Programming in C
Let \( A \) be a \( 3 \times 3 \) matrix defined as:
\[ A = \begin{bmatrix} 1 & 1 & 1 \\ 1 & 1 & 1 \\ 1 & 1 & -1 \end{bmatrix} \]Find the eigenvalues of \( A^{13} \).
- GATE CS - 2025
- Programming in C
What is the time complexity of the following algorithm?
int func(int n) {
for (int i = 1; i < = n; i++) {
for (int j = 1; j < = n; j++) {
printf("Hello");
}
}
}- GATE CS - 2025
- Programming in C
Given an array \( A[n] \) such that:
\[ A[0] \to A[i] \text{ is in non-decreasing order}, \quad A[i+1] \to A[n] \text{ is in non-increasing order}. \]Find the time complexity to find \( A[i] \).
- GATE CS - 2025
- Logical and Analytical Reasoning Skills
Given the matrix \( A = \begin{bmatrix} 1 & 2 \\ 2 & -1 \end{bmatrix} \), find \( A^8 \).
- GATE CS - 2025
- Logical and Analytical Reasoning Skills