ANONYMOUS wrote Yes, you will get full marks if I can understand that you have understood.

ANONYMOUS wrote You should explain exactly how much is required to make it understandable.

ANONYMOUS wrote You should analyse the time complexities of all parts of an algorithm. The analysis of non-dominant parts will cost you (may be) two more sentences and half a minute of writing.

ANONYMOUS wrote K is a variable here, not a constant, so we can't do what you have written. K is a constant only for a specific instance. Suppose you have to find n smallest elements? It will be an O(n) algorithm according to your logic. That will br...

ANONYMOUS wrote Python code of what? There is no question that requires writing code.

ANONYMOUS wrote I only expect you to know the complexity that has been discussed in the lectures.

Thank you, I would love to see meaningful diagrams for explanations.

ANONYMOUS wrote Could not understand your question.

ANONYMOUS wrote The number of edges m is O(n 2) in the worst case. log(m) log(n 2) 2log n

ANONYMOUS wrote I have mentioned this several times that clear explanation in English is sufficient. You should be able to judge (when you are doing a second year unit) whether you are explaining clearly. Can you convince yourself? If yes, that is a ...

ANONYMOUS wrote Please see the lecture tutorial where I had worked out several such examples.

ANONYMOUS wrote Yes, please listen to the lectures even if you did not attend.

No, we did not do any such complicated thing. I have explained the complexity in a very simple way. When we do the union operation, we double at least one of the sets by the union. Since it is true in every step, we need O(log n) steps. Please listen...

ANONYMOUS wrote You can do better without directly running Dijkstra's algorithm, by using set operations.

ANONYMOUS wrote Also, the only permitted material is a UWA approved calculator.

ANONYMOUS wrote I will not provide sample answers. I have discussed in the last lecture Tutorial the types of answers I expect. Please listen to that recording. You can also come and discuss with me anytime Tues-Thursday (please send me mail), or ask...

ANONYMOUS wrote This is Dijkstra's algorithm that has a time complexity of O((V E)log V) as covered in the lectures. Here N is V E.

ANONYMOUS wrote Only materials from week 1-4

ANONYMOUS wrote Please submit answers.md and the python file, zipped together

There are also marks for answering the questions. There is no mark for speed, and quality is hardly an issue for such a small program.

ANONYMOUS wrote yes, that seems to be correct. Please ask the lab facilitator. This forum is not an alternative to attending labs.

Yes, you can write your own functions.

ANONYMOUS wrote I do not reply to every question. I wait for others to answer, and also there are labs and lab facilitators for answering lab related questions. You should attend labs and ask questions.

ANONYMOUS wrote Actual runtime is not tested in this unit. And runtimes vary depending on the language and machine.

ANONYMOUS wrote We are not checking for speed.

ANONYMOUS wrote 11 59 pm, that means one minute before midnight.

ANONYMOUS wrote I also said on a particular machine this was the case.

Here is a clarification for Lab2 testing The spec does not consider the possibility of calling get rank time() for a rank that does not currently exist on the leaderboard. Since it specifies to return the maximum time that would be necessary to ac...

I will check and correct this.

ANONYMOUS wrote The labs started in week 3.

ANONYMOUS wrote You can access everything from the LMS page, except for this help forum. There is a link to help2200 from the LMS page.

ANONYMOUS wrote All materials covered in this unit are from lecture slides and lab sheets. You will get two weeks to complete each lab, and the three assessed labs are broken down in smaller parts. One of the main aims of this unit is to build confid...

ANONYMOUS wrote in-class tests will be multiple choice and closed book. No materials will be allowed.