Regarding structing how answer, since no marking key was given for the practice exams, is it fair to assume that the ability to explain the data structures well would grant you the full 5 marks? Or should we be giving examples too, to achieve the full...

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

Hello, I have watched the lectures and still do not understand why Kruskal's is (m n)log n. Please clarify how the complexity arises. If there are m edges in the priority queue with m-weights, total cost of priority queue operations should be m log(m)....

Nvm, I was acutually thinking about Dijkstra s Algorithm not Kruskal s, been struggling getting to nlogn. The best achievable complexity with my given approach is ( ( ) log ), which is close but not strictly ( ...

I would also like to know what the first student asked Hey, looking back on lecture material, for kruskals algorithm the complexity is O((n m)log(n)), where n vertices and m edges. It states that all the MST union operations result in complexity...

Hi, I'm currently having trouble getting security routing working and was wondering that if I wasn't able to get this done before the deadline but was able to write down answers to the questions regarding correctness and complexity on my code would I...

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...

I also have a question which links onto this one, if we are explaining the time complexity of Kruskal's, do we talk about the inverse Ackermann function?

Hey, looking back on lecture material, for kruskals algorithm the complexity is O((n m)log(n)), where n vertices and m edges. It states that all the MST union operations result in complexity of nlog(n), but I can't find where this is explained, a...

watch the last lecture, he has already said multiple times that we ignore anything that mentions Java, the unit has updated so that starting from this sem, it is all in python. Please watch the lecture before asking on here to prevent asking redundan...

I have seen that in the practice exams, when we are required to write a piece of code we have to write it in Java, is this also the case for our exam? if so, then why? java hasn't been taught in this unit and the Java courses are not a prerequisite. ...

Hello, Q3 (b) of 2019 exam asks to show n(log(n)) 2 O(n 2). I do not know how to derive an upper-bound of n for the (log(n)) 2 term. Please explain how I might derive this mathematically. Thank you

Hello, I am wondering when answering questions like these from the past exams "Explain clearly Kruskal s minimum spanning tree algorithm." 5 marks or "Explain clearly the inorder and postorder traversals of binary trees" 5 marks What are each of ...

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

Wouldn't dijkstra's algorithm need to be done for each iteration of planes though? So it would be (number of planes) ((V E)logV)?

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