Under the Prime Minister’s Aatmanirbharta Mission,

Which of the following is NOT a divide-and-conquer algorithm?

Which of the following Big Data processing models is based on the concept of continuous data flow processing?              

Which algorithm is used to detect cycles in a directed graph?

The time complexity of computing the all-pairs shortest paths in a dense graph with V vertices using Floyd–Warshall is:

Which protocol is most commonly used for secure communication between IoT devices over the internet?        

Which of the following is a critical concern for securing critical infrastructure?

Consider a directed acyclic graph (DAG). The problem of finding the longest path in a DAG (with edge weights) can be solved in:

Which of the following is considered the strongest type of encryption method in modern cyber security practices?      

Which sorting algorithm divides the array into halves recursively?

Which shortest-path algorithm is appropriate for graphs with non-negative weights and supports decrease-key efficiently for faster performance?