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 ?
More IT Operating System Questions
- Huffman Coding uses a greedy approach to achieve what?
- Which of the following scenarios is best suited for implementation using a stack data structure?
- In Oracle database variable length column is declared by ____________
- Which of the following is a key characteristic of a heap's structure?
- cyber attack in which a malicious actor aims to render a computer or other device unavailable to its intended users by interrupting the device's normal fun...
- In a backtracking algorithm, what happens when a partial solution is found to violate a constraint?
- What is the decimal value represented by the 8-bit two's complement binary number 10110101?
- Packet filtering is responsibility of which layer of OSI model?
- Complete the Java method to extract a substring from text starting at startIndex and having length characters. public class StringUtil { public Strin...
- A Repeater operates at which layer of the OSI model?
Hey! Ask a query
Please enter email id
The email must be a valid email address.
Please enter Mobile Number
Please enter valid Mobile Number
Please enter your Doubt
Think You're Ready for RBI Grade B?
RBI Grade B 2026 Phase 1 Memory Based Paper
- 200 Questions with Detailed Solutions
- Section-wise Coverage (GA, English, Quant & Reasoning)