McqMate
| Q. |
Which of the following is true? |
| A. | prim’s algorithm initialises with a vertex |
| B. | prim’s algorithm initialises with a edge |
| C. | prim’s algorithm initialises with a vertex which has smallest edge |
| D. | prim’s algorithm initialises with a forest |
| Answer» A. prim’s algorithm initialises with a vertex | |
| Explanation: steps in prim’s algorithm: (i) select any vertex of given graph and add it to mst (ii) add the edge of minimum weight from a vertex not in mst to the vertex in mst; (iii) it mst is complete the stop, otherwise go to step (ii). | |
View all MCQs in
Design and Analysis of AlgorithmsNo comments yet