It's UWAweek 48

help2200

This forum is provided to promote discussion amongst students enrolled in CITS2200 Data Structures and Algorithms.

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.

How do I ask a good question?
Showing 20 of 176 articles
Showing page 3 of 9⬅ older  |  newer ⮕
Currently no other people reading this forum.


 UWA week 22 (1st semester, study break) ↓
SVG not supported 3:03pm Mon 27th May, Amitava D.

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


SVG not supported 3:01pm Mon 27th May, Amitava D.

ANONYMOUS wrote This is Dijkstra's algorithm that has a time complexity of O((V E)log V) as covered in the lectures. Here N is V E.


SVG not supported 2:04pm Mon 27th May, ANONYMOUS

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.


 UWA week 21 (1st semester, week 12) ↓
SVG not supported 5:52pm Thu 23rd May, ANONYMOUS

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


SVG not supported 1:04pm Thu 23rd May, ANONYMOUS

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


SVG not supported 12:47pm Wed 22nd May, ANONYMOUS

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


SVG not supported 11:22am Wed 22nd May, ANONYMOUS

This is the path for the sample 0-6-0-3-4-7-4-3-0-6-8-0-3-4-1 4 4 1 4 2 2 4 4 4 1 1 1 4 3 39


SVG not supported 3:23pm Tue 21st May, ANONYMOUS

For lab 6 test case, it would be helpful if anyone has already solved the path from 0 to 1 with time 39 to post the route being taken.


SVG not supported 2:41pm Tue 21st May, ANONYMOUS

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


SVG not supported 1:06pm Tue 21st May, ANONYMOUS

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


SVG not supported 2:47pm Mon 20th May, ANONYMOUS

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


 UWA week 20 (1st semester, week 11) ↓
SVG not supported 8:57pm Sun 19th May, ANONYMOUS

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


SVG not supported 8:38pm Sun 19th May, ANONYMOUS

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


SVG not supported 9:33pm Fri 17th May, ANONYMOUS

Will there be any more lecture slides released to help complete lab6? Or are we going to be left with what we have at the moment


SVG not supported
lab 6  (both)
9:32pm Fri 17th May, ANONYMOUS

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


SVG not supported 9:11pm Wed 15th May, ANONYMOUS

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


SVG not supported
lab 6  (both)
1:42pm Tue 14th May, ANONYMOUS

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?


SVG not supported 1:12pm Tue 14th May, ANONYMOUS

Good afternoon, Are we allowed to import libraries on lab 6?


SVG not supported 9:05pm Mon 13th May, ANONYMOUS

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


SVG not supported
Test Case0 👍x2
11:29am Mon 13th May, ANONYMOUS

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

The University of Western Australia

Computer Science and Software Engineering

CRICOS Code: 00126G
Written by [email protected]
Powered by history
Feedback always welcome - it makes our software better!
Last modified  8:08AM Aug 25 2024
Privacy policy