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
- Length of IPv6 address is _____ bits.
- A computer uses 8-bit two's-complement integers. What decimal value is represented by 11101010₂?
- What is a "final" class in Java?
- In Operating Systems, what is 'thrashing'?
- What is 'virtual memory' in Operating Systems?
- Which of the following scenarios is best suited for implementation using a stack data structure?
- Which of the attributes shown below is a simple attribute?
- Which of the following statements about HTTP cookies is correct?
- A Repeater operates at which layer of the OSI model?
- Which SQL query correctly displays all records from EMPLOYEE_CARD where Company is Reliance, Infosys, TCS, or Cognizant?
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)