I just copy them again for easy reference
-----
Correct Answer: check if the degree of any node is greater than the number of available rooms
Feedback: If any nodes have degree greater than the number of available rooms, then there are more exams scheduled for a particular time then there are rooms available.
"
MY answer is: Check if there are more edges in the graph than the number of available rooms.(given that's what I think the best of the four choices there) though if I were able to write down the answer it'd be" check if there are more edges in the graph than the number of available rooms minus one"
----
yes, i agree if the check in "correct answer" turns out to be true(there is a node that has degree biger than N) then not enough room available, but that's an overkill in checking whether we have enough rooms.
or
"correct answer" covers the senario in "my answer" or "my answer" which is the mininum lower bound(whether there are more than N edges in the graph
or
when you're asked to give a big O notation for quicksort, woudl you like a O(exp(n))--which is certainly a upper bound, or would you accept O(lgN) which is the minimum upper bound that give more practical guidance when applied
---
I might still have not got the point in the correct, but this is my reasoning
Thanks Angela for your explanation |