About the competition:
The Convention on the Rights of the Child (CRC), the first international convention on child rights was signed in 1989 and has led to great progress in safeguarding human rights of the children.
It has resulted in major changes in laws to ensure better protection for children and has even altered the manner in which international organizations see their work for children. The convention has also resulted in better protection of children in situations of armed conflict.
To mark the 30th year of CRC, NALSAR’s Centre for Child and Youth Justice, in collaboration with UNICEF, is organizing this competition to encourage students to deliberate on the intersection of International Humanitarian Law and Child Rights.
The format of the competition:
An Assessment Round will be conducted to test the team’s knowledge and prior experience in child rights and International Humanitarian Law.
Interested teams are required to answer 2 basic International Humanitarian Law and Child Rights questions and send it to the organizers along with one motivation letter per team.
Based on this, 15 teams, comprising of either 2 or 3 members each, will be selected for the oral rounds at NALSAR University of Law, Hyderabad.
The teams will be required to analyze a fictional conflict (main problem) given to them upon qualifying for the Oral Rounds. The teams are required to identify primary legal and other issues from the given fictional conflict.
During the rounds, each team will be given time to first put forth their stance on the legal issues at play, and how the parties figure into them.
This will involve putting forth arguments, outlining how other parties have violated the International Humanitarian law and Child Rights.
Participation and Eligibility:
Students of any University offering any legal undergraduate, graduate or postgraduate Degree Course are eligible to participate in this competition.
A Team may consist of members from more than one Institution. There is no cap on the number of teams that can participate from one Institution.
Each team shall comprise of a minimum of two members and a maximum of three members. In any given round only two members will act as oralists while the third member acts as an observer.
Substitutions amongst Team Members are allowed after the end of each oral round.
There is no registration fee to participate in the Assessment Round.
After the Assessment Round, the qualifying teams must register by paying a registration fee of Rs. 9000/-. This fee is inclusive of stationary, food and 2 nights stay (April 12 & 13).
Participants wishing to stay beyond the abovementioned dates will have to register for the same and pay a nominal charge of Rs. 800/- per person per day.
1. Submission of Assessment Round Applications: March 8, 2019, 11:59 PM.
2. Declaration of Selected Teams and Waitlisted Teams for the Oral Rounds and Release of the Competition Problem: March 10, 2019.
3. The final date of Registration for Oral Rounds: March 17, 2019.
4. Oral Rounds: April 13 & 14, 2019.
- Winning Team Award: The winning team will receive a trophy, medals and a cash prize worth Rs. 25,000/-
- First Runners up Team Award: The First Runners up team will receive a trophy, medals and a cash prize of Rs. 15,000/-
- Second Runners Up Team Award: The Second Runners Up team will receive a trophy, medals and a cash prize of Rs. 10,000/-
- Best Oralist in finals shall receive a trophy and a cash prize of Rs. 7,500/-
- Best Oralist prelims shall receive a trophy and a cash prize of Rs. 7,500/-
- Every Participant selected for the Oral Rounds shall receive an Online Course by Enhelion Knowledge worth at least Rs. 2500/-
1. Harsh Mahaseth – Head – Core Team: +91 9502321237
2. P Avinash Reddy – Member – Core Team: +91 9032224907
3. Ayushi Bansal – Member – Core Team: +91 9166386242
4. E-mail ID: firstname.lastname@example.org.
All the details are here.
Assessment Questions are here.
Competition Rules are here.
Disclaimer: We try to ensure that the information we post on Lawctopus is accurate. However, despite our best efforts, some of the content may contain errors. You can trust us, but please conduct your own checks too.