爱华网10月底，Google在美国《麻省技术评论》、《LinuxJournal》、《Mensa》、《今日物理》等几本专业杂志上，刊登了一份"Google实验室能力倾向测试"。
试卷开头，蛊惑地写着"试试看！把答案寄回Google，你有希望去Google总部参观，并成为我们其中一员"。
1. Solve this cryptic equation, realizing of course that values for M and E could beinterchanged. 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 ABC, how would you use only a compass and straight edge to find a point P such that s 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 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) 10000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
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.
欢迎参观google: http://www.google.com
?
?
google的招聘试题
Tough problems. Intense competition. No pressure.
Do you have exceptional programming skills? Can you make computers perform like silicon puppets with just a few well-expressed commands? Are you at ease when faced with a hard stop and a group of peers evaluating every line of your code? Here’s your opportunity to display the grace of the true professional in a reward-rich environment.
Google is looking for engineers with the programming skill to rewrite the world‘s information infrastructure. The Google Code Jam 2003 is one way we hope to find them. While we don‘t impose arbitrary deadlines on our engineers, we do put a premium on well-implemented code. And we appreciate the thought process required to create it. In fact, we appreciate clear thinking in all its forms, from puzzle solving to chess mastery (one of our interns was an International Grand Master).
Say it your way
Use Java, C++, C# or VB.NET. Pick any of these programming languages to code your solutions. All are acceptable and none is given an advantage.
How it works
The tournament is a timed contest where all participants compete online to solve the same problems under the same time constraints. Here’s the line-by-line documentation:
Download the Arena
The TopCoder? Competition Arena (a Java Applet) is where you begin. Download the app, read the problem statements, then code solutions, compile and test those solutions and submit the code for points. You can download the arena ahead of time to work on sample problems prior to the competition.
Coding Phase
At the designated date and time, competitors enter the Arena and are placed in groups of ten into virtual rooms. All participants are presented with the same set of three problems of escalating difficulty. In a race to see who can create an accurate solution in the shortest amount of time, competitors try to out-think and out-code their opponents. The Leader Board tallies the points during each step of the competition.
Challenge Phase
During the Challenge Phase, competitors view each other‘s code and try to "break‘" that code by passing test cases through the submitted code, with the hope that the results are not satisfied by the software written. Breaking another developer‘s code is the most direct form of competition for a programmer. In this phase, points are awarded for successful challenges and deducted for unsuccessful challenges.
System Tests
Within minutes of the end of the Challenge Phase, the automated, objective system tests determine the accuracy of all submissions and award final points to all competitors. The assessment of your performance and presentation of stats is nearly instantaneous, as is the gratification of knowing how you did against a competitive field.
Are You Ready?
Registration for the Google Code Jam 2003 opens on October 1st and ends on October 15th, 2003. Registration is unlimited, but only the top 500 scorers from the Qualification Round will advance to Round 1 of the Code Jam 2003 on October 24th.
The competitors with the top 250 scores from Round 1 will advance to Round 2 on October 27th. The top 25 performers in Round 2 will be invited to compete for cash prizes in the Championship Round onsite at the Googleplex (Mountain View, CA) on November 14th.
Date Time* Status
Wednesday, October 1 8:00 AM Registration Opens
Wednesday, October 15 5:00 PM Registration Closes
Friday, October 17 8:00 AM Qualification Round begins
Monday, October 20 8:00 AM Qualification Round ends
Friday, October 24 9:00 PM Round 1 - 500 participants
Monday, October 27 9:00 PM Round 2 - 250 participants
Friday, November 14 4:00 PM Championship Round - 25 participants
*All times are Eastern Time
Prizes
The 500 participants in Round 1 will receive a "Google Code Jam 2003" t-shirt. The top four scorers in the Championship Round will receive the following cash prizes:
1st Place - $10,000
2nd Place - $5,000
3rd Place - $3,500
4th Place - $1,250
Those finalists not finishing as one of the top four scorers in the Championship Round will each receive $250.
To find out more detailed information about the Google Code Jam 2003, including a list of the prizes, please read the Terms and Conditions.
©2003 Google - Home - All About Google - About TopCoder - We‘re Hiring
?
Google测试考的就是脑筋
·试着证明WWWDOT-GOOGLE=DOTCOM·用俳句（一种日本短诗，每句有一个与季节有关的词）来描述各种模型，借此预测网络搜索流量的季节性变化。
·你落入一个迷宫，回旋不断的走廊。手里有一台堆满灰尘的手提电脑，可以无线上网。周围，许多无生命的侏儒徘徊走动。这种情况下，你会如何做？
A)无目的地徘徊，不停走入死胡同，然后被迷宫里面的妖怪吃掉。
B)用手提电脑当铲子，打穿地板直接进入游戏下一关。
C)玩网络游戏《魔法奇兵》，直到电池耗尽。
D)利用计算机，找到迷宫的节点，发现准确出路。
?????? E)把你的简历寄给Google，告诉迷宫里领头的妖怪，你要退出游戏。然后，发现你回到了现实世界。
·Unix有什么问题？你会如何补救它？
·你在Google工作的第一天，发现你同寝室的室友，曾写过一本书。你研究生一年级时，这本书是你最重要的参考资料。你会：A)求他帮你签个名。B)不改坐姿，却放轻打字声音，尽量避免影响他。
C)把你每天吃的麦片和咖啡，留给他吃。
D)引用他那本书中间，你最喜欢的程式，告诉他这则方程给了你多少启发。
E)让他看看，你可以用不到34句语句，完成一个高难度程序。
·以下哪个最好地表达了Google的企业文化？
A)“我感觉挺幸运”
B)“别干坏事”
C)“哦，我已经完成了任务”
D)“你身边10米以内，必定能找到食物”
E)以上皆是·用1欧姆的电阻，组成无限大的放行点阵，问“象棋跳马步”（“日”字对角点）两点之间的电阻是多少？
·下午2点，旧金山著名的湾区。你可以选择去阳光海岸、国家公园的红杉林里徒步旅行，或者参观城市
里的文化景观。你会怎么做？
·搜索技术的下一个革命性突破是什么？
·一个技术研究小组的最优化人员组合是几个人？一旦超过这个数字，每增加一个研究员，平均生产力就会相应下降：A)1B)3C)5D)11E)24·三角形ABC，用圆规和尺，找出点P，保证三角形ABP、ACP和BCP周长相等。
·你写过最酷的程序是什么？
·找出此数列的下一个:10,9,60,90,70,66?A)96B)10的100次方C)A或者BD)以上皆否·用少于29个词，描述你能带给Google实验室的贡献。
