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
- What is the difference between 'preemptive' and 'non-preemptive' scheduling?
- Which of the following statements accurately describes hard computing?
- Given a 2D array (matrix) in Python: matrix = [[1, 2, 3], [4, 5, 6], [7, 8, 9]] What are the values of matrix[1][2] and matrix[2][0] respectively?
- Which of the following best describes the "Ready" state of a process?
- Kernel is :
- Which of the following statements accurately describes the purpose of unit testing in software development?
- What is the best case time complexity of merge sort?
- Which of the following is the last part of ICMP message format?
- Why does paging incur memory overhead in operating systems?
- In Huffman coding, symbols are: A(freq=45), B(freq=13), C(freq=12), D(freq=16), E(freq=9), F(freq=5). What is the total number of bits used to encode 100 c...
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
