a. 2n b.2n-1 c.2n+1 d.2n-2
7. Time complexity of n algorithm T(n), where n is the input size ,is T(n)=T(n-1)+1/n if n>1 otherwise 1 the order of this algorithm is .
a. log (n) b. n c. n^2 d. n^n
8. The number of 1’s in the binary representation of 3*4096+ 15*256+5*16+3 are .
a. 8 b. 9 c. 10 d. 12
阅读此文的读者还阅读了：
KPMG招聘笔试题
摩根斯坦利数学类笔试题
腾讯笔试题
央行会计热门笔试题
