名企英文笔试题
10-16 00:00:09
来源：http://www.qz26.com 笔试题目 阅读：8199次
导读：5. Please use one sentence to give a definition of ‘Beauty’, and describe the most beautiful thing in your life. (limited in 500 words) 维尔VERITAS软件笔试题 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 logarithems have base 2 . a. o(log n^2) is bigger b. o(log n) is bigger c
名企英文笔试题,标签：银行笔试题目,企业笔试题目,http://www.qz26.com
5. Please use one sentence to give a definition of ‘Beauty’, and describe the most beautiful thing in your life. (limited in 500 words)
维尔VERITAS软件笔试题
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 logarithems 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 .
5. Please use one sentence to give a definition of ‘Beauty’, and describe the most beautiful thing in your life. (limited in 500 words)
维尔VERITAS软件笔试题
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 logarithems 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:笔试题目，银行笔试题目,企业笔试题目，求职笔试面试 - 笔试题目
下一条：软件笔试题