Hey on Tuesday I tried to attend lab at 8am but no one was there, did I miss some notice for missing labs or something. Will there be lab 8am Tuesday next week?

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

I was just wondering if I solve a project problem (all correct in DOM) then do I automatically get all points for that problem, or is there more at play (reabability of code etc...). Also is there partial marks for mostly completed problems? Thanks

You do not need to solve all the problems to get full marks. Each problem has an associated points score. Your mark for the project will be the sum of points for your correct submissions. If this is over 100, it will be rounded down to 100. Formally,...

ANONYMOUS wrote You are permitted to learn new concepts and apply them. I strongly encourage it, and it's entire point of the unit Having said that, the labs and lectures should cover all the relevant concepts you need for the project. If you are wor...

Hi, I've been working on one of the problems in the project, and after a while of unsuccessful attempts and research, have come across a (maths) paper that seems like it could be extremely helpful. The paper itself doesn't contain code, but introduces...

ANONYMOUS wrote Please refer to the project rules "It is not allowed to share you solutions with other students in CITS3001." Also "The lab facilitators may help you understand what the problems are asking, and are also permitted to help with basic ...

ANONYMOUS wrote I have no issue with this in principle but it may trigger our plagiarism detection system. Please properly comment it so that if it comes up when we are marking we know that you used code from the lectures.

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

Are we allowed to use code from the lecture slides in the project with proper referencing?

Good question. I have added the following to the project information page. "There are no penalties for incorrect submissions. However, misuse of DOMjudge will not be tolerated and may be considered academic misconduct. Misuse includes denial of servic...

Would we be penalised if we get the wrong answer from our submission? or can we submit as many as we like? Thanks

ANONYMOUS wrote Please see the Project page on LMS "There are hidden test cases. Similar to the mid-semester test, there are secret test cases which you cannot download. If you get "WRONG ANSWER" or another incorrect verdict despite passing the samp...

yes there are hidden tests If your code passes most general cases then perhaps your code is struggling with an edge case?

I'm getting the wrong answer on DOMjudge but it passes all the tests and also produces the correct answers from the examples. Wondering if there are more tests for the bubble problem as I'm unsure what I am doing wrong because it's passing everything...

I want to add to Gozz's answer. Spanning trees are unrooted undirected trees. Shortest path trees are directed and rooted by construction, and only need to cover nodes that are reachable from the source node. The directed version of a spanning tree is...

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