Question
Consider a graph with vertices A, B, C, D and edges with weights: (A,
- B =1, (A,
- C =7, (A,
- C =3, (C,
- D =10, (B,
- D =4, (D,
- E =2. (Assume E is another vertex). If you apply Kruskal's algorithm, what is the sequence of edges added to the Minimum Spanning Tree (MS
- T ?
Solution
The correct answer is A
More IT Operating System Questions
- Which represents a collection of binary data stored as a single entity in the database management system?
- Which of the following real-world applications commonly uses a queue data structure to manage its operations?
- Which of the following statements about the OSI Model’s Transport Layer is true?Â
- Which algorithm is used in game playing for decision making?
- Consider the in-order traversal of a Binary Search Tree. What characteristic does the sequence of visited nodes possess?
- How many types of JDBC drivers?
- Complete the while loop condition for an iterative binary search implementation. def binary_search(arr, target): Â Â low = 0 Â Â high = len(arr) - 1 ...
- What is a best practice for securing remote access in Windows and Unix/Linux environments?Â
- In a virtual memory system, which of the following techniques is used to maintain the illusion that each process has its own dedicated memory space?Â
- Which of the following is NOT a type of firewall?Â
