Question
Which algorithm is a greedy algorithm used to find the Minimum Spanning Tree (MS
- T of a graph by repeatedly adding the smallest weight edge that connects two disconnected components?
More IT Operating System Questions
- Which of the following real-world applications commonly uses a queue data structure to manage its operations?
- A virtual address has 64 pages of 1024 bytes each. How many address bits are required?
- A data analysis task requires repeatedly extracting the element with the highest priority from a collection. Which heap operation is used for this, and wha...
- Which of the following is an example of unsupervised learning in AI?
- Three processes have CPU bursts P1=8 ms, P2=4 ms, P3=2 ms and all arrive at time 0. Under non-preemptive SJF, what is the average waiting time?
- Which of one the below options are the two different types of bus topology ?
- In a bank's IT governance framework, which statement correctly describes the relationship between a Business Continuity Plan (BCP) and a Disaster Recovery ...
- Which of the following statements about Referential Integrity is correct?
- What is the primary purpose of "virtual memory" in an operating system?
- Recurrence relations are commonly used to analyze the time complexity of Divide and Conquer algorithms. The Master Theorem is a tool for solving these. Wha...
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)