Question
Which data structure is used in Primās Algorithm to
efficiently find the minimum edge connecting a vertex to the spanning tree?Solution
In Primās Algorithm, a Min-Heap (Priority Queue) is used to efficiently find and extract the minimum-weight edge connecting a vertex to the existing spanning tree. The Min-Heap allows quick updates to edge weights and ensures that the minimum-weight edge can be retrieved in O(logā”V) time, where V is the number of vertices. Steps: ⢠Initialize a Min-Heap with all vertices, starting with an arbitrary vertex having weight 0. ⢠Update the heap when shorter edges are discovered. ⢠Extract the vertex with the minimum edge weight, adding it to the Minimum Spanning Tree (MST). This data structure optimizes the algorithm's overall complexity to O(Elogā”V), making it suitable for dense graphs. Why Other Options Are Incorrect: 1. Binary Search Tree: Inefficient for handling dynamic updates and retrieval of minimum elements. 2. Adjacency List: Represents graph structure but does not facilitate edge selection. 3. Adjacency Matrix: Useful for graph representation but inefficient for edge extraction in MST. 4. Disjoint Set: Used in Kruskalās Algorithm to detect cycles, not for edge selection in Primās Algorithm. Min-Heaps are integral to Primās efficiency in handling dynamic graph traversal during MST construction.
Golden rice, which is genetically modified, is rich in:
Father of green revolution in IndiaĀ
According to the botanical classification cashew belongs to which family among the following:
The Scheme for promotion of Hybrid Seeds aims to increase the income of which category of farmers?
What is the primary nutrient responsible for the growth and development of plant roots?Ā
The persons who starts to adopt new practices quickly or at first are calledĀ
Which allelopathy type involves the release into the environment of compound that is toxic after chemical modification by micro-organisms?Ā
Orobanche is _____ type of parasitic weed.Ā
Megasporogenesis occurs in
Which of the following is not a seeding machinery?