1. (7,10^4), log(log(n)), 4 ^ sqrt(log(n)), n^(4/5), 0.6 n log(n+5),  n^4,
n ^log(n), (3/2)^n, 3^n, 4^n, (n/2)!, n^n, 3^3^n

2.  x - 1 wil have 0's after (and inluding) the last one bit of x with higher order bits unchanged. x is a power of 2 iff there is only one 1 bit in x. hence
x &(x-1) is = 0 iff x is a power of 2.

3. Please see the solution in http://www.cs.rpi.edu/~moorthy/Courses/CSCI2300/lab2015-1-Solutions/doubt3.cc
The running time is O(number-of-ones(x)) where x is the input integer.

4. Please see the solution in http://www.cs.rpi.edu/~moorthy/Courses/CSCI2300/lab2015-1-Solutions/doubt4.cc

5. Please see the solution in http://www.cs.rpi.edu/~moorthy/Courses/CSCI2300/lab2015-1-Solutions/doubt5.cc
        
6. Take the exclusive or of all the numbers given - The resulting number 
will be the missing number. (Stems from the fact that the exclusive or all 
numbers from 0 to 2^(n) -1 is zero.)