 |
 |
 |
|
|
| |
|
|
| |
| |
| |
|
|
|
| |
| |
|
|
At
Microsoft India Development
Center our teams develop
strategic products for Microsoft
|
|
| |
|
|
|
|
|
|
|
|
|
|
|
 |
|
|
|
| |
|
|
|
| |
|
|
| |
| |
|
|
|
|
The Contest registrations opened
on 1st of January 2006 and comprised of three online technical
challenges administered
on the URL www.code4bill.com
which were solved by the Contestants.
The first two rounds were
qualifying rounds where all the
Participants scoring above the
cutoff marks moved to the next
round. The top 10% based on the
cumulative scores at the end of
round three then moved to the
next stage.
Round 1 : January 21 & January
22 : Results announced : January
25 2006
Round 2 : January 28 & January
29 : Results announced : January
31 2006
Round 3 : February 4 2006 : Results
announced : February 9 2006 |
|
|
|
|
The
top 10% Participants who successfully
solve the series of online challenges
in the 1st stage of the Contest
underwent face-to-face
interviews with an interview panel
comprising of Microsoft executives.
Interview Dates : February 18
& 19, February 25 & 26
: Results Announced : March 4th
2006 |
|
|
|
|
The
short listed twenty (20) Participants
got an opportunity to intern
with Microsoft India offices as
per the terms and conditions of
internship at Microsoft. During
the internship, the Participants
were asked to design and code
solutions for technical and, or,
social problems. Based on the
feedback from the Project Supervisor
and the scores obtained post the
final project presentation to
an evaluation panel appointed
by Microsoft, 5 of these twenty
participants moved to the
last stage (stage IV). |
|
|
|
|
In
the final stage of the Contest,
the top five (5) Participants
will faced a series of challenges
administered/conceived by Bill
Gates Technical Assistant. Based
on the scores obtained at the
end of this stage, one out of
these 5 contestants was selected
to work with Bill Gates technical
team at Redmond, USA for a period
of one year. |
|
|
|
|
|
|
|
|
|
| |
| |
| |
|
|
| |
| |
| Here
are some of the questions that the code4bill contestants
answered. How about trying your hand at them? |
| • |
Multiply
14332 represented in base -7 with 16430 represented
in base -8 and represent the output in base -9. |
| • |
An array
contains 9 occurrences of 0s, 8 occurrences of 1s and
7 occurrences of 2s in any order. The array is to be
sorted using only swap operations. What is the minimum
number of swaps needed in the worst case to sort the
array? |
| • |
You are given an infinite number of cookie boxes containing either 6, 9 or 400 cookies. You are allowed to use these boxes in any combination so desired. What is the maximum number of cookies that you cannot give out using the above boxes? |
|
|
|
|
|
|
|
| |
|
|
| |
| |
|
|
| |
|
|
|
|
|
