Google 的21道面试问题

10月底，Google在美国《麻省技术评论》、《LinuxJournal》、《Mensa》、《今日物理》等几本专业杂志上，刊登了一份“Google实验室能力倾向测试”。
源代码网推荐
源代码网推荐 试卷开头，蛊惑地写着“试试看！把答案寄回Google，你有希望去Google总部参观，并成为我们其中一员”。
源代码网推荐
源代码网推荐 我看了这些题目，虽然古怪，但是也不算有困难，有兴趣的人可以做完了邮寄给google公司，也许会得到一个工作机会呢。
源代码网推荐
源代码网推荐 注：不要向我要答案。
源代码网推荐 1. Solve this cryptic equation, realizing of
源代码网推荐 course that values for M and E could be
源代码网推荐 interchanged. No leading zeros are allowed.
源代码网推荐 WWWDOT - GOOGLE = DOTCOM
源代码网推荐 2. Write a haiku describing possible methods
源代码网推荐 for predicting search traffic seasonality.
源代码网推荐 3.
源代码网推荐 1
源代码网推荐 1 1
源代码网推荐 2 1
源代码网推荐 1 2 1 1
源代码网推荐 1 1 1 2 2 1
源代码网推荐 What is the next line?
源代码网推荐 4. You are in a maze of twisty little passages,
源代码网推荐 all alike. There is a dusty laptop here with a
源代码网推荐 weak wireless connection. There are dull,
源代码网推荐 lifeless gnomes strolling about. What dost
源代码网推荐 thou do?
源代码网推荐 A) Wander aimlessly, bumping into
源代码网推荐 obstacles until you are eaten by a grue.
源代码网推荐 B) Use the laptop as a digging device to
源代码网推荐 tunnel to the next level.
源代码网推荐 C) Play MPoRPG until the battery dies
源代码网推荐 along with your hopes.
源代码网推荐 D) Use the computer to map the nodes
源代码网推荐 of the maze and discover an exit path.
源代码网推荐 E) Email your resume to Google, tell the
源代码网推荐 lead gnome you quit and find yourself
源代码网推荐 in whole different world.
源代码网推荐 5. What"s broken with Unix?
源代码网推荐 How would you fix it?
源代码网推荐 6. On your first day at Google, you discover
源代码网推荐 that your cubicle mate wrote the textbook
源代码网推荐 you used as a primary resource in your first
源代码网推荐 year of graduate school. Do you:
源代码网推荐 A) Fawn obsequiously and ask if you
源代码网推荐 can have an autograph.
源代码网推荐 B) Sit perfectly still and use only soft
源代码网推荐 keystrokes to avoid disturbing her
源代码网推荐 concentration.
源代码网推荐 C) Leave her daily offerings of granola
源代码网推荐 and English toffee from the food bins.
源代码网推荐 D) Quote your favorite formula from the
源代码网推荐 textbook and explain how it"s now
源代码网推荐 your mantra.
源代码网推荐 E) Show her how example 17b could
源代码网推荐 have been solved with 34 fewer lines
源代码网推荐 of code.
源代码网推荐 7. Which of the following expresses Google□
源代码网推荐 over-arching philosophy?
源代码网推荐 A) "I"m feeling lucky"
源代码网推荐 B) "Don"t be evil"
源代码网推荐 C) "Oh, I already fixed that"
源代码网推荐 D) "You should never be more than
源代码网推荐 50 feet from food"
源代码网推荐 E) All of the above
源代码网推荐 8. How many different ways can you color an
源代码网推荐 icosahedron with one of three colors on
源代码网推荐 each face?
源代码网推荐 What colors would you choose?
源代码网推荐 9. This space left intentionally blank. Please fill it
源代码网推荐 with something that improves upon emptiness.
源代码网推荐 10.On an infinite, two-dimensional, rectangular
源代码网推荐 lattice of 1-ohm resistors, what is the
源代码网推荐 resistance between two nodes that are a
源代码网推荐 knight"s move away?
源代码网推荐 11.It"s 2 PM on a sunny Sunday afternoon in the
源代码网推荐 Bay Area. You"re minutes from the Pacific
源代码网推荐 Ocean, redwood forest hiking trails and world
源代码网推荐 class cultural attractions. What do you do?
源代码网推荐 12.In your opinion, what is the most beautiful
源代码网推荐 math equation ever derived?
源代码网推荐 13. Which of the following is NOT an actual
源代码网推荐 interest group formed by Google employees?
源代码网推荐 A. Women"s basketball
源代码网推荐 B. Buffy fans
源代码网推荐 C. Cricketeers
源代码网推荐 D. Nobel winners
源代码网推荐 E. Wine club
源代码网推荐 14.What will be the next great improvement in
源代码网推荐 search technology?
源代码网推荐 15.What is the optimal size of a project team,
源代码网推荐 above which additional members do not
源代码网推荐 contribute productivity equivalent to the
源代码网推荐 percentage increase in the staff size?
源代码网推荐 A) 1
源代码网推荐 B) 3
源代码网推荐 C) 5
源代码网推荐 D) 11
源代码网推荐 E) 24
源代码网推荐 16.Given a triangle ABC, how would you use only
源代码网推荐 a compass and straight edge to find a point P
源代码网推荐 such that triangles ABP, ACP and BCP have
源代码网推荐 equal perimeters? (Assume that ABC is
源代码网推荐 constructed so that a solution does exist.)
源代码网推荐 17.Consider a function which, for a given whole
源代码网推荐 number n, returns the number of ones required
源代码网推荐 when writing out all numbers between 0 and n.
源代码网推荐 For example, f(13)=6. Notice that f(1)=1. What
源代码网推荐 is the next largest n such that f(n)=n?
源代码网推荐 18.What"s the coolest hack you"ve ever written?
源代码网推荐 19."Tis known in refined company, that choosing
源代码网推荐 K things out of N can be done in ways as
源代码网推荐 many as choosing N minus K from N: I pick K,
源代码网推荐 you the remaining.
源代码网推荐 Find though a cooler bijection, where you show
源代码网推荐 a knack uncanny, of making your choices contain
源代码网推荐 all K of mine. Oh, for pedantry: let K be no more
源代码网推荐 than half N.
源代码网推荐 20.What number comes next in the sequence:
源代码网推荐 10, 9, 60, 90, 70, 66,?
源代码网推荐 A)96
源代码网推荐 B) 1000000000000000000000000000000000
源代码网推荐 0000000000000000000000000000000000
源代码网推荐 000000000000000000000000000000000
源代码网推荐 C) Either of the above
源代码网推荐 D) None of the above
源代码网推荐 21.In 29 words or fewer, describe what you
源代码网推荐 would strive to accomplish if you worked
源代码网推荐 at Google Labs.  
源代码网推荐 源代码网供稿.