application problem

Friends, if you want to enter Microsoft, the requirements will be more demanding. After all, the treatment is generous. I didn't have the water to go to Microsoft myself, so I chose Fujitsu. Know yourself a little, I hope I can help you.

First of all, hardware conditions are needed. Needless to say, English level should be at least CET-6, and listening and speaking is better. Secondly, undergraduates are generally less likely to enter Microsoft, and there are more opportunities for graduate students. Of course, if they are excellent, you can also try. Personally, I think technology is more important than certificate, and creative thinking is more important than technology.

Writing C language, data structure (very important, especially sorting, searching, linked list, binary tree) must be tested, because everyone learns. Of course, java and. Net is generally a minor issue, and database SQL statements are basically necessary. Of course, there may be puzzles. The more practical experience, the better, and the deeper the understanding of technology, the better. Do more test questions.

If you can successfully pass the written test, it depends on the interview. Microsoft usually has at least five rounds of interviews. If you fail in any round, you will be 88. It will definitely involve English interview, technical interview, intellectual investigation, professional quality investigation, human resources interview and round trip.

I'll give you some questions about the intelligence of Microsoft. You can look at them. Microsoft attaches great importance to thinking, so there will be such a problem. I hope you can get ready as soon as possible.

Microsoft puzzle

1. It takes 1 hour to burn an uneven rope from beginning to end. How to determine the time of half an hour by burning rope?

2. 10 pirates robbed 100 gems, each of which is the same size and priceless. They decided to divide it like this:

(1) Draw lots to decide your own number (1~10);

(2) First, 1 put forward the distribution plan, and then everyone voted. When and only when more than half of the people agree, they will be distributed according to his plan, otherwise they will be thrown into the sea to feed sharks;

(3) If 1 dies, No.2 puts forward a distribution plan, and then the remaining four people vote. If and only if more than half of the people agree, they will be distributed according to his plan, otherwise they will be thrown into the sea to feed sharks;

(4) and so on ...

Conditions: Every pirate is a very smart person who can make rational judgments and make choices.

Question: What kind of distribution scheme does the first pirate propose to maximize his income?

3. Why is the cover of the sewer round?

4. How many cars are there in China?

You let the workers work for you for 7 days, and the reward is a gold bar. This gold bar is divided into seven connected parts, and you must give them a gold bar at the end of each day. If you were only allowed to break the gold bars twice, how would you pay the workers?

6. One train leaves Beijing for Guangzhou at a speed of15km/h, and another train leaves Guangzhou for Beijing at a speed of 20km/h.. If a bird leaves with two trains at a speed of 30 kilometers per hour, it starts from Beijing, meets another car, and then returns to fly in the opposite direction, so it flies back and forth between the two trains in turn until the two trains meet. How long did the bird fly?

7. You have two cans, 50 red marbles and 50 blue marbles. Choose a jar at random and put a marble in the jar at random. How do you give the best chance to choose red marbles? What are the chances of getting the red ball in your plan?

8. Imagine you are standing in front of a mirror. Excuse me, why can the image in the mirror be upside down, but not upside down?

9. If you have unlimited water, a 3-liter spoon and a 5-liter spoon, and the shapes of the two spoons are uneven, how can you accurately weigh 4 liters of water?

10. You have a bucket of jelly, including yellow, green and red. Close your eyes and grab two of the same color. How many times can I be sure that you must have two jellies of the same color?

1 1. How many groups of * * * consecutive integers sum to 1000?

12. Planes of the same model start from the same place, but each plane can only fly around the earth for half a week with full fuel, and it can refuel between planes, and the plane that has finished refueling must return to the starting point. Ask at least how many flights are needed to meet the demand of a plane circling the earth once.

Reference answer:

1. Burn both sides together.

2.96,0, 1,0, 1,0, 1,0, 1,0。

3. Because the mouth is round.

4. A lot.

5. 1, 2, 4.

6.6/7 Distance from Beijing to Guangzhou.

7. 100%。

8. Plane mirror imaging principle (or "eyes are left and right").

9.3 Fill it first, pour it into 5 Li, then fill it into 3 Li and pour it into 5 Li. Pour out the water in 5 Li, pour the remaining water in 3 Li into 5 Li, then fill 3 Li and pour it into 5 Li, ok!

10. Once.

1 1. First, 1000 is a solution. The average value of consecutive numbers is set to X, and 1000 must be an integer multiple of X. If the number of consecutive numbers is even, then X is not an integer. 2 times of x can only be 5,25, 125. Because the average value is 12.5, it will not reach 80 continuously. 125/2? 62.5 Not bad. That is, 62,63,6164, and so on. When the number of consecutive numbers is odd, the average value is an integer. 1000 is an odd multiple of the average. 1000? 2×2×2×5×5×5; X can be 2, 4, 8, 40, 200, or 40, 200 after division. So the answer is four groups of integers with an average value of 62.5, 40,200, 1000.

12. The answer is 5 sorties. The general solution can be divided into the following two parts:

(1) flying in a straight line

The flight distance of the plane with full fuel is 1. How far can n planes fly? The question is, how far can n planes fly? The extreme problem is not to fly repeatedly. For example, two planes refuel one plane and fly back at the same time. In other words, the farther away from the starting point, the fewer planes fly. This extreme situation is obvious because n planes carry a certain amount of oil. If it is repeated, the more oil will be wasted. For example, there must be only one plane flying all the way in the end. Pay attention to the word "all the way", which is an extreme situation that should not be repeated. If it's two planes, it must be one that fills up the other, so that the remaining oil can just go back. That is to say, the fuel consumption of the second plane is three times that of the take-off to refuel, and the fuel consumption of the third plane of the three planes is five times that of the take-off to refuel. So the farthest distance that N planes can fly is S? The series of1+1/3+…+1/(2n+ 1) is divergent, so in theory, as long as there are enough planes, an airplane can eventually fly to infinity, but in fact, it is impossible for an airplane to fly1/(. 1 refuel the plane.

(2) You can meet head-on and come on.

The flight distance of the plane with full fuel is 1/2. How many planes can fly at least 1? It is also based on the extreme condition of non-repeated flight, and it is concluded that there must be only one plane flying in the farthest distance, so there must be one plane flying on both sides of symmetry at 1/2. According to the above formula, one side needs at least two planes to support it, (1/3+1/5)/2 > 1/4 (divided by 2 on the left, the flight distance of an airplane is 1/2), but there is still a little bit left, so if you think of it as a pulley (the airplane in the middle is a rope, and the two airplanes on both sides are great), you can slide a little bit, which means you can change the refueling position within a certain distance (it is easy to calculate the refueling position of each airplane) ).

I wish you success!