More Problems

• Implement a function that checks if a binary number contains exactly one 1.
• Write a function that extracts bits from position i to j in a binary number.
• Create a function that shifts a binary number to the right by k positions.
• Write a function to set all bits in the right half of a binary number.
• Check if a binary number is all 0s except for one bit.
• Write a function that swaps the first and last bits of a binary number.
• Create a function that adds two binary numbers.
• Write a program to reverse the last k bits of a binary number.