Skip to content

Tuesday, December 22nd, 2009

Sagar’s Code4Bill Experience

January 25, 2006 by Jason Bean  
Filed under Computers

Here’s some more information on Sagar’s experience with the first round of the Code4Bill competition taking place in India.

sir,

thanks alot for all the above. regrding the questions, if any code4bill applicant is reading this blog kindly post the problems/confusions faced during those 6hours of the test each day. the problems that i faced during the 1st day was the first question which was of 16ladders and 2nd day the problem i faced was in the 1st 2 questions and those were 27mins-arrival and 6guys-12stations one. any IITian or kinda genious if has the answer/logic to that problem kindly do post here.
eagerly waiting for the answer/logic.

for me code4bill round1 day1 was easy as compared to the round1 day2 as i could attempt all 8/8 in 4hr40mins but it took me 1mins more the next day and could attempt only 7/8.

yeah, abt me. me 3rd year comp sc and engg student from delhi,india. and i think there should be around 4lakh applicants for the test(who attempted it seriously) as my calculations say.

thanks
sagar

We’ll say it again, anyone else with experience, chime in and let us know!

  • StumbleUpon
  • Digg
  • Facebook
  • Mixx
  • Google
  • TwitThis
  • Reddit
  • Yahoo! Buzz
  • Slashdot
  • E-mail this story to a friend!
  • BallHype
  • YardBarker

Comments

5 Responses to “Sagar’s Code4Bill Experience”
  1. sagar gupta says:

    Nobody????
    Anyways Happy 57th Republic Day India!!

    sagar

  2. sagar gupta says:

    just sat for the code4bill round2 day1. the questions were more than tough to handle. there were total 4 questions. time allotted 3hrs. did all 4 in 2hr59min. but not sure in even one of them. lets see what happens tomorrow.

    sagar :-(

  3. Abhijit says:

    the ladder problem can be solved by simple recursion.

    if you say that f(n) is number of ways a guy can climb a flight of n steps then for a person to complete nth step.. he can either take one or two steps at the first instance.. which means that
    f(n) = f(n-1)+f(n-2)

    with f(1) = 1 and f(2) = 2 you can very quickly reeach 16

    the problem of stations can be easily done by a generating function .. the restaurant was a P and C problem by taking cases.

  4. Jason says:

    And that my friends is why I’m blogging about it and not actually doing it! Greek or rocket science anyone?

  5. rohan says:

    well, i have progressed to stage II. what my question is how many students would have progressed to the stage II? and how will the interview process be? any ideas???

Speak Your Mind

Tell us what you're thinking...
and oh, if you want a pic to show with your comment, go get a gravatar!


About Us | Advertise with us | Blog for EveryJoe | Privacy Policy | Terms of Use
Get This Theme | Sitemap


All content is Copyright © 2005-2009 b5media. All rights reserved.