Kruskal's algorithm has complexity of O(ElogV) but in class we learnt an implementation using lists where it comes out to O((E V)logV). What would we be expected to use when discussing complexities in the exam?

Anyone know if it's worth memorizing python codes for data structures since the practice exams asked previous students to write code in Java. I know the lecturer said not to memorize pseudocode, did the same apply to this?

Sorry, when you say it's overall O(N logN) are you referring to a merge sort or a merge within a merge sort? The question I'm trying to figure out is Explain the merge step of the mergesort algorithm. What is the overall complexity of merging in the ...

THANK YOU

Hi there, I was wondering if merge takes O(n) or O(nlogn) time as I've seen several different answers. Which is correct? Does merge work differently within a merge-sort leading to there being two values for complexity?

This is part of a question given in the practice exams. What type of answer would be expected? (I know we can't be given the answers, I mean the format structure) Are we supposed to be giving a formula; similar to how the lecture 8? How much would we ...

Having some trouble wrapping my head around this concept. Is there an equation that fits all solutions when we are looking for this type of analysis? Or do we have to derive one? Also, regarding Q1 of the second mid sem test, the question about amorti...

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

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

I've been able to make a method to find the min time to get from 0 to 1 in the first test for security routing which will obtain a value of 0. However, I'm unsure on how to implement checking for clearances or switching the clearance when running thr...

Just had a look over lab four and it seems to cover implementing something like a tree diagram but in python form. Are the lectures still behind on the content for this lab even though its assessed?

It just says its due on Friday of this week, what time should we presume to this to be? Should we be assuming it's sometime in the night or afternoon considering we have a test the previous day?

Hi, I just saw the email regarding the test next week and was wondering what can we do to prepare? Are there practice tests or material for us to use? Additionally, the email reads "The test will include materials covered until this week's (week sta...

Hi there, Just double checking, are there no labs on during week 2? I believe the lecturer last week briefly mentioned this since not much content in week 1, but I'm asking here just to be sure I don't miss out on any content.