Back to the 2022 paper
Similar questions
Design & Analysis of AlgorithmsWhat is negative weight-cycle? Write Bellman-Ford algorithm to find single shortest distance of a directed graph.20237mDesign and Analysis of Algorithms Explain how Bellman Ford algorithm can be used to detect the presence of negative weight cycles.20257mDesign and Analysis of Algorithms In the below given weighted graph W (Given in form of matrix), apply Bellman Ford's algorithm to find the shortest distances from source node 3. Write the time complexity of Bellman Ford's algorithm. | | 1 | 2 | 3 | 4 | 5 | |---|---|---|---|---|---| | 1 | 0 | 1 | 8 | 1 | 4 | | 2 | 1 | 0 | 12 | 4 | 9 | | 3 | 8 | 12 | 0 | 7 | 3 | | 4 | 1 | 4 | 7 | 0 | 2 | | 5 | 4 | 9 | 3 | 2 | 0 |20237mDesign & Analysis of AlgorithmsWhich of the following algorithms are used to find the shortest path from a source node to all other nodes in a weighted graph? - (i) BFS - (ii) Prim's Algorithm - (iii) Djikstra's Algorithm - (iv) Kruskal's Algorithm20242m
PreviousFind Huffman codes for the text of characters with given frequencies: | Characters | T | I | V | K | L | E | O | Z | P | R | |---|---|---|---|---|---|---|---|---|---|---| | Frequencies | 43 | 38 | 16 | 8 | 50 | 12 | 56 | 13 | 22 | 7 |NextDefine P-Class, NP-class, NP-complete class and NP-hard class of problems. What is the relation between them?