Contests
General
All contests will be conducted on DOMjudge.
- Please register here using your zID as both the username and team name, and providing your full (preferred) name.
- Use a password different from your zpass. Please contact me by email or clarification request if you would like to reset your password.
Please read the DOMjudge team manual for more information on the DOMjudge system. There are also some relevant notes on the tips page of the course website.
Please keep in mind that these contests are to be attempted individually, with no collaboration.
- Do not share or discuss these problems with anyone until all students have completed the contest.
- All submissions will be compared pairwise with plagiarism detection software, and serious penalties will be applied, particularly in the case of repeat offences.
- Do not copy ideas or code from others, and do not use a publicly accessible repository or allow anyone to see your code.
- You are not permitted to use code-synthesis tools such as GitHub Copilot.
All problems are intended to be completed using only the materials on this course website. You may also find the C++ documentation at cplusplus.com and cppreference.com to be useful during contests.
Any questions during the contest should be submitted as a clarification request in DOMjudge, instead of posting to Ed or any other platform. Should you have difficulty logging in to DOMjudge, please contact me by email.
It is unfortunately difficult to schedule these assessments without clashes with your other classes, and without taking up too much of our already limited class time. I understand that evenings and weekends are not ideal for everyone, so if you are not able to participate during the scheduled times, please contact me and I will be happy to make alternative arrangements for you.
Contest 1
Contest 1 will take place from 00:00 03:00 on Saturday 9th 16th September to 00:00 03:00 on Monday 11th 18th September.
You can access the contest on DOMjudge.
You can participate for the entire 48 hour duration of the contest.
There are five problems, each worth 100 points. The problems are sorted in approximate order of difficulty.
Contest 2
Contest 2 will take place on Sunday 15th October.
You can access the contest on DOMjudge.
The contest duration is three hours. Book a timeslot using this form. Please submit it promptly as I have to assign students to timeslots manually. As above, please contact me ASAP if you would like an alternative time.
There will be three problems on the topics of:
- Getting Started,
- Problem Solving Paradigms,
- Data Structures I and
- Dynamic Programming.
Each problem will have a subtask worth 50 points, and a full version worth a further 50 points. If you solve the full problem, you must submit for both the subtask and the full problem to get all 100 points.
The problems are sorted in approximate order of difficulty of the full problem. The order of difficulty of the subtasks is not guaranteed.
Contest 3
Contest 3 will take place on Sunday 19th and Monday 20th November.
You can access the contest on DOMjudge.
The contest duration is three hours. Book a timeslot using this form. Please submit it promptly as I have to assign students to timeslots manually. As above, please contact me ASAP if you would like an alternative time.
There will be three problems on the topics of:
- Graph Algorithms,
- Shortest Paths,
- Data Structures II and
- Network Flow.
Each problem will have a subtask worth 50 points, and a full version worth a further 50 points. If you solve the full problem, you must submit for both the subtask and the full problem to get all 100 points.
The problems are sorted in approximate order of difficulty of the full problem. The order of difficulty of the subtasks is not guaranteed.
When all students have completed the contest, an editorial will be published and a practice contest will be made available to all students.
Final Exam
The final exam will be held on Thursday 7th December, from 11am to 4pm at CSE labs (J17 level 3 in Brass, Sitar and Kora labs). If you are unable to attend in person, please complete this form to arrange an alternative mode to sit the exam.
There will be seven problems, and all topics except Computational Geometry are examinable. All or almost all problems will have one or more subtasks as well as the full version, together worth a total of 100 points. If you solve the full problem, you must submit for all subtasks and the full problem to get all 100 points.
The problems are sorted in approximate order of difficulty of the full problem. The order of difficulty of the subtasks is not guaranteed.
This exam is covered by UNSW’s Fit-to-Sit policy. That means that by sitting this exam, you are declaring yourself well enough to do so. You will be unable to apply for special consideration after the exam for circumstances affecting you before it began. If you have questions, or you feel unable to complete the exam, contact Raveen.