https://secure.csse.uwa.edu.au/run/help2200?p=np&rss=y
The help2200 RSS feedThe help2200 RSS feedhelp2200https://blogs.law.harvard.edu/tech/rssThe University of Western AustraliaThu, 02 Jul 2020 21:43:06 +0800Thu, 02 Jul 2020 21:43:06 +0800Project Feedback
https://secure.csse.uwa.edu.au/run/help2200?p=np&a=417
https://secure.csse.uwa.edu.au/run/help2200?p=np&a=417Thu, 02 Jul 2020 21:43:06 +0800ANONYMOUSWill we get feedback for the project ?
Re: Exam Character Count Limit of 2000
https://secure.csse.uwa.edu.au/run/help2200?p=np&a=416
https://secure.csse.uwa.edu.au/run/help2200?p=np&a=416Thu, 25 Jun 2020 14:24:52 +0800ANONYMOUSI hope marking is done with regards to the fact that we had a small limit and could not fit everything everything
in the required space.
Re: Project Marks
https://secure.csse.uwa.edu.au/run/help2200?p=np&a=415
https://secure.csse.uwa.edu.au/run/help2200?p=np&a=415Wed, 17 Jun 2020 16:46:18 +0800ANONYMOUSI was wondering when we can expect to receive our project marks?
Re: Exam Character Count Limit of 2000
https://secure.csse.uwa.edu.au/run/help2200?p=np&a=414
https://secure.csse.uwa.edu.au/run/help2200?p=np&a=414Wed, 17 Jun 2020 16:45:44 +0800ANONYMOUSI think it's unfair to mark the people's answers in another question answer box. Some of us weren't aware we
were allowed to do this and had to keep our answer to 2000 characters so it's unfair that others are being
allowed extra words. I found it extremely hard to keep my answers to 2000 characters and had to cut out
important information in order to do this. Everyone should be marked on the same word limit.
Re: Exam Character Count Limit of 2000
https://secure.csse.uwa.edu.au/run/help2200?p=np&a=413
https://secure.csse.uwa.edu.au/run/help2200?p=np&a=413Tue, 16 Jun 2020 16:10:46 +0800ANONYMOUSRe: Exam Character Count Limit of 2000
https://secure.csse.uwa.edu.au/run/help2200?p=np&a=412
https://secure.csse.uwa.edu.au/run/help2200?p=np&a=412Tue, 16 Jun 2020 12:31:05 +0800"Ethan Lim" <22701593@student.uwa.edu.au>
Thanks for the reply,
Just to confirm, my written answer in the box of another question will be marked right?
Re: Exam Character Count Limit of 2000
https://secure.csse.uwa.edu.au/run/help2200?p=np&a=411
https://secure.csse.uwa.edu.au/run/help2200?p=np&a=411Tue, 16 Jun 2020 10:36:03 +0800"Amitava Datta" <amitava.datta@uwa.edu.au>
I didn't have any control over character count. Extremely sorry about this. But I will carefully check if you have written part of an answer in the box of another question.
Re: Exam Character Count Limit of 2000
https://secure.csse.uwa.edu.au/run/help2200?p=np&a=410
https://secure.csse.uwa.edu.au/run/help2200?p=np&a=410Mon, 15 Jun 2020 11:15:27 +0800"Ethan Lim" <22701593@student.uwa.edu.au>I just hope they mark what i didnt manage to fit into q6
Re: Exam Character Count Limit of 2000
https://secure.csse.uwa.edu.au/run/help2200?p=np&a=409
https://secure.csse.uwa.edu.au/run/help2200?p=np&a=409Mon, 15 Jun 2020 11:04:38 +0800"Ethan Lim" <22701593@student.uwa.edu.au>Yeah I also found the character limit too restrictive. I just continued my answer to Q6) in
the space given in the other questions.
If you see this post https://secure.csse.uwa.edu.au/run/help2200?p=np&a=360&all=y6 amitava
says he does not care about length, so I dont know why he set the charater limit so low
Re: Exam Character Count Limit of 2000
https://secure.csse.uwa.edu.au/run/help2200?p=np&a=408
https://secure.csse.uwa.edu.au/run/help2200?p=np&a=408Mon, 15 Jun 2020 10:52:51 +0800ANONYMOUSAlso please don't discuss exam questions here. I am just discussing only the word count
limit.
Exam Character Count Limit of 2000
https://secure.csse.uwa.edu.au/run/help2200?p=np&a=407
https://secure.csse.uwa.edu.au/run/help2200?p=np&a=407Mon, 15 Jun 2020 10:51:55 +0800ANONYMOUSDid anyone else find the Character count limit of 2,000 somewhat limiting especially
for the last question Q6. It required a lot of explanation as it touched on two
complex algorithms and concepts.
Re: Explaining Algorithms Questions
https://secure.csse.uwa.edu.au/run/help2200?p=np&a=406
https://secure.csse.uwa.edu.au/run/help2200?p=np&a=406Mon, 15 Jun 2020 08:26:45 +0800ANONYMOUS
Ok, so you also want us to explain HOW it works?
Re: [2019 4b] Can we use pseudocode for our answer?
https://secure.csse.uwa.edu.au/run/help2200?p=np&a=405
https://secure.csse.uwa.edu.au/run/help2200?p=np&a=405Mon, 15 Jun 2020 08:09:19 +0800"Amitava Datta" <amitava.datta@uwa.edu.au>ANONYMOUS wrote:
yes, this is an excellent answer
Re: Content Scope - Unrecorded Lectures?
https://secure.csse.uwa.edu.au/run/help2200?p=np&a=404
https://secure.csse.uwa.edu.au/run/help2200?p=np&a=404Mon, 15 Jun 2020 08:08:33 +0800"Amitava Datta" <amitava.datta@uwa.edu.au>
Thanks Sarah, yes
Re: Explaining Algorithms Questions
https://secure.csse.uwa.edu.au/run/help2200?p=np&a=403
https://secure.csse.uwa.edu.au/run/help2200?p=np&a=403Mon, 15 Jun 2020 08:07:57 +0800"Amitava Datta" <amitava.datta@uwa.edu.au>ANONYMOUS wrote:
Yes, I want explanation, otherwise I can't judge whether you have understood.
Explaining Algorithms Questions
https://secure.csse.uwa.edu.au/run/help2200?p=np&a=402
https://secure.csse.uwa.edu.au/run/help2200?p=np&a=402Sun, 14 Jun 2020 22:47:31 +0800ANONYMOUSWhen answering these types of questions, for example, explain in your own words
Dijkstra's algoirthm, do you want basically a text version of the pseudocode? Would
that get you full marks?
Or do you want more explanation as to why the code works, for example, how Dijkstra's
algorithm relaxes the key values in subsequent iterations
Re: Content Scope - Unrecorded Lectures?
https://secure.csse.uwa.edu.au/run/help2200?p=np&a=401
https://secure.csse.uwa.edu.au/run/help2200?p=np&a=401Sun, 14 Jun 2020 21:50:53 +0800"Sarah Woolhouse" <22235393@student.uwa.edu.au>Don't worry apparently this has already been asked to death. Only recorded lectures are relevant to exam. Sorry!
Content Scope - Unrecorded Lectures?
https://secure.csse.uwa.edu.au/run/help2200?p=np&a=400
https://secure.csse.uwa.edu.au/run/help2200?p=np&a=400Sun, 14 Jun 2020 21:47:46 +0800ANONYMOUSHi guys
Just wondering if the lectures which aren't recorded on LMS are still part of the exam content? Assuming so, but won't waste my time if anyone can confirm otherwise.
TIA
[2019 4b] Can we use pseudocode for our answer?
https://secure.csse.uwa.edu.au/run/help2200?p=np&a=399
https://secure.csse.uwa.edu.au/run/help2200?p=np&a=399Sun, 14 Jun 2020 21:38:59 +0800ANONYMOUSHi Amitava,
Is my answer for 2019 4b below sufficient?
I understand that we won't be tested on pseudocode this year, but I find it helps me
explain how the algorithm works and the time complexity of it.
...
2019 4b) Explain clearly Dijkstra’s single-source shortest path algorithm. Analyse
the complexity of this algorithm.
...
Dijkstra pseudocode:
Dijkstra(G, S):
For each vertex v in graph vertices G:
Distance[v] = infinity
Previous[v] = null
Distance[S] = 0 // set the distance from the source to itself to 0
Q = priorityQueue(G) // create a priority queue of vertices
While Q is not empty:
U = removeMin(Q) // get the min vertex from the queue
For edge (U, V) in edges:
If distance[V] > distance[U] + edgeWeight(U, V): // perform
relaxation
Distance[V] = distance[U] + edgeWeight(U, V)
Previous[V] = U
...
Dijkstra calculates the shortest path from the source to all vertices in a graph.
Dijkstra does this by:
1. Set distances to all other vertices to infinity initially
2. Set distance from source to itself to 0
3. Create a priority queue of vertices and their edge weights
4. Iterate through each vertex in the PQ
5. Dequeue the vertex with the minimum edge weights
6. Perform relaxation on the vertex
7. Repeat until no more vertex in the PQ
The time complexity for Dijkstra is: O(E log V).
• O( log V ) as a heapify operation is performed on each vertex
• O( E ) as it iterates through all edges for every Vertex
Re: Asymptotic Proof
https://secure.csse.uwa.edu.au/run/help2200?p=np&a=398
https://secure.csse.uwa.edu.au/run/help2200?p=np&a=398Sun, 14 Jun 2020 21:29:04 +0800"Amitava Datta" <amitava.datta@uwa.edu.au>ANONYMOUS wrote:
That would be fine