As the above student points out Do not publish content from the exam where students who are yet to sit the exam may be able to see it. This semester I do not remember if there were any students sitting the main exam at a later time, but if there are...

ANONYMOUS wrote Please try to ask questions like this sooner in future. It is 81 work minutes before the exam and I am technically meant to be on urgent leave, so you are lucky I decided to do one last check in case there was something serious. I will...

ANONYMOUS wrote A bitset is an implementation detail to represent sets efficiently in memory. I cannot make an explicit statement about the content of the exam, and so cannot tell you whether you will need to be familiar with this, but I believe from...

ANONYMOUS wrote Technically this depends on what the questions ask for, but you will notice that all the questions in the sample exam ask for a "justification". This is not asking for a formal proof, just an argument to convince the reader that your ...

Wrong unit. I think you are looking for CITS3011.

We expect the DOMjudge server will stay up over summer, as it will be a useful resource for students with deferred exams, but I am not able to guarantee it in general.

ANONYMOUS wrote I took some time last night to throw together an editorial and have just got it done up enough for release. Please see the announcement or the Project page on LMS.

ANONYMOUS wrote In certain cases this depends on context, but in general if you are using a named algorithm we covered in lectures for a purpose we investigated in lectures, then you can assume the marker is familiar with it. This is the same sort of...

ANONYMOUS wrote I am sorry, but I am not going to make an official statement giving any guarantee about that. The official directions for any test is to answer the questions to the best of your ability. Having said that, you can probably figure out so...

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

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

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

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.

This is explicitly addressed in the project instructions. Please make sure you have read the project instructions.

ANONYMOUS wrote Hi, Unfortunately, given this unit has never been run before, I have yet to have time to write a second exam to provide as a sample exam. This is currently my second highest priority, however, as I hope to cover it in lectures next wee...

By chance, the top video from the latest Summer of Maths Exposition (https some.3b1b.co) announced today is about P vs NP What P vs NP is actually about (https youtu.be 6OPsH8PK7xM) It's a seemingly well-presented (if informal) dive into how an...

8-connected is the standard term for referring to the 8 pixels that share an edge or corner with a given pixel https en.wikipedia.org wiki Pixel connectivity 8-connected

ANONYMOUS wrote cssubmit permits multiple submissions. We will only mark the final submission. Students will not be punished for cssubmit being down. If necessary an alternative will be made available.

ANONYMOUS wrote This has been addressed in the project specification and FAQs. Your submission is marked only on your ability to solve the problems. Code style does not contribute to marks. Having said that, I will encourage you to take the few minute...

ANONYMOUS wrote Apologies for the inconvenience. I have been extremely busy and short on time and the lectures were made available as soon as they were ready for upload. Gozz

ANONYMOUS wrote This is the worst case scenario. Note that Ford-Fulkerson just uses a DFS and provides no guarantees about how it will select a path, so we must consider the worst case. Finding strategies (such as taking the shortest available path) ...

