What method would you use to determine if the the bit that represents 2^x is a 1 or 0 ?
Share
Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
What method would you use to determine if the the bit that represents 2^x is a 1 or 0 ?
I’d use:
(You may be able to get away with fewer brackets, but I never remember the precedence of bitwise operations.)