Will follow through marks be given in the exam? E.g. lets say there were two questions relating to a problem which were 'propose a more efficient algorithm to solve this problem' and 'what is the time complexity of this algortihm', each worth 2 marks....

Hello, I was wondering if there were any practice questions to help revise weeks 8-11 content other than the practice exam that has been provided on LMS? Could you give recommendations for any questions, that are relevant to the exam, in CLRS?

ANONYMOUS wrote Reachability is transitive. s is able to reach d via c. The core point is that the s side of the cut will be exactly those vertices that are reachable from s through the residual graph . That is, the vertices to which s could push fl...

Hi, I have a question regarding the Lecture 16, on the video recording in LMS, timestamp 1 23 11 It was said that the cut on the saturated graph shown as the example would be S,A,C,D and B,T And it was said that the Source Vertex could reach A C D ho...

ANONYMOUS wrote Nope As stated in the lecutre, Special Topics is used for supplementary content that is not part of the core material of the unit and is not assessed therefore. Hence the more workshop-style format, just having a chat about some inte...

ANONYMOUS wrote I aim to have them to you before the exam, yes, but please note that (unless we have to cut any of your answers due to being cited plagiarism or something), you should already know your score It's the number of points you have on DOM...

Will we be getting our project marks before the exam? (i know we only just released it - not expecting it soon)

Hi Just wanted to confirm that the last lecture content will not be assessed in the exam?

ANONYMOUS wrote This comes from that we can define a set of k subarrays as a set of pairs of start and end indices (l1, r1), (l2, r2), ..., (lk, rk) . Each index in this representation has O(N) options, and there are 2k of them, so that give...

ANONYMOUS wrote I am not going to make an official statement on whether any part of the unit content is in the final exam or not. Officially, anything that was covered in the unit material (including lectures and labs) may be assessed unless explicit...

Hi there I have a few questions after watching the lecture today. Question 9, how is the time complexity for the brute force O(n (2k)) does it come from us having a total of n 2 total combinations and choosing subarrays is Subarray k ? Also, I didn'...

ANONYMOUS wrote As stated under StudentConnect "Any printed or written material (e.g. dictionaries, textbooks, statutes, cases, legislation, annotations, lecture notes, tutorials with solutions, notes) except UWA Library books. Photocopied or printed...

Meant to include universal turing machines and nondeterministic turing machines in that question as well

Hello, I understand that is useful to understand the concept of deterministic turing machines, but am I correct in recalling that we will not be directly assessed on this topic in the exam? Just wondering from a "notes to bring to the exam" perspectiv...

I noticed that the sample test states that we can bring written printed material. Could you confirm if this will be allowed for the final exam?

I noticed that the sample test states that we can bring written printed material. Could you confirm if this will be allowed for the final exam?

ANONYMOUS wrote Hi, We would like to be able to release the answers but unfortunately we can't. There are people with extensions who are still working on the project. Thanks.

Hi, I was wondering if the answers for the project will be released at some point before the exams? There are a couple of questions I spent a long time working on and had a solution that appeared to be right for the provided test cases and all cases I...

Apologies. I was held up after class (CITS3011 Tutorial) and did not get back to my office until a bit before 14 20. There is no need to email ahead of time. As stated elsewhere, my consultation hours are 14 00 to 16 00. If I an unavoidably delayed on ...

This issue should be resolved now. It appears to have just been high demand as we are close to the end of the project. Likely exacerbated by several people resubmitting repeatedly rather than waiting for their turn in the queue to clear.