Which of the following is not a System Software?

Which algorithm returns a minimum spanning tree (MST) and uses a priority queue to select the next edge connected to the growing tree?

Which algorithm is best suited for finding a Hamiltonian cycle in an undirected graph?       

Which architecture allows multiple processors to share memory and work simultaneously?          

Worst case is the worst case time complexity of Prim’s algorithm if adjacency matrix is used?

Which command is TCL command

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 shared by the thread of the same process.

Which of the following algorithms is most appropriate for a sorting task that requires minimal auxiliary space?

In a Data Analytics pipeline, which of the following is an advantage of using Dimensional Modelling?