Name two algorithms two find minimum spanning tree?
- 1 Answers
- 1017 Views
- I also Faced
- E-Mail Answers
Answer / Sachin Arya
1) Prim's Algorithm: This is a popular algorithm for finding minimum spanning trees in a connected, undirected graph. It works by incrementally adding edges to the tree until all vertices are included. 2) Kruskal's Algorithm: This is another common algorithm for finding minimum spanning trees. Unlike Prim's, it first sorts the edges based on their weights and then builds the tree by connecting non-overlapping sets.
| Is This Answer Correct ? | 0 Yes | 0 No |
an array t[100] which contains numbers between 1..99. Return the duplicated value. Try both O(n) and O(n-square).
Can we sort hashmap?
What do you mean by 2-3-4 tree?
You are given a singly linked list. How would you find out if it contains a loop or not without using temporary space?
Why do we Use a Multidimensional Array?
Differentiate between the singly linked list and doubly linked list.
What's difference between stack and queue?
Whether Linked List is linear or Non-linear data structure?
Why is data structure?
What is binary tree in discrete mathematics?
What is data algorithm?
What do u mean by array?
Windows 
