Click here for SCHEDULE
Results for CodOlympics Elimination rounds out.

presents

Event - CodOlympics

Do you have what it takes to be crowned the ultimate Code-Champion?
Would you like to test your skills in all spheres, right from programming to scripting and networking?
If yes, go ahead and prove yourself in this one-of-a-kind ‘CodOlympics’.

Prizes worth Rs 15000 up for grabs for this event. Make the most of this opportunity and register now!

Format
Preliminary Round

The following teams have been selected from the first elimination round:
1. COD-11635
2. COD-12301
3. COD-16608
4. COD-11104
5. COD-11166
6. COD-11823
7. COD-11525
8. COD-11750
9. COD-11791
10.COD-11394
11.COD-11427
12.COD-11895
13.COD-30529
14.COD-30414
15.codemaniacs
16.SPAM
17.patronus

Congratulations to all the winning teams! These are automatically selected for the finals which are to be held during Quark-'08.

Click here to view the discussion on forum.

On-Campus Rounds

• First Round
• Final Round

DAY 1: FIRST ROUND
The first round would consist of the following tasks:

• Geek Notes: Make a C-program for the given problem.
• Bugged!: A solution for a problem would be given, but it will have bugs (syntactical and logical errors). The aim is to get the code to work.
• Tux-o-mania: This task involves scripting and solving certain scenarios on Linux platform.
• Get SYNC'ed!: It involves problems that would confront a network professional in real life.
• Cryptic C: Teams would have to rewrite a 'cryptic' C code without using any pointers.

Shoot-Out: This would be a gaming round, to be held after the first round. Points scored here would add to the teams' first round scores.

Rules for Round 1:

• Teams Can attempt only one task at a time.
• Teams are allowed to choose the task they want to start with.
• A Team can start another task under the following scenarios.
• It completes a task and then decides which task it wants to attempt next.
• It leaves a task in the middle and decides to switch to another one.
• Completing each task would give the team points allotted to that task.
• Teams can come back to a task only once.
• Only half of the points will be awarded for a task if a team comes back to it after leaving it and then completes it.
• Each team is given a 'Joker', which it can use to double the points for a chosen task (before reading the problem statement for that task).
• The teams scoring maximum points at the end of the allotted time will make it to the final round.
• No. of teams qualifying for Final Round: 3-4

DAY 2: FINAL ROUND
The final round would consist of the following tasks:

• REALgo : Develop algorithms to solve real life problems and implement them in C.
• Get SYNC'ed! v 2.0: Take your networking skills to the next level.
• Cryptic C v. 2.0: Promises to be bigger and messier than v 1.0.
• Gobble the Docs: Skim through documentation provided and choose the relevant system calls to solve the given problem in C.

*The Big Bet: Each team can challenge any other to complete a particular task.

Rules for Final Round

• Teams will be given all the problem statements at the beginning of the round.
• They can attempt more than one task at a time.
• The team scoring maximum points at the end of the allotted time wins.
• In case of a tie, there would be a rapid-fire quizzing round on the category of their choice.

General Rules

• A team can consist of a maximum of 4 members.
• Team members can be from different colleges.
• Timings are subject to change without prior notice.
• Final decision rests in the hands of the moderators.

Eligibility

All students with a valid identity card of their respective educational institutes are eligible to participate in the event.

Special Note

• The decision of the judges shall be treated as final and binding on all.
• The organizers reserve the rights to change any or all of the above rules as they deem fit. Change in rules, if any will be highlighted on the website and notified to the registered participants.

Event Managers

For Queries: [email protected]