當前位置:學問君>人在職場>綜合指導>

微軟暑期實習筆試題

學問君 人氣:4.89K

發信人: loccs(short), 信區: JobForum

微軟暑期實習筆試題

發信站: 飲水思源 (2012年04月07日18:53:56 星期六)Choose部分是我自己做的答案,非標準答案.有些題目選項記不起來了,非常抱歉.

1. Selection sort 80 items, after 32 iterations, how many positions of items are determined?

Choose:32。

2. Which is used in sync process//thread in operation system?

A. Mutex                  box          phore          l procedure callChoose: AC

3. Size of a stack is 5, input is a sequence 1, 2, …, 7, which is possible output?

A. 1234567        B. 7654321        C.5643721        D. 1765432        E. 3217564Choose: AC

4. 010111001 * 011001 + 1101110 = ?

A. 0001010000111111        B. 0101011101110011        C. 0011010000110101Choose: A

5. What is the output of the follow code?

void main(int argc, char* argv[]) {

int i = 11;

int const *p = &i;

p++;

cout<<*p<

A. 11        B. 12        C. Garbage value        D. Comipler error        E. None of aboveChoose: C

6. Which code is correct?

C. vectorf() {

vectorv(3);

return v;

}

E. None of above

Choose: C

7. Which number has difference 78633 after 180-degree rotation?

A. 60918                B.91086                C. 18609                D. 10968                E.86901Choose: D

8 Which statement is true?

A. Inorder and preorder can determine a Binary treeB. Postorder and preorder can determine a Binary treeC. For almost sorted array, Insertion sort is more efficient than QuicksortD. If T(n)=2T(n/2)+&#8854;(n), Then T(n)=&#8854;(nLogn)E. none of above

Choose: ACD

9. Which statement is true?

A. Insertion and buble sort are not effient for large data setsB. The complexity of Quick Sort is O(n2) in worst caseC. It is needed 6 swap operations to sort sequence 7,6,5,4,3,2,1(ascending) by Selection sortD. Heap sort has two operations: Insertion and root deletionE. None of above

No choose

12. The output of the following code is 0 20 1 20, what are the type of a and b?

class Test{

____ int a;

____ int b;

Test(int _a, int _b) {a = _a; b=_b;}

}

void main() {

Test t1(0, 0), t2(1,1);

t1.b = 10;

t2.b = 20;

cout<

A. static/const        B. const/static        C. __/static        D. const static/static        E. None ofabove

Choose: C

13. A 3-order B-tree has 2047 key words, what is the maximum height?

A. 11          B. 12           C. 13           D. 14no choose

14. Which can be used both to variable and function?

A. static        B. virtual                C. extern        D. inline        E. constChoose: ACE

15. What is the output of the follow code?

char * f(char *str, char ch) {

char *it1 = str;

char *it2 = str;

while(*it2 !=