【正文】 20011013 來源: Cernet留言板 re：微軟招聘時(shí)的智力測(cè)試  劃線： 設(shè)正方形四個(gè)角的坐標(biāo)分別是(0,0),(0,3),(3,0),(3,3) 第一筆：(3,0) to (0,3) 第二筆：to (0,1) 第三筆：to (4,3) 第四筆：to (0,3) MS的題庫好象很小嘛，就這么幾道 1。 第三部分　　編程題，編程找出ABCDEF...按字母順序的所有組合，用遞歸。共有10道。 四個(gè)人的步行速度各不同，若兩人同行則以較慢者的速度為準(zhǔn)。Ms made? * If you had to learn a new puter language, how would you go about doing it?* If MS told you we were willing to invest $5 million in a start up of your choice, what business would you start? Why? * If you could gather all of the puter manufacturers in the world together into one room and then tell them one thing that they would be pelled to do, what would it be?* Explain a scenario for testing a salt shaker. * If you are going to receive an award in 5 years, what is it for and who is the audience?* How would you explain how to use Microsoft Excel to your grandma?* Why is it that when you turn on the hot water in any hotel, for example, the hot water es pouring out almost instantaneously?Algorithms * What39。 3 對(duì)一批編號(hào)為1~100全部開關(guān)朝上（開）的燈進(jìn)行以下操作： 凡是1的倍數(shù)反方向撥一次開關(guān)；2的倍數(shù)反方向又撥一次開關(guān)；3的倍數(shù)反方向又撥一次開關(guān)。ve got someone working for you for seven days and a gold bar to pay them. The gold bar is segmented into seven connected pieces. You must give them a piece of gold at the end of every day. If you are only allowed to make two breaks in the gold bar, how do you pay your worker? * One train leaves Los Angeles at 15mph heading for New York. Another train leaves from New York at 20mph heading for Los Angeles on the same track. If a bird, flying at 25mph, leaves from Los Angeles at the same time as the train and flies back and forth between the two trains until they collide, how far will the bird have traveled?* You have two jars, 50 red marbles and 50 blue marbles. A jar will be picked at random, and then a marble will be picked from the jar. Placing all of the marbles in the jars, how can you maximize the chances of a red marble being picked? What are the exact odds of getting a red marble using your scheme?* Imagine you are standing in front of a mirror, facing it. Raise your left hand. Raise your right hand. Look at your reflection. When you raise your left hand your reflection raises what appears to be his right hand. But when you tilt your head up, your reflection does too, and does not appear to tilt his/her head down. Why is it that the mirror appears to reverse left and right, but not up and down? * You have 4 jars of pills. Each pill is a certain weight, except for contaminated pills contained in one jar, where each pill is weight + 1. How could you tell which jar had the contaminated pills in just one measurement?* If you had an infinite supply of water and a 5 quart and 3 quart pail, how would you measure exactly 4 quarts?* You have a bucket of jelly beans. Some are red, some are blue, and some green. With your eyes closed, pick out 2 of a like color. How many do you have to grab to be sure you have 2 of the same?* Which way should the key turn in a car door to unlock it?* If you could remove any of the 50 states, which state would it be and why? 數(shù)學(xué)篇1000!有幾位數(shù)，為什么 F(n)=1 n8 n12 F(n)=2 n2 F(n)=3 n=6 F(n)=4 n=other 使用+ * /和sign(n)函數(shù)組合出F(n)函數(shù) sign(n)=0 n=0 sign(n)=1 n0 sign(n)=1 n0 編一個(gè)程序求質(zhì)數(shù)的和例如F(7)=1+3+5+7+11+13+17=58 智力題 只有5分鐘,超過5分鐘就放棄,因?yàn)槟憬^對(duì)不會(huì)被微軟招聘. 這是微軟招聘時(shí)的智力測(cè)試!!!!超過5分鐘,淘汰!!!! 1 燒一根不均勻的繩需用一個(gè)小時(shí)，如何用它來判斷半個(gè)小時(shí)？ 2 。 微軟試題微軟，軟件業(yè)的巨人，是每個(gè)的特別是年輕軟件開發(fā)人的夢(mèng)想之地，微軟的面試是非常嚴(yán)格的，錄取比例大約是60有中選一人，相信可愛的夢(mèng)想家們肯定急切的想知道怎么樣才能幸運(yùn)的成為1/60！ 　　微軟面試試題可分為（1）迷語，（2）算法，（3）應(yīng)用程序，（4）智力等等， 本文為迷語篇　　現(xiàn)取部分試題內(nèi)容： 　　　??？ 　　？ 　　，回報(bào)是一根金條。 只要一用就會(huì)出現(xiàn)題目中的錯(cuò)誤。a[0] 也不行 */ printf(What you have input is %f, *a)。 printf(Please input: )。 a = (float *)malloc(10*sizeof(float))。 /* amp。 } re：招聘考題一道  。 其實(shí)方法很多的。抓取多少個(gè)就可以確定你肯定有兩個(gè)同一顏色的果凍？ 　　，向哪個(gè)方向旋轉(zhuǎn)就可以打開車鎖？ ，那你去掉哪一個(gè)，為什么？Riddles * Why is a manhole cover round?* How many cars are there in the USA?* You39。 請(qǐng)僅用一筆畫四根直線，將上圖9各點(diǎn)全部連接。s the difference between a linked list and an array? * Implement an algorithm to sort a linked list. Why did you pick the method you did? * Implement an algorithm to sort an array. Why did you pick the method you did?* Implement strstr() (or some other string library function). * Reverse a string. Optimize for speed. Optimize for space.* Count the number of set bits in a number. Now optimize for speed. Now optimize for size.* How would you find a cycle in a linked list?* Give me an algorithm to shuffle a deck of cards, given that the cards are stored in an array of ints.* Write a function that takes in a string parameter and checks to see whether or not it is an integer, and if it is then return the integer value. * Write a function to print all of the permutations of a string. * Implement malloc. * Write a function to print the Fibonacci numbers. * Write a function to copy two strings, A and B. The last few bytes of string A overlap the first few bytes of string B. * How would you print out the data in a binary tree, level by level, starting at the top? 部分微軟試題 U2合唱團(tuán)在17分鐘內(nèi)得趕到演唱會(huì)場(chǎng)，途中必需跨過一座橋，四個(gè)人從橋的同一 端出發(fā)，你得幫助他們到達(dá)另一端，天色很暗，而他們只有一只手電筒。 Bono需花1分鐘過橋 Edge需花2分鐘過橋 Adam需花5分鐘過橋 Larry需花10分鐘過橋 他們要如何在17分鐘內(nèi)過橋呢？(這是Micrsoft征聘人員時(shí)問的問題，你必須在五分鐘內(nèi)答出來才可能獲得聘用。 第二部分　　回答題，前面是和數(shù)有關(guān)的：如1000!，非質(zhì)數(shù)的排列。 第四部分　　英語寫作，寫一份，翻譯一小段中文。1000!有幾位數(shù)，為什么 解: 1000 Lg(1000!)=sum(Lg(n)) n=1 用3段折線代替曲線，可以得到 10(0+1)/2+90(1+2)/2+900(2+3)/2=2390 作為近似結(jié)果,好象1500~3000都算對(duì) : 2。 ，一個(gè)3夸脫的和一個(gè)5夸脫的提桶，你如何準(zhǔn)確稱出4夸脫的水？ 這個(gè)比較復(fù)雜： （以下簡(jiǎn)稱35)，在5夸脫桶中做好標(biāo)記b1（簡(jiǎn)稱b1) ，空3，將5中水倒入3直到b1，在3中做標(biāo)記b2 ，空5，將3中水倒入5直到b2 ，將5中水倒入3，標(biāo)記為b3 ，空3，將5中水倒入3，直到3中水到b3 結(jié)束了，現(xiàn)在5中水為標(biāo)準(zhǔn)的4夸脫水 re：微軟面試（謎語篇）  倒水： 裝滿5 5倒入3(5余2) 5倒入3(3余1) 裝滿5 5倒入3(5余4) re：微軟面試（謎語篇）  鏡子： 因?yàn)槿说膬裳墼谒椒较蛏蠈?duì)稱 re：微軟面試（謎語篇）  鏡子那題錯(cuò)了 其實(shí)影象并沒有左右倒置，那是虛像 re：微軟面試（謎語篇）  看看海豹的發(fā)言 作者: 深深的海洋 時(shí)間: 20011015 來源: Cernet留言板 re：微軟面試（謎語篇）  I think 井蓋是圓的是因?yàn)樵谕?