一本久道久久综合狠狠躁不卡,国精品久久久久久久久久久58,一夜新娘第三季免费观看完整版,人人干人人艹,91精品久,6080日韩午夜伦伦午夜伦,91在线中文

當(dāng)前位置:高考升學(xué)網(wǎng) > 招聘筆試題 > 正文

維爾軟件筆試題和面試題答案

更新:2023-09-17 22:38:51 高考升學(xué)網(wǎng)

  最新維爾軟件筆試題分享:
  1. A class B network on the internet has a subnet mask of 255.255.240.0, what is the maximum number of hosts per subnet .

  a. 240 b. 255 c. 4094 d. 65534

  2. What is the difference: between o(log n) and o(log n^2), where both log arithems have base 2 .

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

  c. no difference

  3. For a class what would happen if we call a class’s constructor from with the same class’s constructor .

  a. compilation error b. linking error

  c. stack overflow d. none of the above

  4. “new” in c++ is a: .

  a. library function like malloc in

  b. key word c. operator

  d. none of the above

  5. Which of the following information is not contained in an inode

  a. file owner b. file size

  c. file name d. disk address

  6. What’s the number of comparisons in the worst case to merge two sorted lists containing n elements each .

  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

  a. 8 b. 9 c. 10 d. 12

相關(guān)文章

最新圖文