2014年考408计算机学科专业基础综合真题答案

? ? ? ? 1? C 2? B 3? A 4? D 5? C 6? D 7? D 8? D 9? D 10? B 11? C 12? D 13? C 14? A 15? A 16? D 17? A 18? C 19? C 20? C 21? D 22? B 23? A 24? B 25? D 26? A 27? A 28? C 29? B 30? A 31? C 32? D 33? C 34? B 35? D 36? C 37? B 38? A 39? B 40? D ? 1? j=n ? j ? 1? ? n ? k=n? k*=2? 2k=n? k=log2n? ? O(n)? O(log2n)? ? T(n)=T1(n)*T2(n)=O(n)*O(log2n)=O(nlog2n)? 2? ? ? ? a. ? (? b. ? )?(?( ? c. ? ?(? ? ? ? ? ? ? a/b+(c*d-e*f)/gaa ? /b+(c*d-e*f)/ga/? b+(c*d-e*f)/g/abb ? +(c*d-e*f)/g/ab+?/?/ +(c*d-e*f)/gab/+? (c*d-e*f)/g+ab/( ? c*d-e*f)/g+(ab/cc ? *d-e*f)/g+(ab/c*?(?*? d-e*f)/g+(*ab/cdd ? ? ? A3 ? j j j j j j j j j ?1 1 1 1 1 1 1 1 1 1 1? ?2 2 2 2 2 2 2 2 2 2 2k k k k k k =n? ? O(lo o o o o o o og g g g g g g g g g g g2 2 2 2 2 2 2 2 2 2 2 2 2n)? n)=T1(n)* * * * * * * * * *T T T T T T T T T T T T T T T2 2 2 2 2 2 2 2 2(n(n(n n(n(n(n(n(n( (n( ( ( ( ( ( ) ) ) ) )=) ) ) ) ) O(n) )n)n)n) )n)n) ) ) )*O O O O O O O O(log2n)n)n)n)n)n)n) )n)=O=O=O=O=O=O=O= =O=O=O O= (n( ( ( ( log2n) ? ? ? ? ?(? ? ? ? ? e*f f f f f f f f f f f f)/ )/ ) )/ )/ )/ )/ )/ )/ )/ )/ )/ )/ )/g g g g g g gf f f f f f f f f f f a a a a a a a a a a a a a a a a a a a a a a a a a a -e*f)/g+(*ab/cd-?*?* -e*f)/g+(ab/cd*-?(?-? e*f)/g+(-ab/cd*ee ? *f)/g+(-ab/cd*e*?-?*? f)/g+(-*ab/cd*eff ? )/g+(-*ab/cd*ef)?(? /g+ab/cd*ef*-/?+?/? g+/ab/cd*ef*-gg ? +/ab/cd*ef*-g? ab/cd*ef*-g/+? ? f ?+(-*? B? ? ? ? ? ? ?(a/b)+(c*d)-(e*f)/g) ? ?+(/(ab)/(-(*(cd)*(ef)g) ?+/ab/-*cd*efg ? ?(ab)/(cd)*(ef)*)-g)/)+ ?ab/cd*ef*-g/+ ? ? 3?end1 ? Aend1? end1 ? 1? end2 ? Aend2? end2 ? 1? A0? A0? end2 ? end2 ? 0? end1 ? A ? 0? end1 ? 0? end1=end2? ? M-1 ? 0 ? M-2 ? M-1 ? A0? AM-2? end1 ? end2 ?end1 ? ? end1=0?end2 ? end2=M-2+1=M-1? ? end1=(end2+1)mod M? A? ? ? ? ? 4? ?edbxac? x ? ? b?a? D? 5? ? ? ? ? F ? ? ? ? g ? ? ? ?+(+(+(+(+(+(+(+( (+(+(+(+ + + + + + - - - - -* * * * * *? B B B B B B B B B B B? ? ? ? )-(e*f)/g) ? ?+(/( ab/-*cd*efg ? ? ?ababababababab b babababab bababab b/c /c /c /c /c /c /c /c /c /c /c /c /c / /c c c c c c c c c c c cd*d*d d d d d d d d d d d d d d d d ef ef ef ef ef ef f ef ef f ef ef f ef ef ef ef f f f ef ef ef e ef ef e ef ef ef ef ef ef ef ef ef* * * * * * * * * * * * * * * * * *-g/ g g g/ g g g g g g g g g g + ? ? end1 ? ? 0 ? enenenenen n n n nenen n nd2d d d d d d d d d d ? 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0? ene e e e enenene e ene ene e e enenenenenene d d d d d d d d d d d d d d d d d ? 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0? ? ? ? T ? C? ? A?B?D ? 6? ?D ? 110 ? 1100 ? D ? 7? 0 ? ? 3 ? 0? 3 ? 1 ? 0? 1 ? 4 ? ? 0? 4 ? 2 ? 6 ? 0? ? 314265 ? 314625? D? 8? ? D? 9? ? 4 ? B ? 1 ?4/2?-1=1 ? ? 1 ? 2 ? ? 15 ? 4 ? 4 ? B ? ? ? B ? ? D? 10? 1? ? 2? 1+2 ? 4 ? 1 ? 9 ?A ? ? 3? i?i+3?i+6 ?(i=1,2,3)? ? 4? 1 ? 9 ? 1+4 ? 7 ?C ? 5? 1 ? 9 ? 1+5 ? 8 ?D ? B? 11? i ? i ? ? ? ? ? ? 2 ?A ? 2?3?6?7?9 ? A ?B ? ?2?9 ? B ?D ? 5?9 ? D ? C ? ? 9 ? C ? 12? x? CPI ? 20/x? ? 70%? 0.7x? CPI ? 1.2 ? 24/x? P ? M ?*CPI=0.7x*24/x=24*0.7=16.8 ? D? 13?8 ?-128127?A ? x+y=103-25=78?A ?B ?-x+y=-103-25=-128?B ? D ?-x-y=-103+25=-78?D ?C ? x-y=103+25=128? 127? C? ? ? ? 14?(f1)?(f2)?(110011001001)2?(101100001100)2? IEEE754 ?(f1)? 1? 10011001? 1.001?(f2)? ? 1? 01100001? 1.1?B?D ?(f1)? ? 1.001226?(f2)? 1.12-30?(f1)?(f2)? ?(f1)?(f2)? xy? A? ?(f1)?(f2)? 4 ? 1100 ? 1011,? ? 100 ? 011?(f1)?(f2)? ? IEEE754 ? ? 1.xxx? ? ? ?(f1)?(f2)?(f1)lchild != NULL) /? wpl_PreOrder(root-lchild, deep+1); if(root-rchild != NULL) /? wpl_PreOrder(root-rchild, deep+1); return wpl; ? #define MaxSize 100/? int wpl_LevelOrder(BiTree root) BiTree qMaxSize;/?end1 ?end2 ? int end1, end2;/? MaxSize-1 ? end1 = end2 = 0;/? int wpl = 0, deep = 0;/? wpl ? BiTree lastNode;/lastNode ? BiTree newlastNode;/newlastNode ? lastNode = root;/lastNode ? newlastNode = NULL;/newlastNode ? qend2+ = root;/? while(end1 != end2)/? BiTree t = qend1+;/? if(t-lchild = NULL /? wpl if(t-lchild != NULL) /? qend2+ = t-lchild; newlastNode = t-lchild; /? if(t-rchild != NULL)/? qend2+ = t-rchild; newlastNode = t-rchild; if(t = lastNode)/? lastNode lastNode = newlastNode; deep += 1;/? 1 return wpl;/? wpl ? ? ? C ? C+? ? ? ? ? ? ? ? ? ? ? ?static ? wpl ? 0? wpl ? 0? static ? ? ? ? ? ? ? ? ? ? ? ? NULL) ? wpwpwpwpwpwpwpw wpwpwpw w wpl l l l l l l /? hild; t-lchild; d; d; d; d; d; d; d d; d; /? NULL) / / / / / / / / / / ? d2+ = t-r r r r r rchchchchchchchchchch h h hil il il il il il il i il l l l l i i i d; d; d; d; d; d; d; d d; d; d d d d d d ewlastNode = t-rrrrrr r rrchchchchchchch h h h h hil il il il il il il i i il il il l i i d; d; d; d; d; d; ; ; d d; ; f(t t t = = = = = = = = = = = = = = = = = = = = = = = = = = = la la la la la la la la la a la la la la la l la la la last s s s s s s s s s s s Nodededededededededededede edede ededede e) ) ) ) ) )/ / / / / /? la a a a a a a a a a a a a a a a a ast st st st st st st st st st st st st st st st st st s st stNoNoNoN N N NoN NoNoN NoNoNoNoNoNoN d d ded d d = n n n n n n n n n n newewewewewewewewewewewewew wewew wla l l l l l stNo oN NoNoNoNoNoNoNo oNoNo o o o oded d d d d d d d d d ; d d d d d ded d d d d d d d epepepepepepepepe e e ep + + + + + + + + + + += = = = = = = 1; 1; 1;/ / / / / / / / / / / / / / /? 1 returnrnrnrnrnrnrnrnrnrn nrn n n nrnrn wpl pl pl pl pl pl pl pl pl pl pl l pl p pl; ; ; ; ; ; ; ; ; ; ; ;/ / / / / / / / / / / / / / / / / / / /? ? ? ? C ? ? ? ? static? ? static ? ? int wpl_PreOrder(BiTree root, int deep) int lwpl, rwpl;/? wpl lwpl = rwpl = 0; if(root-lchild = NULL if(root-lchild != NULL) /? lwpl = wpl_PreOrder(root-lchild, deep+1); if(root-rchild != NULL) /? rwpl = wpl_PreOrder(root-rchild, deep+1); return lwpl + rwpl; C/C+? int wpl_PreOrder(BiTree root, int deep) if(root-lchild = NULL return (root-lchild != NULL ? wpl_PreOrder(root-lchild, deep+1) : 0) + (root-rchild != NULL ? wpl_PreOrder(root-rchild, deep+1) : 0); ? ? ? ? ? ? ?(x?y:z)? ? lastNode ? newlastNode ?lastNode ? ? newlastNode ? ? ? ? ? end1=(end2+1)%M? 2014 ? ? ? ? ? 42? ? ? ? ? ? (1)?(1 ?) ? ? ? ? ? ? (2)? Flag=1 ? Next ID IP Metric Flag=2Next Prefix Mask Metric RouterID LN_link Next ? ? ?(3 ?) typedef struct ? ? ? ld, deep+ + + + + + + + + +1)1)1)1)1) )1)1)1) : : : : : : : : 0 0 0 0 0 0 0 0) ) ) ) ) ) ) ) ) ) ) child, deep+1) ) ) ) ) ) ) ) ) ) ) ) ) : 0 0 0 0 0 0 0 0 0 0 0); ); ); ); ); ; ); ; ; ; ? ? ? ? ? ? ? lastNoNoNoNoNoNoN NoN NoNo o odededed ded d ded d ded ded ? nen n n n n n n n n n n wl lwl lwl l l l lasasasasasasa asa a a a tNtNtNtNtNtNtN N NtN N NtNo o o ode ? ? nenenenenen ne e e ewl l l l l l l l l l l l lasasasasasasasasasasas sas sa a tNtNtNtNtNtNtN N NtNtNt t t odododododod d de e e e e e ? ? ? ? ? ? ? ? ? ? ? ? )%MMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMM? 202020202020202020202020202 2020202 14 ? ? ? ? ? ? unsigned int ID, IP; LinkNode;/Link ? typedef struct unsigned int Prefix, Mask; NetNode;/Net ? typedef struct Node int Flag;/Flag=1 ? Link;Flag=2 ? Net union LinkNode Lnode; NetNode Nnode LinkORNet; unsigned int Metric; struct Node *next; ArcNode;/? typedef struct HNode unsigned int RouterID; ArcNode *LN_link; Struct HNode *next; HNODE;/? ? 42 ?(2 ?) Flag=1 10.1.1.5 10.1.1.9 2 Flag=2? 192.1.1.0 255.255.255.0 1 10.1.1.1 10.1.1.2 10.1.1.5 10.1.1.6 Flag=1 10.1.1.2 10.1.1.1 3 Flag=1 10.1.1.6 10.1.1.13 4 Flag=2? 192.1.6.0 255.255.255.0 1 Flag=1 10.1.1.1 10.1.1.2 3 Flag=1 10.1.1.1 10.1.1.10 2 Flag=2? 192.1.5.0 255.255.255.0 1 Flag=1 10.1.1.6 10.1.1.5 6 Flag=1 10.1.1.2 10.1.1.14 4 Flag=2? 192.1.7.0 255.255.255.0 1 Flag=1 10.1.1.5 10.1.1.6 6 ? ?(? ?)? ? union ? ? Link ? Net? ? ? IP ? ? ? ? ? LSI ? ? 8 ? ? ? ? ? ? ? ) Flag=1 10.1.1.5 5 5 5 5 5 5 5 5 5 5 5 5 1 1 1 1 10.1.1.9 2 F F F F F F F F Fl l l l l l l la a ag=2? ? ? ? ? ? ? ? ? ? ? ? 19 9 9 9 9 9 9 9 92 2 2 2 2 2 2 2.1 1 1 1 1 1 1 1 1 1.1 1 1 1 1 1 1 1.0 2 2 2 2 2 2 2 2 2 2 2 2 25 5 5 5 5 5 55 5 5 5 5 5 5 5 5 5. . . . . . .2 2 2 2 2 2 2 2 2 2 25 5 5 5 5 5 5 55 5 5 5 5 5 5 5 5 5 5.255.0 1 .1.5 1 1 1 1 1 1 1 1 1 1 1 1 1 10.1. .1 1 1 1 1 1 1 1 1 1 1 1. .6 6 6 6 6 6 6 6 6 6 Fl l l l l l la a a a a a a a a a a ag g g g g g g g g g g g= = = = = = = =1 1 1 1 1 10.1.1. . . .6 6 6 6 6 6 6 6 6 6 6 6 10 0. . .1 1 1 1 1 1 1 1 1. . . . .1 1 1 1.13 3 3 4 4 4 4 4 4 4 4 4 4 4 4 4 4 Flag=2ag=1 10.1 1 1 1 1 1 1 1.1 1 1 1 1 1 1 1 1 1 1.1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 10 0 0 0 0 0 0 0. . . . .1 1 1 1 1 1 1 1 1 1 1 1 1.1 1 1 1 1 1 1 1 1 1. . . . . . .2 2 2 2 2 2 2 2 2 2 2 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 F F F F F F Fl l l l l l l l lag=1 10.1 1 F F F F F F F F F F F F F F Fl l l l l l l l l l l la a a a a a a a ag g g g g g g g g g g g g=1 1 1 1 1 1 1 1 1 1 1 10 0 0 0 0 0 0 0 0 0 0 0 0.1 1.1.6 10.1 1 1 1 1 1 1. . .1 1 1 1 1 1 1 1 1 1 1 1