Question
Which algorithm is a greedy algorithm used to find the Minimum Spanning Tree (MS
- T of a graph by repeatedly adding the smallest weight edge that connects two disconnected components?
Solution
Kruskal's Algorithm is a greedy algorithm for finding an MST. It sorts all the edges in non-decreasing order of their weights and then adds edges one by one to the MST if they do not form a cycle with the already added edges. Prim's Algorithm is also greedy but builds the MST by growing a single component.
More IT Operating System Questions
- Which of the following real-world applications commonly uses a queue data structure to manage its operations?
- How do you correctly create a new Map object in JavaScript?
- Which cloud service model provides the highest level of control over the underlying infrastructure?
- In AJAX (Asynchronous JavaScript and XML), which of the following properties must be set to true to prevent the browser from waiting for the response befor...
- What is the purpose of version control systems (e.g., Git, SVN)?
- Which of the attributes shown below is a simple attribute?
- fill the blank for 19.
- Which of the following statements about guided transmission media is correct?
- A developer is choosing between an array and a linked list to store a collection of elements. If the primary operations will be frequent insertions and del...
- Why does paging incur memory overhead in operating systems?
