 |
 |
 |
|
|
| |
|
|
| |
| |
| |
|
|
|
| |
| |
|
|
At
Microsoft India Development
Center our teams develop
strategic products for Microsoft
|
|
| |
|
|
|
|
|
|
|
|
|
|
|
 |
|
|
|
| |
|
|
|
| |
|
|
| |
|
 |
|
|
| Indian Institute Of Technology,
Madras |
|
I am an engineering student hailing
from Chennai who just finished his bachelor’s in Electrical
Engineering from IIT Madras. I was the typical student who wrote all
possible medical/engineering entrances and wanted to be a doctor and
ended up at IIT :). I had no idea about which branch to join and joined
EE because the IT field was having a slip then and I thought it was
always possible to learn CS from the outside! |
|
|
|
|
| However within a semester
I realized my true interests and passion lay in Computer
Science and Algorithms and started pursuing them. I started
participating in several programming contests online and
liked the mathematical/algorithmic beauty and the challenges
posed by them. I am a winner of numerous programming contests
organized by several local colleges in India. I have also
represented India in the ACM World Finals.
I am an avid TopCoder and am very passionate about competing,
which has led me all the way to the top. |
| |
| I mostly spend my
time talking endlessly with my friends on a wide range
of topics from philosophy, reservations to Vijayakanth’s
movies and pickup lines. When I am not talking I listen
to music, and I like western classical/instrumental the
most, although I listen to almost every genre of music.
I like reading a lot and usually read fiction with some
theme. Particularly, I am interested in reading about
various philosophies and love the writings of Albert Camus
and Ayn Rand. |
| |
| My typical evenings
are spent at the swimming pool or on long bi-cycle rides
within my campus where I drive without holding the handle
bars. I am recent entrant to the blogosphere and my blog
can be found online here. |
| |
| My ambitions are to
complete a Ph.D and take up research as a career. I hope
to lead a research lab some day and set the directions
for research in computer science. Right now, I am headed
to UCLA for a masters and PhD in CS. |
| |
| Code4bill has been
an awesome experience and a great opportunity to know
about Microsoft. Competing and working on an interesting
project of my choice makes it more fun. |
| |
| My project involves
identifying whether a given snippet of code is present
in a target program or not. Apart from the numerous applications,
ranging from Virus checking to Software watermarking,
the biggest challenge/fun in solving this problem is that
I do not have access to the source code but work only
with the binaries. I construct a graphical representation
of the source and the target programs and then do graph
matching using heuristics. |
| |
| I am available on email
as well as on the forums and would love to interact and
make friends with new people. Please drop a line. |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
| |
| |
|
|
| |
| |
| 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? |
|
|
|
|
|
|
|
| |
|
|
| |
| |
|
|
| |
|
|
|
|
|
