1. a class b net n) and o(log n^2), arithems have base 2   .

    a. o(log n^2) is bigger  b. o(log n) is bigger

    c. no difference

    3. for a class  error

    c. stack overflo information is not contained in an inode   .

    a. file oe t n elements each   .

    a. 2n   b.2n-1 c.2n+1d.2n-2

    7. time complexity of n algorithm t(n), orithm is   .

    a. log (n)   b. n c. n^2  d. n^n

    8. the number of 1’s in the binary representation of 34096+ 15256+516+3 are   .

    a. 8  b. 9  c. 10   d. 12</p>

    <b>狠男人小说最快更新，无弹窗阅读请。

狠男人网最快更新，无弹窗阅读请收藏狠男人小说网(www.41nr.com)。