当前位置:七七学习网文档大全求职指南求职笔试面试笔试题目维尔VERITAS软件笔试题» 正文

维尔VERITAS软件笔试题

[10-10 21:21:19]   来源:http://www.77xue.com  笔试题目   阅读:8951
概要:1. A class B network on the internet has a subnet mask of 255.255.240.0, w hat 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 wi th the same class’s constructor . a. compilation
维尔VERITAS软件笔试题,标签:驾照笔试题目,腾讯笔试题目,http://www.77xue.com

1. A class B network on the internet has a subnet mask of 255.255.240.0, w
hat 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 wi
th 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 c
  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 3*4096+ 15*256+5*16+
3 are .
  a. 8 b. 9 c. 10 d. 12
 


Tag:笔试题目驾照笔试题目,腾讯笔试题目求职指南 - 求职笔试面试 - 笔试题目

《维尔VERITAS软件笔试题》相关文章

联系我们 | 网站地图 | 范文大全 | 管理知识 | 教学教育 | 作文大全 | 语句好词
Copyright http://www.77xue.com--(七七学习网) All Right Reserved.
1 2 3 4 5 6 7 8 9 10