剑知北美生活快报   版面列表   admin登录
JiansNet Logo


Microsoft Interview Questions

by JC, published: 2009-11-30 13:03 viewed: 822 times
想了解更多的美国生活窍门?请订阅: JC写的剑知北美生活快报。
Microsoft spearheaded the now popular trend of judging candidates on the basis of general problem-solving performance. Google is now better known.

* If you had an infinite supply of water and a 5 quart and 3 quart pail, how would you measure exactly 4 quarts?

* If you are on a boat and you throw out a suitcase, will the level of water increase?

* On an average, how many times would you have to open the Seattle phone book to find a specific name?

* There are 3 ants at 3 corners of a triangle, they randomly start moving towards another corner. What is the probability that they don't collide?

* If you look at a clock and the time is 3:15, what is the angle between the hour and the minute hands? ( The answer to this is not zero!)

* What new feature would you add to MSWORD if you were hired?

* Why did you pick the school you graduated from?

* Why do you want to work for Microsoft?

* Design a music system for a car. What are the features? Draw a picture.

* Design a GPS navigation unit for a hiker

* Design a communication device for Canadian park rangers.

* Design a remote control for an automatic window-blind system.

* Design a coffee maker that will be used by astronauts.

* Design an alarm clock.

* Design an alarm clock for a blind person.

* Design a search function

* What are examples of poorly designed software?

* Design an instant messaging system.

* I am your grandmother. Describe what MATLAB is to me.

* How would you explain what a database is to a 5-year-old?

* Write code for an electronic messaging board. What happens when a user logs on?

* Develop an algorithm for selecting objects in Visio.

* Tell me about a time when you made a decision and later found out that it was incorrect. What did you do to resolve the issue?

* Suppose you are one week away from the product shipping date and discover a bug in your software. What do you do?

* You have a linked list and don't know how long it is; how do you find the middle of it?

* How would you test a keyboard?

* How would you test a pen?

* Write code for finding a duplicate in an array.

* Write code that returns the length of a string without using any built-in functions.

* Reverse a Singly Linked List with and without using Recursion.

* Find if a BST is well formed.

* Reverse every word in a String (abc def becomes cba fed).

* What method would you use to look up a word in a dictionary?

* Write a function that returns the angle between the hour and the minute hands of a clock, given input of the time.

* Write a function that takes a string consisting of numeral characters and returns all possible alpha character strings of same length as input that correspond to the keypad of a typical telephone.

* Imagine you have a closet full of shirts. It’s very hard to find a shirt. So what can you do to organize your shirts for easy retrieval?

* How would you test an elevator?

* How would you test a vending machine?

* How would you test a program that takes in two points and outputs the distance between the two points?

* Test the Windows scroll bar.

* Switch every pair of words in a string ("ab cd ef gh" becomes "cd ab gh ef")

* Write the function for strstr function (finding a substring inside a string)

* Reverse the order of words in a string ("ab cd ef gh" becomes "gh ef cd ab")

* Write the function for string comparison. How would you test it?

* Write a function to zero all duplicate values in an integer array. How would you test it?

* Write a function that compares two strings and returns a third string containing only the letters that appear in both.

* How many Gas stations are there in the US?

* How would you weigh a plane without using scales?

* How would you move Mt. Everest?
本文版权属于美国剑知信息网。如需转载,请先同我们联系。
订阅JC写的剑知北美生活快报,您会了解到更多的美国生活窍门。
Related Articles:
• Some Amazon Interview Questions
• Best Computer Science Interview Books
• Common Computer Science Interview Questions
美国职业发展 | 返回顶部 | 返回首页
About Us | Advertise with Us | Privacy Policy
Copyright © 2007-2016, All Rights Reserved.