Join us at Engineer 2011 for a marathon as we ask you to solve multiple tasks of varying difficulty covering all fields of computer science from basic programming, scripting, to operating systems and networks. This Engineer, we bring in change... after all, Computer Science is the fastest growing and the fastest changing area of Engineering.

Spread over all of Engineer, we give you the opportunity to make up for one bad day, as well as test how long you can endure solving the trickiest (and most often the simplest) comp-sci problems we can throw at you!

On-spot registrations are open but please register on the website for convenience

Exciting prizes sponsored by IBM
First place - Laptop
Second place - MP3 Player
Third place - Hard Disk

Marathon is a team event, each team consisting of 3-4 participants.

Marathon basically includes 3 rounds.

• The first round is a pen-and-paper round with logical aptitude and technical questions. Teams will be eliminated based on the first round.
• The second round is a traditional black-box round that expects the participants to come up with the logic of the code being executed depending on the output received. This round involves filtering as well.
• The last round involves a number of hands-on tasks that the teams are expected to carry out in a face-off format against another team as their opponent. Each team will get to face a different opponent for every task. The technical tasks span various fields of computer science.
• ELIGIBILITY CRITERIA: None

• First round, being an elimination round, is based on the correctness of the answer written by the teams.
• Second round is judged on the basis of how well the algorithm implements through a series of test cases.
• Third round tasks are judged on the basis of correctness of the end result. Partial marks are awarded to teams who manage to fulfill the task's expectations partially.

The problem statements for all the tasks are provided on-spot.

Preeti U Murthy - (+91) 9481487824

Mail your queries to compevents@engineer.org.in