Round 1: Preliminary Round

• Round 1 will be a quiz which will include puzzles, aptitude and questions on algorithms, data structures.
• Duration will be one hour.
• This is an eliminative round. Few teams will qualify for the finals.

Round 2: Final Round

One large problem which requires efficient use of data structures and algorithms will be given.

It will be divided into sections to enable gains on partial marks.

The teams are free to choose how they split their work.

Total duration – 3 hours

• Coding Phase: In this phase, the team members split and start working on their respective classes in individual systems. It will be necessary to make calls to functions of other classes that a member is currently not working on. Hence, the planning phase is crucial. Each team member will work on different sections of the problem independently. After a period of 30 minutes, the team members shuffle in a circular fashion and continue to code where their team mate left off. This happens three times. (30+30+30 = 1.5 hrs for this phase).
• Integration Phase: The teams are to integrate their code on one system and debug their classes. The teams can test their codes with the sample inputs. The time limit for this phase is one hour thirty minutes.

Rules:

• Every team must have three members.
• Use of third party libraries will not fetch any points.
• The team which completes first will be the winner.
• Decision of judges will be final.
• The team members are not allowed to communicate during the first phase of the final round. They can only pass vital information (like explaining their algorithm) in the comments of the code. Any team found communicating will be disqualified.
• The use of mobile phones or any other electronic devices during the prelims or the finals will lead to immediate disqualification.

Judging Criteria:

Round 1:

• Score in prelims.

Round 2:

• Hackerrank’s OJ will be used for evaluation.
• The test cases of the problem statement can be changed dynamically in order to test the efficiency of solutions in case the leaderboard is cluttered.
• In case of any ties, more efficient solutions and further more readable solutions will be given preference. Appropriate language linting programs will be used to gauge readability.

Problem statement will be disclosed once the event starts.

F.A.Q.

Q) Are we allowed to access the web during the finals?

A) No. Teams are not allowed to access the web. However, if the organisers feel the need, they can make available e-books like CLRS (for DS & Algo).

Q) Can there be less than three members in a team?

A) No. It is compulsory to have three members in a team. In case one of the team members is not available during prelims, the rule may be relaxed. However upon qualification into finals, any team failing to show up in full strength will be disqualified.

Q) Will the test cases be made available during the contest as part of being questioned on its validity?

A) No. The test cases are designed such that they eliminate the inefficient solutions. The cases have been thoroughly tested on the most efficient algorithms on multiple platforms. Queries regarding the validity or authenticity of the questions or the pertaining test cases will not be entertained.

Contacts:

1.Sanjeeda : +91 87891 87123

2.Mandeep : +91 99944 79069

3. Vignesh  : +91 75501 98927