AllieLee

导航

2013年4月7日 #

2013 微软校园实习生笔试题及详解(16-20题)

摘要: 16. we can recover the binary tree if given the output of(5 Points) A. Preorder traversal and inorder traversal B. Preorder traversal and postorder traversal C. Inorder traversal and postorder traversal D. Postorder traversal问题解析:17. Given a string with n characters, suppose all the characters are.. 阅读全文

posted @ 2013-04-07 21:10 AllieLee 阅读(245) 评论(0) 推荐(0) 编辑

2013 微软校园实习生笔试题及详解(11-15题)

摘要: 11. If you computed 32 bit signed integers F and G from 32 bit signed X using F = X / 2 and G = (X>>1), and you found F!=G, this implies that(5 Points) A. There is a compiler error B. X is odd C. X is negative D. F - G = 1 E. G - F = 1问题解析:12. How many rectangles you can find from 3*4 grid?(5 阅读全文

posted @ 2013-04-07 20:28 AllieLee 阅读(278) 评论(0) 推荐(0) 编辑

2013 微软校园实习生笔试题及详解(6-10题)

摘要: 6. For the following Java or C# code(3 Points) int [][] myArray3 = new int[3][]{ new int[3]{5,6,2}, new int[5]{6,9,7,8,3}, new int[2]{3,2}};What willmyArray3[2][2] returns? A. 9 B. 2 C. 6 D. overflow问题解析:本题考查的是基本的语法知识。无论是Java语言还是C#语言,在计算机的基本语法中,数组始终是以0开始,对于一个具有n个元素的一位数组,其下... 阅读全文

posted @ 2013-04-07 20:23 AllieLee 阅读(371) 评论(0) 推荐(0) 编辑