Algorithms | Bit Algorithms | Question 3

What does the following C expression do?

 x = x & (x-1)

(A) Sets all bits as 1
(B) Makes x equals to 0
(C) Turns of the rightmost set bit
(D) Turns of the leftmost set bit

Answer: (C)
Explanation: The expression simply turns off the rightmost set bit. For example, if x = 14 (1110), x – 1 = 13 (1101) it returns resultant as (1100) i.e, 12 .
Quiz of this Question

Article Tags :

DSA Quiz

Algorithms-Bit Algorithms

Recommended Articles

1. Algorithms | Bit Algorithms | Question 1

2. Algorithms | Bit Algorithms | Question 2

3. Algorithms Quiz | Bit Algorithms | Question 4

4. Inserting M into N such that m starts at bit j and ends at bit i | Set-2

5. Find array elements with rightmost set bit at the position of the rightmost set bit in K

6. Algorithms | Analysis of Algorithms (Recurrences) | Question 1

7. Algorithms | Analysis of Algorithms (Recurrences) | Question 2

8. Algorithms | Analysis of Algorithms | Question 2

9. Algorithms | Analysis of Algorithms | Question 3

10. Algorithms | Analysis of Algorithms | Question 4

11. Algorithms | Analysis of Algorithms | Question 5

12. Algorithms | Analysis of Algorithms | Question 19

13. Algorithms | Analysis of Algorithms (Recurrences) | Question 4

14. Algorithms | Analysis of Algorithms | Question 8

15. Algorithms | Analysis of Algorithms | Question 9

16. Algorithms | Analysis of Algorithms | Question 10

17. Algorithms | Analysis of Algorithms | Question 11

18. Algorithms | Analysis of Algorithms | Question 12

19. Algorithms | Analysis of Algorithms (Recurrences) | Question 11

20. Algorithms | Analysis of Algorithms (Recurrences) | Question 6

21. Algorithms | Analysis of Algorithms | Question 13

22. Algorithms | Analysis of Algorithms (Recurrences) | Question 7

23. Algorithms | Analysis of Algorithms (Recurrences) | Question 8

24. Algorithms | Analysis of Algorithms | Question 15

25. Algorithms | Analysis of Algorithms (Recurrences) | Question 9