There are three categories of bit-shifting questions that I usually pick from, in increasing order of difficulty:
How can you determine if a number is a power of two?
How can you clear the rightmost bit?
How can you count the number of 1 bits?
Answers were given in the blog. However they were derived at logically. In this day and age of the test-first hype, I would like to challenge its adherents to solve the problems in a test-first fashion.