COMP3600/6466 – Algorithms Important Information
Hanna Kurniawati
https://cs.anu.edu.au/courses/comp3600/ Comp_3600_6466@anu.edu.au
A1 Marks
• Most probably there will be slight delay. Rather than tonight, we will likely release them tomorrow afternoon, via emails to your ANU email
• Reason for delay: Misconduct!!!
• Given the number of answers that are very similar to the answers from the tutoring website (even though some of the answers from that website is wrong), we need to do additional checks
• If we suspect that you did perform academic misconduct, you will receive an email regarding this and we will withhold your A1 mark while the misconduct is being processed
A2 out last night
• Due: 21 Sep 23:59
• Grace Period Ends: 22 Sep 13:00
• Late Penalty: 100%
• Worth: 20% of total marks
• Programming-related questions: 20/100 pts
• The lecture materials up to last week is sufficient to
answer the questions in A2
• If you are not familiar with C/C++, this week tutorial covers sufficient C/C++ materials needed for your assignment
• Cheating/outsourcing assignment will not be tolerated!!!
Programming for A2
• We will compile and run from command prompt in Linux
• We will release template + test cases in the
class website on 28 August 2020 (this Friday)
• Please use them to ensure you program uses the right input/output format
• Don’t use the test cases to extrapolate specifications. Specifications are as per problem set. And we will test your program on different test cases
A2 Submission & Marking
• Please save as draft in wattle if you still want to be able to reupload. We will automatically take the last saved draft you have in wattle as your submission
• A2 XOR A3 is redeemable by Final Project
Total Score = max(0.15*A1 + 0.2*max(A2, FinalProject) + 0.25*A3 + 0.4*FinalProject , 0.15*A1 + 0.2*A2 + 0.25*max(A3, FinalProject) + 0.4*FinalProject)
Final Project, Milestone-1
• Project description & M1 description out: 17 Aug • Please read them!!!
• Due: 7 Sep 23:59
• Grace Period Ends: 8 Sep 13:00
• Final project is worth 40%
• M1 of the final project contributes 10pt to the total mark of
the final project
• Please save as draft in wattle if you still want to be able to reupload. We will automatically take the last saved draft you have in wattle as your submission
Final Project Difficulty
• A working software using at least 3 functionalities with the following requirements • At least two must be from the following topics:
B4. Heaps
B5. AVL Tree
B6. Red-black tree
B7. Hashing
B8. Dynamic Programming
B9. Minimum Spanning Tree (MST) + Dijkstra B10. Convex hull + closest pair of points
Final Project Difficulty
• At least one must be from the following topics: B7. Hashing
B8. Dynamic Programming
B9. Minimum Spanning Tree (MST) + Dijkstra B10. Convex hull + closest pair of points
• Yes, you might not know them at the moment,
therefore you can:
• Change 2 functionalities by 2nd milestone
• Lock functionalities up to B7 by 5 Oct (when the class
has covered up to B8)
• Change 1 functionality in final deliverable
Final Project Marking
• This is an algorithm class. Therefore, what we will mark in the final project is your understanding of the algorithms (when & where should it be used, what are the limits), correctness (including implementation correctness), analysis of the algorithms (theoretical and empirical)
• Details of the marking criteria is in p.1 of the final project description