微软部分笔试题解析与答案（Microsoft part of the written examination questions and answers）.docVIP

下载本文档

0
0
约5.68千字
约 12页
2017-09-05 发布于河南
举报
版权申诉

微软部分笔试题解析与答案（Microsoft part of the written examination questions and answers）.doc

1、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。。
2、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
4、该文档为VIP文档，如果想要下载，成为VIP会员后，下载免费。
5、成为VIP后，下载本文档将扣除1次下载权益。下载后，不支持退款、换文档。如有疑问请联系我们。
6、成为VIP后，您将拥有八大权益，权益包括：VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
7、VIP文档为合作方或网友上传，每下载1次，网站将根据用户上传文档的质量评分、类型等，对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档

微软部分笔试题解析与答案（Microsoft part of the written examination questions and answers）

微软部分笔试题解析与答案（Microsoft part of the written examination questions and answers） (Microsoft 2004-11-13 written examination questions analysis) 1, to find the function return value, enter x=9999; Int func (x) {? ? int, countx = 0? While? (x)? ??? {? ???????? Countx + +; ??? = x = x (x-1); ????} Return countx?; } [test questions] ??? time to solve the problem, if you come up with a binary number analysis will be easier, x=x (x-1) is actually the X binary form the last 1 to 0, the X binary form the number 1 on the implementation of many times cycle. 9999/256 = 39 more than 15, the two numbers are transformed quickly 39 = 32 +, 4 + 2, +1 =15 = 0F =So, 9999=0010011100001111, there are 8 1, and the answer is 8 2. Implement the following procedures to facilitate binary search. To handle error statements The size of the queue allocation is fixed MAX_LEN, entered by second parameters The queue cannot be copied Insert (int *arr,????? / / queue ???? Size_l len????? / / queue size ???? Size_l count???? / / the number of elements in the queue ???? Int Varl?????? / / data to be processed Returns the index of the inserted data Remove (int, *arr, size_l, len, size_l, count, int, Varl) returns the index of the deleted element The search (int, *arr, size_l, len, size_l, count, int, Varl) returns the index of the search trace element [test questions] What about?. Data structures are available on the book. 3, stack R, from top to bottom: {2,4,6,8,10}, one by one out, placed in the queue Q, and then removed from the Q, placed in R, ask the stack R now from top to bottom in the order. [test questions] ?? Thats not necessary, {10,8,6,4,2} 4, write the program results: ___________ Int Funa (int *a) { A[0] + +??; } Int funb (int b[]) { ?? B[1] = 5; } (main) {? ? int, a[5] = {2,3,4,5,6}? ? int, b[5] = {2,3,4,5,6}? Int *p?; ? P = a[0]; ?? (*p + +);? Funa? (P)?; ? for (int = I = 0; i3; i++) Printf? (%d, a[i]); P = b[1]? Funb? (P)?; ? for (I = 0; i3; i++) Printf? (%d, b[i]); }