ANONYMOUS wrote As you have identified, the specification says "8-connected region". 8-connected is the standard term for referring to the 8 pixels surrounding a given pixel, and so does include diagonals. See (https en.wikipedia.org wiki Pixel con...

ANONYMOUS wrote Reasonable input times are accounted for in the runtime limits, and should rarely if ever be the dominating factor. The time limits and bounds are set so as to distinguish algorithms with acceptable time complexities from those that a...

The previous student is correct. As has been mentioned before in various places, Python normally gives a Run-Error when hitting the memory limit. No, no students will be provided with additional test cases. Exploring test cases and finding bugs yourse...

Hi, Exploring the properties of the problem space to find, understand, and fix your bugs is an intended part of the task. A good practice is to explore small, simple solutions and try to find the simplest input for which your algorithm is incorrect, so...

The other student who has replied is correct. It seems you misunderstood the problem statement and need to read it again more closely.

The inputs are guaranteed to follow the specification. Cheers, Gozz

ANONYMOUS wrote Hi, I am hoping to get them done as soon as possible, but there have been some unavoidable delays (running two new units requires writing a lot of new material to very specific deadlines... UCs have to have exam papers submitted in wee...

ANONYMOUS wrote if dist u is not None is checking whether the vertex has been marked as visited. An unvisited vertex will have a distance of None , while a visited vertex will have some numeric distance. This is explicitly discussed both in lectur...

ANONYMOUS wrote The defining property of a spanning tree is that it is a tree that contains all vertices in the graph. The defining property of a shortest path tree is that every path starting from the root of the tree is a shortest path in the graph ...

I encourage you to have a think about this question, which may help you figure out understand the solution If we somehow knew the set of potions and swords we would be using, does the order you use them matter?

ANONYMOUS wrote There was no lecture this week due to the Mid-Semester test, as noted on LMS. Lecture 13 will be next week.

I would encourage you to make sure you are comfortable with the other techniques. In particular, try implementing it with a stack manually, as all the recursive solution is doing is a trick to use the call stack rather than having to make your own. I...

Yes, Python has a recursion depth limit that defaults to 1000 in the most common implementation (CPython). This can be adjusted programmatically, but in Python I would generally prefer to just use an iterative implementation. There is no mathematical...

You appear to have misread the problem statement in a couple of ways. Please read it again carefully and see if you can find the parts of the statement that make your solution invalid. I will give you one as a hint, but there is another issue besides ...

ANONYMOUS wrote You will be unsurprised to learn that this is an extant field of study. I am not quite following the "little guy" architecture you are describing, but various models of computation have been studied differentiated by the capabilities a...

Details have now been released. See the announcement on LMS or by email.

We are aware of the issue, which appears to be an issue due to the size of the file. We will upload the samples to LMS when possible.

Counting sort just requires us to be able to count how many of each category of element appear. So we just need a data structure for that. The range 0, n) is easy as that can be done with a list of length n . But for any range lwr, upr) we jus...

ANONYMOUS wrote This is because by doing (1 3) in Python you have turned this int a floating point calculation. There are ways to make this work, but you do not need to. Remember that we encourage you to speak to lab facilitators to help you work...

We do not intend to release solutions to the labs (yet, at least). We believe that having access to reference solutions will not help students learn the material, as the point is to treat these as problems you have not seen before. If you get stuck, ...

Please see the previous post https secure.csse.uwa.edu.au run help3001?p np opt U24

Hi, I do not like to comment on the relative difficulty of assessments, as difficulty is highly subjective. The assessments will aim to assess your progress towards the learning outcomes. The mid-semester test in particular is also meant to be a format...

No, importing third-party libraries is not permitted.

Thanks for the reminder. This is now fixed in the slides on LMS, having been replaced with the order I intended, but apparently failed to type properly

Should be fixed.

ANONYMOUS wrote Heap sort only uses a single heap, though. Heaps are typically implemented as binary trees with the heap property, so maybe you are talking about the subtrees of the heap? Recall that one of the defining parts of a distribution sort is...

ANONYMOUS wrote These are not exclusive categories. Indeed, as you say, quicksort is both. Comparison-based sorting algorithms are restricted to only be able to compare elements, and have no other way to get information about their ordering. Quicksort...

ANONYMOUS wrote It has (currently, at least) been left on the default of scoring first by number of problems completed, then by time penalty. Time penalty is the sum of your submission time in minutes from the start of the "contest", plus 20 minutes ...

Converting the input strings into ints (which is intended), would only take a single linear O(N) scan over the list. It would take this long to even read in the input, so that should not be the dominating factor. Some questions for you to consider tha...

I am aware of the issue. Unfortunately, I didn't see until after the lecture yesterday an email that came through warning I used the pack mic, which appears to have worked in the room, but not for the Echo recording past the first few minutes. I am pl...