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

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

Hi there It's me with my lecture questions again. I tried rewatching the lectures and going to a lab facilitator to ask but they were confused too so I have a few questions this time 1. In the Ford-Fulkerson problem slide (slide 18) is it the case t...

As written in the project under Instructions "You may use the Python standard library. DOMjudge has been configured only to use the standard library, so if your solution runs on DOMjudge, then it is acceptable."

Forgot to mention, any white space in the middle that isn't (0,0) or the last row.

You flip the white space then it'll become a big black space with the other 3 black space. Then flip the big black space and it'll all become white

Hello again For the lecture today I struggled quite a bit to understand so I watched some youtube videos online to explain and I wanted to ask if the formula for w (u v) can be written as in the image below instead of in the lecture? Also is Johns...

Hi there I have a question that if we used code for popular algorithms (e.g. Binary Search) can we use code found online from websites such as geeksforgeeks.org as long as we reference it ? Thanks

Hi all I wanted to ask if there is any hints or ideas on how to do this question, I've come up with a DP solution to this but the time complexity for it is O(N 2) so it fails the time check. Is there a faster way for this? Thanks

and also if anyone can explain the need for "if dist u is not None " but BFS doesn't need it in Dijkstra's, I've rewatched that section explanation a few times but couldn't really understand why.

Hi there I just watched Lecture 14 and had a question. Would it be correct to say that all shortest path trees are spanning tree but not the other way around? Thanks

Hi Gozz, thank your clarification. Below I'd like to try my hand at the open-ended questions you have provided. 1. Do you believe heap sort is a distribution sort? What is your argument to support your position? Can you formulate a counterargument? - F...

Hi I just had a discussion with a friend over Quicksort algorithm and we were confused as to which sort type quicksort is. In the lecture Gozz mentioned it was Distribution sort however when searching online it mentions it is comparison sort. The pa...

Hi, I just tried to watch the lecture recording for today (22 7) lecture and it seems that there isn't any audio after the initial "Then let me know if you have any questions". Just wanted to know if there are any alternative and if others are having...