 |
 |
 |
 |
 |
 |
 |
| NSIT, Delhi University |
 |
Hi! I Aman Rathi, graduated this year in Computer Science from
Netaji Subhas Institute of Technology (NSIT), University of Delhi.
Today, as I move on with my life, I must say it really was a beautiful
experience, those four years at college, they taught me a lot about
life. My schooling reminds me of those carefree years I spent at Somerville
School , Noida where I completed my High School; and the Delhi Public
School, R.K. Puram, New Delhi where finished my XII std. |
 |
 |
 |
 |
| I have been the recipient
of the prestigious Kishore Vaigyanik Protsahan Yojana(KVPY).
www.iisc.ernet.in/kvpy/.
Among other awards, I was selected for the Science Leadership
Awards by CSIR and SIA-NOL scholarships after my high
school. Besides, I was also given the Tuition-Waiver and
Scholarship from my University during my undergraduation.
However, noting that present university examination system
isn’t much capable of identifying intellect, since it
stresses more on ‘memorization’, this scholarship
may not really earn me merit! Though an interesting perspective
in this regard could be that I could hold on to this scholarship
even when I always followed the ‘non-conventional’
and ‘non-memorized’ way of studying my courses.
I also happened to co-author two Technical Papers, one
on Image Processing using Page-Locked Operating Systems,
which has been accepted at IEEE International Geoscience
& Remote Sensing Symposium’06, USA; and other
on a Chip Routing Heuristic which has been accepted at
VLSI-SoC’06, France. |
| |
Besides relishing sweets,
I am very enthusiastic when it comes to giving talks.
I gave some interesting ones during my college viz. God
& Computer Science, Quantum Computing etc. My hobbies
include Creative writing, playing badminton, T.T and Harmonica
and listening to music. One of my essays was felicitated
by The Hindustan Times in a World Essay Competition. Also,
during my school years, British Council read my poetry
when they selected me as a student poet. My badminton
and T.T took me to district-level but unfortunately could
not take them higher. My future plan is to join Redmond
in case I am selected by the code4bill; and if I am not,
I shall be joining University of Texas at Austin which
has kindly offered me full financial aid to pursue higher
studies.
SMARTWAY : Integrated Travel
Routing and Itinerary
Commuting in cities with multiple modes of
transportations viz. buses, trains etc, you have to take
lots of decisions at any time regarding whether to
travel by bus or by Metro, which route to take to reach
at the earliest, which route to take to incur least
monetary expense etc. My project’s goal is to cater to
all such traveling needs. It would provide you a
complete integrated itinerary advising on which
transport to take, from where, to where, at what time
and how much you need to spend. Not just this, it would
accommodate all your personal demands like today you may
want to stay longer at a stop-over to meet your
relative, you may want to travel the cheapest way as you
spend wisely, you may be fine with longer traveling
hours but certainly despise long waiting hours and so
on. Want still greater fun? You would browse your
itinerary on cool Virtual Earth Maps with detailed
directions about roads, intersections and left/right
turns etc. A seamless interface with online ticketing
and reservation information would be at your service to
clinch your travel arrangements. So gear up for smart
commuting! |
|
|
 |
 |
|
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
|
|
 |
 |
 |
 |
 |
 |
 |
| 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? |
|
|
 |
|
 |
|
 |
|
 |
 |
| |
|
|
 |
|
|