Please consider offering answers and suggestions to help other students!
And if you fix a problem by following a suggestion here,
it would be great if other interested students could see a short
"Great, fixed it!" followup message.
ANONYMOUS wrote
I will not provide sample answers. I have discussed in the last lecture Tutorial the types of answers I expect. Please listen to that recording. You can also come and discuss with me anytime Tues-Thursday (please send me mail), or ask...
hi, just wondering.. is anyone actually able to reach the time complexity of O(NlogN) in trains planes? at the moment I am only able to reach a time complexity of O(AB) where A B is the number of trains and planes respectfully.
Hello I'd just like to get a clarification on the permitted materials allowed during the exam. On studentConnect it says "Exam Conditions This is an examination WITH permitted materials
UWA approved calculators with stickers are permitted" are we al...
You can go through the pathways with no clearance required until you get to a node where the clearance can be obtained (in the test case it says that nodes 1-6 have NONE meaning they don't have the option to get a new clearance, 7 has green, 8 has re...
Does anyone else have the same problem?
My code returns 0-6-0-3-4-7-4-3-0-5-8-0-3-4-1, instead of 0-6-0-3-4-7-4-3-0-6-8-0-3-4-1. But this is because Dijkstra's algorithm would pick the smaller edge, 0-5 instead of 0-6. However, 0-6-8 results in a to...
With the standard Dijkstra algorithm, we can imeplement the checks so that the edges are limited when solving the shortest distance. This occurs becuase the clearance is not being satisfied.
But how can we still consider the possible path should the t...
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...
The answer to your questions are in the README.md in question 1 and 4
Question 1 (3 marks)
Implement your solution by filling out the method stub in the in trains planes.py .
You may import and use any built-in python module (but no extern...
Hi,
I just have a question with the additional data values that are given in the files for lab6 particularly testcases trains planes for the 1st problem. Are we meant to write testing code to test for these values or should it just past what was give...
FYI a more elegant solution to this problem than deleting system files would probably be to instead modify the test script to ignore any files that begin with a period . , or alternatively throw in a try-catch for UnicodeDecodeError which then co...
The train dates represent the day from which that train service opens and operates, the plane dates represent the flight date. If there is some path of train routes that are all open and operating before a flight date, that flight should be labelled ...
If you are on macOS you may get the error UnicodeDecodeError 'utf-8' codec can't decode byte 0xff in position 566 invalid start byte or something similar.
This error occurs because the code tester checks for all the files in the directory which in...
What significance do dates have on the trains planes() function?
Should we have the flights replaced by trains (direct or indirect train connections) on the same day of the flight? Or is any other day is fine as long as the the journey is replaced?
I am surprised that you have managed to make it to a second year unit without learning about resources such as onesearch.
Here is one sample paper https onesearch.library.uwa.edu.au discovery fulldisplay?docid alma991317624002101 context L vid 61UW...
Hi there,
Is there an error with the case0.txt in the testcases trains planes folder as it is the same as case0.txt from testcases security routing and doesn't have the same formatting as the other cases.
Thanks D