Question

1 pts Question 1 What would the cost array contain immediately after Dijkstra's algorithm discovers with certainty the least-cost path from A to C but just before this path is used to update the cost estimates of C's neighbors in the graph shown below? 14 10 11 6 15 A. 0 7 9 oo oo 14 F A B C D B. 0 7 9 14 14 A B C D E F C 0 7 9 22 14 A B C D E F D. 0 7 9 20 21 11

Can anybody help me with these questions? Plz...

Answer 1

Answer 1:
Pass 1:
0 inf inf inf inf inf

Pass 2:
0 7 9 inf inf 14

Pass 3:
0 7 9 22 inf 14

Pass 3:
0 7 9 20 inf 11

So B is the correct answer

Answer 2:
A is the correct answer
since for enqueuer, we insert at 2^nd position and update n as 2^nd node
for dequeuer, we simply remove the 2^nd node. So both taking O(1) time.

Answer 3:
A is the correct answer again.
(If you need reasons please ping me through comments below.)

Answer 5:
A is correct since Starting from node B, it first visits immediate neighbours A, E, and C. After visiting this path, it visits F and D

Answer 6:
B is the correct answer, since it contains no cycles and Items with added in ascending order.

Answer 7:
C is the correct answer since after adding edge 1, edge 2 cannot be added to the tree

Answer 8:
A is the correct answer since for all i Heap(i) > Max(heap(i*2 +1), heap(i*2+2))

Here are the answers champ. By the way, we are only allowed to answer 4 questions, so please post less numbers questions from next time. If you are facing any problem with the answers, please feel free to comment below. I shall be glad to answer you.