微软实习生笔试题目

微软实习生笔试题目

1.Selectionsort80items,after32iterations,howmanypositionsofitemsaredetermined?

Choose：32。

2.Whichisusedinsyncprocess//threadinoperationsystem?

A.MutexB.mailboxC.SemaphoreD.localprocedurecall

Choose:AC

3.Sizeofastackis5,inputisasequence1,2,,7,whichispossibleoutput?

A.1234567B.7654321C.5643721D.1765432E.3217564

Choose:AC

4.010111001*011001+1101110=?

A.0001010000111111B.0101011101110011C.0011010000110101

Choose:A

5.Whatistheoutputofthefollowcode?

voidmain(intargc,char*argv[]){

inti=11;

intconst*p=i;

p++;

cout*p

A.11B.12C.GarbagevalueD.ComiplererrorE.Noneofabove

Choose:C

6.Whichcodeiscorrect?

C.vectorf(){

vectorv(3);

returnv;

}

E.Noneofabove

Choose:C

7.Whichnumberhasdifference78633after180-degreerotation?

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

Choose:D

8Whichstatementistrue?

A.InorderandpreordercandetermineaBinarytree

B.PostorderandpreordercandetermineaBinarytree

C.Foralmostsortedarray,InsertionsortismoreefficientthanQuicksort

D.IfT(n)=2T(n/2)+(n),ThenT(n)=(nLogn)

E.noneofabove

Choose:ACD

9.Whichstatementistrue?

A.Insertionandbublesortarenoteffientforlargedatasets

B.ThecomplexityofQuickSortisO(n2)inworstcase

C.Itisneeded6swapoperationstosortsequence7,6,5,4,3,2,1(ascending)bySelectionsort

D.Heapsorthastwooperations:Insertionandrootdeletion

E.Noneofabove

Nochoose

12.Theoutputofthefollowingcodeis020120,whatarethetypeofaandb?

classTest{

____inta;

____intb;

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

}

voidmain(){

Testt1(0,0),t2(1,1);

t1.b=10;

t2.b=20;

cout

}

A.static/constB.const/staticC.__/staticD.conststatic/staticE.Noneof

above

Choose:C

13.A3-orderB-treehas2047keywords,whatisthemaximumheight?

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

nochoose

14.Whichcanbeusedbothtovariableandfunction?

A.staticB.virtualC.externD.inlineE.const

Choose:ACE

15.Whatistheoutputofthefollowcode?

char*f(char*str,charch){

char*it1=str;

char*it2=str;

while(*it2!=\0){

while(*it2==ch)

{

it2++;

}

*it1++=*it2++;

}

returnstr;

}

intmain(intargc,char*argv[]){

char*a=newchar[10];

strcpy(a,abcdcccd);

cout

return0;

}

A.abdcccdB.abddC.abccD.abddcccdE.Accessviolation

Choose:D

16.Whatisthecomplexityoftheresultcallofpower(b,e)inthefollowcode?

intpower(intb,inte){

if(e==0)return1;

if(e%2==0)returnpower(b*b,e/2);

returnb*power(b*b,e/2);

}

A.logarithmicB.linearC.quadraticD.exponentical

Choose:A

17.Take2cardsfromonefullpoker(52cards,26redand26black)andhalfpokereach,whatistheprobabilityoftheeventthattwocardsarebothred?

A.1/2,1/2B.25/102,12/50C.50/51,24/25D.25/51,12/25E.25/51,1/2

Choose:B

18.Howmanykindsofoutputofstackwiththeinput1,2,,n?

B.C_2n^n-C_2n^(n+1)C.((2n)!)/(n+1)n!n!D.n!E.none

Choose:C

19.WhatistheminimumtimeandspacecomplexitytocomputetheLargestIncreasedSubsequence(LIS)ofarray?

A.N^2,N^2B.N^2,NC.NlogN,ND.N,NE.N,C

Choose:C

20.Whatistheoutputofthefollowcode?

structItem{

charc;

Item*next;

};

Item*f1(Item*x){

Item*prev=NULL;

Item*curr=x;

while(curr){Item*next=curr-next;

curr-next=prev;

prev=curr;

curr=next;

}

returnprev;

}

voidf2(Item*x){

while(x