第一篇：2012微软“智在未来”实习生招聘
2012微软“智在未来”实习生招聘
2012微软“智在未来”实习生计划是为即将毕业于2013年的本科、硕士、博士学生量身打造的实习计划。
实习生职位：职位涵盖软件开发，技术支持等领域 工作地址：将在北京、上海等城市共提供近1000个实习岗位
“智在未来”实习生计划在暑假期间将招聘大量2013年即将毕业的学生加入微软中国实习。在暑假以外的时间，微软中国也会依据部门需要和同学的时间招聘一定量的实习生。
实习生在微软的实习期通常需要达到三个月或以上，形式分全职兼职两种，全职实习生周一至周五工作5天，兼职实习生一周需要保证工作3个工作日以上。我们鼓励同学们在假期进行全职实习，以获得更全面连贯的实习项目经验.我们能提供什么？
导师制度：不用担心进入微软后手足无措，我们将为每位实习生配备导师，你的日常学习和工作将由他
（她）悉心指导。他（她）将指引你成功完成整个实习计划。短短几年，从实习生到团队经理，他（她）深谙微软支持工程师所必需的职业素养，帮助你高效完成从校园人才到企业精英的转变；
培训：为期一周的训练中，你的经理给你制定最适合的培训课程，训练你的沟通能力和职业意识，并在此基础上为你提供可能的职业规划建议；
技术项目真实现场：每位实习生都将得到自己的项目任务，你将通过团队合作和学习，投身真实项目工
作，并在实习结束时反馈自己的项目报告
你将有何获益？
提前体验微软 IT 前沿技术：你有机会接触到微软最新产品的测试，领先一步掌握全球 IT 科技资讯；你
有机会与技术大牛们分享交流最新的行业动态和展示微软最新的技术成果；
获得微软的技术资源：为实习生提供的在线技术自学环境，将让你感受获取知识的乐趣； 绿色通道：表现优秀的实习生将有机会受到微软导师的推荐，经过面试筛选，得到微软2013年正式聘
用书，并于2013年毕业后正式入职，成为微软中国的正式员工。
想加入微软“智在未来”实习生项目吗？亲爱的同学，我们在等你们，那你还等什么呢？赶快来加入微软吧！请访问 申请我们的实习职位。暑期实习生招聘的网申截至日期是3月31日。请同学们火速提交简历，为即将举办的笔试占据你的一席之地！
第二篇：2013微软实习生笔试题
http:///实现可变参数printf可以调用约定：
A． cdecl
B． stdcall
C． pascal
D． fastcall
输出结果：
class A
{
public:
virtual void f()
{
cout<<“A:f()”< } void f()const { cout<<“A:f()const”< } }; class B:public A { public: void f() { cout<<“B:f()”< } void f()const { cout<<“B:f()const”< } }; void ga(const A *a) { a->f(); } int _tmain(int argc, _TCHAR* argv[]) { A *a=new B(); a->f(); ga(a); } A.B::f()B::f()const http:// 1.2.….答案：B::f()A::f()const 3.链表和数组的区别 A.在有序的情况下的查找效率 B.dynamic add/remove C.random access D.data type 4.关于线程和进程，下面哪句话正确： A.系统应用中一定至少有一个进程，但是不一定要有线程 B.线程有自己的栈，必须和它的父进程共享自己的资源 C.线程必须属于进程 D.5.输出结果： int x=10; int y=10;x= x++;y= ++y;printf(“%d%d/n”, x, y);system(“PAUSE”); return 0; A.10 10 B.10 11 C.11 10 D.11 11 6.Java 或C#代码的结果？ Int[][] array3={ Int[3][]={5,6,2},Int[3][]={6,9,7,8,3} Int[3][]={3,2} }; Cout << array3[2][2]; A.9B.C.D.overflow 7.以下哪个正确 A.Const int a;//常整数 B.Int const a;//常整数 C.Const int *a;//指向一个常整数的指针 D.Const int *a;//是一个const指针 E.Int const *a;//是一个const指针 8.一段代码问输出结果，答案应该是21212121 9.1000瓶水，有一瓶有毒，让一只小白鼠喝掉任意数量的有毒液体，一周后死亡，给你一 周时间，至少需要多少只小白鼠能找到有毒的液体？ A.9 B.10 C.32 D.999 E.以上都不对 10.以下哪一个结果为1？ A.主函数执行后的返回值 B.Return(7&1); C.Char *a=”Microsoft”; return a == “Microsoft”; D.Return “Microsoft”==”Microsoft”; E.以上都不对 11.32位有符号整数F和G是由F=X/2和G=X>>1得到，如果F不等于G，说明什么？ A.编译错误 B.X是奇数 C.X是负数 D.F-G=1 E.G-F=1 12.3*4的格子有几个矩形？ A.B.C.D.60 E.都不对 13.一条线把平面分成两块，两条线把平面分成四块，如果任意两条线不平行。。100条线 分成多少块 A.5051 14.哪个排序是稳定的？ A.Bubble B.QuickSort C.Merge D.Heap E.Select 15.MVC以下哪个说法正确？ A． Model是表示数据和业务逻辑 B． View是用户交互。。 C． Controller。。 D． Model用于get和post用户的输入，然后交给控制器 E． 以上都不对 16.知道以下哪种遍历可以还原二叉树： A． 先序和中序 B． 先序和后序 C． 后序和中序 D． 后序 17.N个字符的string，每个字符都不相同，它共有多少个子串？ A.B.2^n C.n(n+1)/2 D.n! 18.Update set copy = copy+1 where authorID in Select authid from table groupby authorID Having sum(copy)<= 8 对几条数据产生变化： Xx XXXXXcopyauthorID A.1B.2C.3D.4E.5 19.一个图求最短路径 A B C D20 E21 20.有N个球，其中只有一个是重量较轻的，用天平只称三次就能找到较轻的球，以下的N 值哪个是可能的？ A 12 B 16 C 20 D 24 E 28 只有5分钟,超过5分钟就放弃,因为你绝对不会被微软招聘.这是微软招聘时的智力测试！！超过5分钟,淘汰！！ test 1 烧一根不均匀的绳需用一个小时，如何用它来判断半个小时？ test 2 。。 。。 。。 请仅用一笔画四根直线，将上图9各点全部连接。 test 3 对一批编号为1~100全部开关朝上（开）的灯进行以下操作： 凡是1的倍数反方向拨一次开关；2的倍数反方向又拨一次开关；3的倍数反方向又 拨一次开关。。。 问：最后为关熄状态的灯的编号。 1.String reorder Time Limit: 10000ms Case Time Limit: 1000ms Memory Limit: 256MB Description For this question, your program is required to process an input string containing only ASCII characters between ‘0’ and ‘9’, or between ‘a’ and ‘z’(including ‘0’, ‘9’, ‘a’, ‘z’).Your program should reorder and split all input string characters into multiple segments, and output all segments as one concatenated string.The following requirements should also be met, 1.Characters in each segment should be in strictly increasing order.For ordering, ‘9’ is larger than ‘0’, ‘a’ is larger than ‘9’, and ‘z’ is larger than ‘a’(basically following ASCII character order).2.Characters in the second segment must be the same as or a subset of the first segment;and every following segment must be the same as or a subset of its previous segment.Your program should output string “ Input consists of multiple cases, one case per line.Each case is one string consisting of ASCII characters.Output For each case, print exactly one line with the reordered string based on the criteria above.Sample In aabbccdd 007799aabbccddeeff113355zz 1234.89898 abcdefabcdefabcdefaaaaaaaaaaaaaabbbbbbbddddddee Sample Out abcdabcd 013579abcdefz013579abcdefz 2.K-th string Time Limit: 10000ms Case Time Limit: 1000ms Memory Limit: 256MB Description Consider a string set that each of them consists of {0, 1} only.All strings in the set have the same number of 0s and 1s.Write a program to find and output the K-th string according to the dictionary order.If such a string doesn’t exist, or the input is not valid, please output “Impossible”.For example, if we have two ‘0’s and two ‘1’s, we will have a set with 6 different strings, {0011, 0101, 0110, 1001, 1010, 1100}, and the 4th string is 1001.Input The first line of the input file contains a single integer t(1 ≤ t ≤ 10000), the number of test cases, followed by the input data for each test case.Each test case is 3 integers separated by blank space: N, M(2 <= N + M <= 33 and N , M >= 0), K(1 <= K <= 1000000000).N stands for the number of ‘0’s, M stands for the number of ‘1’s, and K stands for the K-th of string in the set that needs to be printed as output.Output For each case, print exactly one line.If the string exists, please print it, otherwise print “Impossible”.Sample In 3 2 2 2 2 2 7 4 7 47 Sample Out 0101 Impossible 01010111011 3.Reduce inversion count Time Limit: 10000ms Case Time Limit: 1000ms Memory Limit: 256MB Description Find a pair in an integer array that swapping them would maximally decrease the inversion count of the array.If such a pair exists, return the new inversion count;otherwise returns the original inversion count.Definition of Inversion: Let(A[0], A[1]...A[n])be a sequence of n numbers.If i < j and A[i] > A[j], then the pair(i, j)is called inversion of A.Example: Count(Inversion({3, 1, 2}))= Count({3, 1}, {3, 2})= 2 InversionCountOfSwap({3, 1, 2})=> { InversionCount({1, 3, 2})= 1 <--swapping 1 with 3, decreases inversion count by 1 InversionCount({2, 1, 3})= 1 <--swapping 2 with 3, decreases inversion count by 1 InversionCount({3, 2, 1})= 3 <--swapping 1 with 2 , increases inversion count by 1 } Input Input consists of multiple cases, one case per line.Each case consists of a sequence of integers separated by comma.Output For each case, print exactly one line with the new inversion count or the original inversion count if it cannot be reduced.Sample In 3,1,2 1,2,3,4,5 Sample Out 1 0 4.Most Frequent Logs Time Limit: 10000ms Case Time Limit: 3000ms Memory Limit: 256MB Description In a running system, there're many logs produced within a short period of time, we'd like to know the count of the most frequent logs.Logs are produced by a few non-empty format strings, the number of logs is N(1=N=20000), the maximum length of each log is 256.Here we consider a log same with another when their edit distance(see note)is = 5.Also we have a)logs are all the same with each other produced by a certain format string b)format strings have edit distance 5 of each other.Your program will be dealing with lots of logs, so please try to keep the time cost close to O(nl), where n is the number of logs, and l is the average log length.Note edit distance is the minimum number of operations(insertdeletereplace a character)required to transform one string into the other, please refer to httpen.wikipedia.orgwikiEdit_distance for more details.Input Multiple lines of non-empty strings.Output The count of the most frequent logs.Sample In Logging started for id:1 Module ABC has completed its job Module XYZ has completed its job Logging started for id:10 Module ? has completed its job Sample Out 3 1.String reorder Time Limit: 10000ms Case Time Limit: 1000ms Memory Limit: 256MB Description For this question, your program is required to process an input string containing only ASCII characters between ‘0’ and ‘9’, or between ‘a’ and ‘z’(including ‘0’, ‘9’, ‘a’, ‘z’).Your program should reorder and split all input string characters into multiple segments, and output all segments as one concatenated string.The following requirements should also be met,1.Characters in each segment should be in strictly increasing order.For ordering, ‘9’ is larger than ‘0’, ‘a’ is larger than ‘9’, and ‘z’ is larger than ‘a’(basically following ASCII character order).2.Characters in the second segment must be the same as or a subset of the first segment;and every following segment must be the same as or a subset of its previous segment.Your program should output string “ Input consists of multiple cases, one case per line.Each case is one string consisting of ASCII characters.Output For each case, print exactly one line with the reordered string based on the criteria above.Sample In aabbccdd 007799aabbccddeeff113355zz 1234.89898 abcdefabcdefabcdefaaaaaaaaaaaaaabbbbbbbddddddee Sample Out abcdabcd 013579abcdefz013579abcdefz Abcdefabcdefabcdefabdeabdeabdabdabdabdabaaaaaaa 2.K-th string Time Limit: 10000ms Case Time Limit: 1000ms Memory Limit: 256MB Description Consider a string set that each of them consists of {0, 1} only.All strings in the set have the same number of 0s and 1s.Write a program to find and output the K-th string according to the dictionary order.If such a string doesn’t exist, or the input is not valid, please output “Impossible”.For example, if we have two ‘0’s and two ‘1’s, we will have a set with 6 different strings, {0011, 0101, 0110, 1001, 1010, 1100}, and the 4th string is 1001.Input The first line of the input file contains a single integer t(1 ≤ t ≤ 10000), the number of test cases, followed by the input data for each test case.Each test case is 3 integers separated by blank space: N, M(2 <= N + M <= 33 and N , M >= 0), K(1 <= K <= 1000000000).N stands for the number of ‘0’s, M stands for the number of ‘1’s, and K stands for the K-th of string in the set that needs to be printed as output.Output For each case, print exactly one line.If the string exists, please print it, otherwise print “Impossible”.Sample In2 22 77 47 Sample Out 0101 Impossible 01010111011 3.Reduce inversion count Time Limit: 10000ms Case Time Limit: 1000ms Memory Limit: 256MB Description Find a pair in an integer array that swapping them would maximally decrease the inversion count of the array.If such a pair exists, return the new inversion count;otherwise returns the original inversion count.Definition of Inversion: Let(A[0], A[1]...A[n])be a sequence of n numbers.If i < j and A[i] > A[j], then the pair(i, j)is called inversion of A.Example: Count(Inversion({3, 1, 2}))= Count({3, 1}, {3, 2})= 2 InversionCountOfSwap({3, 1, 2})=> { InversionCount({1, 3, 2})= 1 <--swapping 1 with 3, decreases inversion count by 1 InversionCount({2, 1, 3})= 1 <--swapping 2 with 3, decreases inversion count by 1 InversionCount({3, 2, 1})= 3 <--swapping 1 with 2 , increases inversion count by 1 } Input Input consists of multiple cases, one case per line.Each case consists of a sequence of integers separated by comma.Output For each case, print exactly one line with the new inversion count or the original inversion count if it cannot be reduced.Sample In 3,1,2 1,2,3,4,5 Sample Out 4.Most Frequent Logs Time Limit: 10000ms Case Time Limit: 3000ms Memory Limit: 256MB Description In a running system, there're many logs produced within a short period of time, we'd like to know the count of the most frequent logs.Logs are produced by a few non-empty format strings, the number of logs is N(1=N=20000), the maximum length of each log is 256.Here we consider a log same with another when their edit distance(see note)is = 5.Also we have a)logs are all the same with each other produced by a certain format string b)format strings have edit distance5 of each other.Your program will be dealing with lots of logs, so please try to keep the time cost close to O(nl), where n is the number of logs, and l is the average log length.Note edit distance is the minimum number of operations(insertdeletereplace a character)required to transform one string into the other, please refer to httpen.wikipedia.orgwikiEdit_distance for more details.Input Multiple lines of non-empty strings.Output The count of the most frequent logs.Sample In Logging started for id:1 Module ABC has completed its job Module XYZ has completed its job Logging started for id:10 Module ? has completed its job Sample Out第三篇：微软招聘智力测试题
第四篇：微软2014实习生招聘及技术类秋令营招聘onlinetest编程题
第五篇：微软2014实习生招聘及技术类秋令营招聘onlinetest编程题
点击咨询 