Register

NPTEL Assignment Question

• retagged by
318 views

1 Answer

2 votes
2 votes

Answer: B

Explanation: the for loop in the bellman ford algorithm gets executed for v-1 times. after making v-1 passes, the algorithm checks for a negative weight cycle and returns appropriate boolean value.

User Avatar
Voting & Accepting an answer helps improve the community
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

2 votes
2 votes
1 answer
1
rsansiya111 asked Dec 8, 2021
871 views
NPTEL Assignment Question
Suppose we do merge sort with a three-way split: divide the array into 3 equal parts, sort each part and do a 3 way merge. What would the worst-case complexity of this version be? O($n^2$) O($n^2$ log3n) O(n log2n) O(n $(log2n)^2$)
Suppose we do merge sort with a three-way split: divide the array into 3 equal parts, sort each part and do a 3 way merge.What would the worst-case complexity of this ver...
User Avatar
0 votes
0 votes
3 answers
3
rsansiya111 asked Dec 8, 2021
728 views
NPTEL Assignment Question
Suppose there are k sorted lists (decreasing order) with n/k elements in each list. What is the time complexity to merge them into one single sorted list. Hint: Maintain a heap of k elements. Think which k elements to choose. A. O(nlogk) B. O(n) C. O(nk) D. O(nlogn)
Suppose there are k sorted lists (decreasing order) with n/k elements in each list.What is the time complexity to merge them into one single sorted list.Hint: Maintain a ...
User Avatar
Link Copied!