Q1. How do you find out if a number is a power of 2?
Q2. And how do you know if it is an odd number?
skip to main |
skip to sidebar
"Gebo" means to "give and take". This is my attempt to share the knowledge & experience with the community. Focus on Puzzles, Algorithms, Problem Solving, Java & other Technical Discussions.
About Me
Search Gebo
Share & Subscribe
Books & Knowledge Base @ Amazon
Links
|
| Buttons reused from http://www.webfruits.it/freebies.htm and http://mysocialbuttons.com/ |
Archive
-
▼
2009
(26)
-
▼
August
(13)
- ping.fm - better than friendfeed, just what I want
- Rope Escape
- [ALGO] Six Colored Balls
- svn:ignore
- Find if there is only one bit set in a number
- [PS] Catch the Fox
- Algorithms from "100 Interview Questions for Softw...
- All purpose problem solving algorithm
- [ALGO] Water jugs problem
- Find if number occurs exactly n/2 times in an array
- Dividing array into groups
- Sort on second key when, first key in a set is sorted
- Find if summation of numbers from two lists is giv...
-
▼
August
(13)
Labels / Tag
algorithms
(15)
amazon
(3)
antivirus
(1)
arithmetic series
(1)
array
(5)
backtracking
(1)
bash
(1)
basics
(1)
binary trees
(1)
brindavan garden
(1)
bulb
(1)
C++
(1)
callback
(1)
clam
(1)
clamav
(1)
clock
(1)
CLRS
(2)
cormen
(3)
data structures
(1)
duplicate
(1)
easymock
(1)
education
(1)
excel
(1)
freshclam
(1)
hanoi
(1)
hashing
(1)
httpclient
(1)
humor
(1)
induction
(1)
interview question
(9)
irrational
(1)
Java
(5)
jmockit
(1)
learning
(1)
level_easy
(1)
linux
(3)
logger
(1)
macro
(1)
madhur
(2)
mathematics
(5)
matrix
(1)
microsoft
(6)
mock
(2)
mockito
(2)
mysore
(1)
networking
(1)
OCW
(1)
odd man out
(1)
oocalc
(1)
OOTB
(1)
pattern
(1)
Persistent
(1)
probability
(2)
problem
(1)
problem solving
(17)
proxy
(1)
proxy selector
(1)
puzzle
(5)
quote
(1)
randomized
(1)
recurrsion
(2)
repeating
(1)
resolution
(1)
reverse
(1)
riddle
(5)
road trip
(1)
script
(1)
search
(2)
shell
(1)
shell script
(1)
socks
(1)
solaris
(1)
solved
(1)
sort
(3)
stock
(1)
strategy
(1)
subversion
(1)
summation
(1)
svn
(1)
switch
(1)
tanwani
(2)
TDD
(2)
technology
(2)
theorem
(1)
timer
(1)
todo
(1)
travel
(1)
trees
(1)
tutorial
(1)
unimodal
(1)
unit test
(2)
walk the bridge
(1)
warmup
(1)
water jugs
(1)
windows
(1)
xkcd joke
(1)
© Madhur Kumar Tanwani
All material on this page, is free to use as long as references to the original source is maintained and credits are given to this website as one of the sources. Few clicks on the Ads on this page will help too :)
All material on this page, is free to use as long as references to the original source is maintained and credits are given to this website as one of the sources. Few clicks on the Ads on this page will help too :)
6 comments:
Assumption : Number is an integer
Q2. And how do you know if it is an odd number?
- Check the LSB of the number.
- If the bit is '1' the number is odd.
- If the bit is '0' the number is even.
Checking for 1st bit can be implemented as a BITWISE AND operation of the number with 0x1
Assumption : The number is an integer
Q1. How do you find out if a number is a power of 2?
A number is a power of 2, if it satisfies these conditions :
1. it is not odd
2. there is only one bit set in the number (and it is not the LSB - first condition)
We have already solved how to check for the first condition (see 1st comment to this blog)
2nd condition is solved in another blog entry here : http://madhurtanwani.blogspot.com/2009/08/find-if-there-is-only-one-bit-set-in.html
"Q1. How do you find out if a number is a power of 2?
A number is a power of 2, if it satisfies these conditions :
1. it is not odd
2. there is only one bit set in the number (and it is not the LSB - first condition)"
First condition is not necessary.
1 is power of 2, 2^0 = 1
@emptee
You are right. How could I be so dumb :(
Q1. Can also be solved in this fashion also
return (n-1 & n) ==0);
Consider n=4 ie. 100 in bin
n-1 will be all 1's but a digit lesser than n 11. doing a & with n will give 0. This condition hold good only for those numbers which are powers of 2
@Tom
Tom your solution is essentially a practical step of above solution given by madhur. Does there exist a different (purely mathematical and no messing with bits) solution?
Post a Comment