Register

NIELIT 2017 OCT Scientific Assistant A (CS) - Section B: 29

• edited by
1,036 views

2 Answers

2 votes
2 votes

I think it’s B. The Floyd–Warshall algorithm also known as Floyd's algorithm, the Roy–Warshall algorithm, the Roy–Floyd algorithm, or the WFI algorithm . Floyd-Warshall algorithm is used to find all pair shortest path problem from a given weighted graph using dynamic programming approach. 

Floyd–Warshall algorithm - Wikipedia

User Avatar
0 votes
0 votes

Floyd Warshall Algorithm- Floyd Warshall Algorithm is a famous algorithm. It is used to solve All Pairs Shortest Path Problem. It computes the shortest path between every pair of vertices of the given graph.

OPTION D

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

Related questions

1 votes
1 votes
3 answers
2
admin asked Apr 1, 2020
1,022 views
NIELIT 2017 OCT Scientific Assistant A (CS) - Section B: 30
An algorithm is made up of two modules $M1$ and $M2.$ If order of $M1$ is $f(n)$ and $M2$ is $g(n)$ then he order of algorithm is $max(f(n),g(n))$ $min(f(n),g(n))$ $f(n) + g(n)$ $f(n) \times g(n)$
An algorithm is made up of two modules $M1$ and $M2.$ If order of $M1$ is $f(n)$ and $M2$ is $g(n)$ then he order of algorithm is$max(f(n),g(n))$$min(f(n),g(n))$$f(n) + g...
User Avatar
1 votes
1 votes
1 answer
3
admin asked Apr 1, 2020
1,316 views
NIELIT 2017 OCT Scientific Assistant A (CS) - Section C: 4
The running time of an algorithm $T(n),$ where $’n’$ is the input size , is given by $T(n) = 8T(n/2) + qn,$ if $n>1$ $ = p,$ if $n = 1$ Where $p,q$ are constants. The order of this algorithm is $n^{2}$ $n^{n}$ $n^{3}$ $n$
The running time of an algorithm $T(n),$ where $’n’$ is the input size , is given by$T(n) = 8T(n/2) + qn,$ if $n>1$$ = p,$ if $n = 1$Where $p,q$ are constants. The or...
User Avatar
1 votes
1 votes
1 answer
4
admin asked Apr 1, 2020
1,034 views
NIELIT 2017 OCT Scientific Assistant A (CS) - Section B: 1
A decimal has $25$ digits. The number of bits needed for its equivalent binary representation is approximately, $50$ $74$ $40$ $60$
A decimal has $25$ digits. The number of bits needed for its equivalent binary representation is approximately,$50$$74$$40$$60$
User Avatar
Link Copied!