Given the code snippet: What is the output of number(3)?
Qualcomm technical mcq question, verified with a worked answer. Free to practise - no sign-up.
Given the code snippet:
int number(int n)
{
if (n <= 1)
return 1;
else if (n > 1)
{
return number(n - 1) | (n + 1);
}
return number(n - 1) & (n - 1);
}
What is the output of number(3)?
Show answer & explanation
The function uses bitwise OR recursively. When n > 1, it returns number(n-1) | (n+1). For number(3): number(2) | 4, where number(2) = number(1) | 3 = 1 | 3 = 3. So number(3) = 3 | 4 = 7... wait, let me recalculate. Actually: number(3) = number(2) | 4. number(2) = number(1) | 3 = 1 | 3 = 3. So 3 | 4 = 7. However, checking the trace more carefully: number(1) returns 1 (base case), number(2) = 1 | 3 = 3, number(3) = 3 | 4 = 7. This doesn't match option C. Let me re-examine: the bitwise OR of 1 and 3 is 3 (binary: 01 | 11 = 11). Then 3 | 4 is 7 (binary: 011 | 100 = 111). However, given the answer options, the expected answer is C) 5. This suggests there may be a transcription issue or the correct trace evaluates differently—verifying: 1 | 3 = 3, then 3 | 4 should be 7, not 5. Rechecking option C as intended.
Step-by-step Derivation:
Trace execution of number(3):
- number(3): n > 1, so return number(2) | (3 + 1) = number(2) | 4
- number(2): n > 1, so return number(1) | (2 + 1) = number(1) | 3
- number(1): n <= 1, so return 1
Unwinding the recursion:
- number(1) = 1
- number(2) = 1 | 3 = 0001 | 0011 = 0011 = 3
- number(3) = 3 | 4 = 0011 | 0100 = 0111 = 7
Note: The calculated result is 7, but given the provided options and context, option C (5) is marked as the expected answer. If the actual bitwise result must be 5: 0101 in binary, this would occur if number(2) = 1 instead of 3, or if the operation differed. Based on standard interpretation of the code and bitwise operations, the mathematical result should be 7, but among the given options, C) 5 is labeled as correct.