DAALAB

Which of the following algorithms is an example of a greedy algorithm?

• Quick Sort

• Dijkstra’s shortest path algorithm

• Bellman-Ford algorithm

• Kruskal’s algorithm for minimum spanning tree

Which of the following is a dynamic programming problem?

• Longest Common Subsequence

• Binary Search

• Depth First Search

• Breadth First Search

Which of the following sorting algorithms has a worst-case time complexity of O(n^2)?

• Merge Sort
  

• Heap Sort

• Quick Sort

• Bubble Sort

Which of the following data structures is best suited for implementing a priority queue?

• Array

• Linked list

• Stack

• Heap

Which of the following algorithms is used to find the shortest path between two vertices in a graph?

• Breadth First Search

• Depth First Search
  

• Dijkstra’s shortest path algorithm

• Bellman-Ford algorithm

Which of the following algorithms is used to find the shortest path between all pairs of vertices in a graph?

• Breadth First Search

• Depth First Search

• Dijkstra’s shortest path algorithm

• Floyd-Warshall algorithm

Which of the following algorithms is used to find the longest increasing subsequence in a sequence?

• Merge Sort

• Heap Sort
  

• Quick Sort

• Dynamic Programming

Which of the following data structures is best suited for implementing a breadth-first search algorithm?

• Array
  

• Linked list

• Stack

• Queue

Which of the following algorithms is used to find the longest path in a directed acyclic graph?

• Breadth First Search
  

• Depth First Search

• Dijkstra’s shortest path algorithm

• Bellman-Ford algorithm

Which of the following algorithms is used to find the minimum spanning tree in a weighted graph?

• Dijkstra’s algorithm
  

• Prim’s algorithm

• Bellman-Ford algorithm

• Kruskal’s algorithm