📊 Design and Analysis of Algorithms
Q. Kruskal’s algorithm is a
  • (A) divide and conquer algorithm
  • (B) dynamic programming algorithm
  • (C) greedy algorithm
  • (D) approximation algorithm
💬 Discuss
✅ Correct Answer: (C) greedy algorithm

Explanation: kruskal’s algorithm uses a greedy algorithm approach to find the mst of the connected weighted graph. in the greedy method, we attempt to find an optimal solution in stages.

Explanation by: Mr. Dubey
kruskal’s algorithm uses a greedy algorithm approach to find the mst of the connected weighted graph. in the greedy method, we attempt to find an optimal solution in stages.

💬 Discussion

Related MCQs

Q. DCS is a

Q. What are the pros (advantages) of a heuristic evaluation?

Q. _____________ can help us detect poor E-R design.

Q. Consider a relation R(A,B,C,D,E) with the following functional dependencies: ABC -> DE and D -> AB The number of superkeys of R is:

Q. To delete a database ................... command is used

Q. Examples of User Policies is/are:

Q. Which of the following function is used when you want all tied rows to have the same ranking?

Q. A use-case____________ represents how a use case will be implemented in terms of collaborating objects.

Q. ATM uses _______________

Q. Who invented Analytical engine?

📊 Question Analytics

👁️
79
Total Visits
📽️
3 y ago
Published
🎖️
Mr. Dubey
Publisher
📈
96%
Success Rate