Q56
Complete the program. n=rows[W] D(0)=W for k=1 to n do for i=1 to n do for j=1 to n do ___________ return D(n)
A.
dij(k)=min(dij(k-1), dik(k-1) - dkj(k-1))
B.
dij(k)=max(dij(k-1), dik(k-1) - dkj(k-1))
C.
dij(k)=min(dij(k-1), dik(k-1) + dkj(k-1))
AnswerD.
dij(k)=max(dij(k-1), dik(k-1) + dkj(k-1))
Answer: Option C
Solution
Answer: Option C
No explanation is given for this question Let's Discuss on Board