Which algorithm returns a minimum spanning tree (MST) and uses a priority queue to select the next edge connected to the growing tree?
Which sorting algorithm is not stable by default?
Which data structure supports extraction of both min and max in O(1) time and insertion in O(log n)?
Which shortest-path algorithm is appropriate for graphs with non-negative weights and supports decrease-key efficiently for faster performance?
Which of the following SQL queries is used to remove a table from a database?
Dynamic Programming is useful when a problem has:
Which algorithm uses a priority queue to repeatedly pick the next closest vertex?
Which of the following is substring of “IXAMBEE”?
Which of the following problems cannot be solved using greedy algorithms for optimal result?
Recursive problems are implemented by
