Suppose you have an 8-bit binary number N. Which of the following operations does not change its lower 4 bits?
Suppose you have an 8-bit binary number N. Which of the following operations does not change its lower 4 bits?
From the Combined Bank Assistant Programmer (CSE) March 2021 – Preliminary exam, question 31 of 86.
More from this paper
- Previous: The Post-order traversal of a binary tree is 8, 9, 6, 7, 4, 5, 2, 3, 1, The In-order traversal of the same tree is 8, 6, 9, 4, 7, 2, 5, 1…
- Next: The minimum number of comparisons required to determine if an integer appears more than n/2 times in a sorted array of n integers is-
- All questions in Combined Bank Assistant Programmer (CSE) March 2021 – Preliminary