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
- Complete the Python function to return the number of elements in a given list. def get_list_length(my_list): _________ # Line to complete
- Given processes with arrival times and burst times — P1(0,5), P2(1,3), P3(2,8), P4(3,6) — what is the average waiting time using Shortest Job First (SJF) p...
- What is unguided transmission in the context of data communication?
- In a data analysis application, a hash table is used to store key-value pairs for fast lookups. What is the primary goal of a good hash function?
- Which file allocation method can lead to external fragmentation on a disk over time?
- Which sorting algorithm picks up an element and places it in its correct place?
- Trace the execution of the following Java code: public class Flow { public static void main(String[] args) { int count = 0; ...
- The OS component responsible for managing memory, processes, devices, and files is called:
- Web Pages can be created using :
- Which of the following protocols is used to reliably transfer a file over an insecure channel and provides authentication and encryption?
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)