NTA UGC NET Dec 2023 Paper-2
March 22, 2024NTA UGC NET Dec 2023 Paper-2
March 22, 2024NTA UGC NET Dec 2023 Paper-2
|
Question 47
|
The microoperation which divides a signed binary number by 2 is:
|
Circular shift
|
|
|
Logical shift
|
|
|
Arithmetic shift right
|
|
|
Arithmetic shift left
|
Question 47 Explanation:
Arithmetic shift right is a bitwise operation that shifts all bits in a binary number to the right by one position, filling the leftmost bit with the sign bit (most significant bit) to preserve the number’s sign.
In effect, it divides the number by 2, maintaining the correct representation of negative numbers.
Here’s how it works:
Positive numbers:
The leftmost bit is 0, so it’s filled with 0.
The value is effectively divided by 2.
Negative numbers:
The leftmost bit is 1, so it’s filled with 1.
The value is divided by 2, and the sign remains negative.
Other shift operations:
Logical shift right: Shifts all bits right, filling the leftmost bit with 0. Not suitable for signed numbers as it would change negative numbers to positive.
Circular shift: Rotates bits to the right, wrapping the rightmost bit to the left. Doesn’t divide the number.
Arithmetic shift left: Shifts bits left, filling the rightmost bit with 0. Multiplies the number by 2, not divides.
Therefore, arithmetic shift right is the microoperation specifically designed to divide signed binary numbers by 2.
In effect, it divides the number by 2, maintaining the correct representation of negative numbers.
Here’s how it works:
Positive numbers:
The leftmost bit is 0, so it’s filled with 0.
The value is effectively divided by 2.
Negative numbers:
The leftmost bit is 1, so it’s filled with 1.
The value is divided by 2, and the sign remains negative.
Other shift operations:
Logical shift right: Shifts all bits right, filling the leftmost bit with 0. Not suitable for signed numbers as it would change negative numbers to positive.
Circular shift: Rotates bits to the right, wrapping the rightmost bit to the left. Doesn’t divide the number.
Arithmetic shift left: Shifts bits left, filling the rightmost bit with 0. Multiplies the number by 2, not divides.
Therefore, arithmetic shift right is the microoperation specifically designed to divide signed binary numbers by 2.
Correct Answer: C
Question 47 Explanation:
Arithmetic shift right is a bitwise operation that shifts all bits in a binary number to the right by one position, filling the leftmost bit with the sign bit (most significant bit) to preserve the number’s sign.
In effect, it divides the number by 2, maintaining the correct representation of negative numbers.
Here’s how it works:
Positive numbers:
The leftmost bit is 0, so it’s filled with 0.
The value is effectively divided by 2.
Negative numbers:
The leftmost bit is 1, so it’s filled with 1.
The value is divided by 2, and the sign remains negative.
Other shift operations:
Logical shift right: Shifts all bits right, filling the leftmost bit with 0. Not suitable for signed numbers as it would change negative numbers to positive.
Circular shift: Rotates bits to the right, wrapping the rightmost bit to the left. Doesn’t divide the number.
Arithmetic shift left: Shifts bits left, filling the rightmost bit with 0. Multiplies the number by 2, not divides.
Therefore, arithmetic shift right is the microoperation specifically designed to divide signed binary numbers by 2.
In effect, it divides the number by 2, maintaining the correct representation of negative numbers.
Here’s how it works:
Positive numbers:
The leftmost bit is 0, so it’s filled with 0.
The value is effectively divided by 2.
Negative numbers:
The leftmost bit is 1, so it’s filled with 1.
The value is divided by 2, and the sign remains negative.
Other shift operations:
Logical shift right: Shifts all bits right, filling the leftmost bit with 0. Not suitable for signed numbers as it would change negative numbers to positive.
Circular shift: Rotates bits to the right, wrapping the rightmost bit to the left. Doesn’t divide the number.
Arithmetic shift left: Shifts bits left, filling the rightmost bit with 0. Multiplies the number by 2, not divides.
Therefore, arithmetic shift right is the microoperation specifically designed to divide signed binary numbers by 2.