edited by
243 views
0 votes
0 votes

 

Match $\text{List I}$ with $\text{List II}$

$\text{List I}$ $\text{List II}$
$\text{A}$. Dijkstra's Algorithm $\text{I}$. Calculates path matrix
$\text{B}$. Prim's Algorithm $\text{II}$. Stores minimum cost edge
$\text{C}$.  Warshall's Algorithm $\text{III}$. Stores the total cost from a source node to the current node
$\text{D}$. Kruskal's algorithm $\text{IV}$. Finds Minimum Spanning Tree


Choose the correct answer from the options given below:

  1. $\text{A-I, B-II, C-III, D-IV}$
  2. $\text{A-III, B-II, C-I, D-IV}$
  3. $\text{A-II, B-I, C-IV, D-III}$
  4. $\text{A-III, B-IV, C-II, D-I}$

(Option $1 [39585]) 1$
(Option $2[39586]) 2$
(Option $3 [39587]) 3$
(Option $4 [39588]) 4$

Answer Given by Candidate: $2$

 

edited by

Please log in or register to answer this question.

Related questions

0 votes
0 votes
2 answers
1
admin asked May 20, 2023
1,352 views
The negation of "Some students like hockey" is:Some students dislike hockeyEvery student dislike hockeyEvery student like hockeyAll students like hockey(Option $1[39301])...
0 votes
0 votes
1 answer
4
admin asked May 20, 2023
528 views
Consider the following conditional code, which returns a Boolean valuesif $((x>25) \& \&(y>100))$return 'false';else iff $(x \leq 25) \& \& \&(y \leq 100))$return 'true';...