[+] Show answers
What is the basic premise of Divide and Conquer algorithms?
Which one of the following algorithms is not a greedy algorithm?Floyd-Warshall AlgorithmPrim's AlgorithmKruskal's AlgorithmDijkstra's Algorithm
What is the lower bound of any comparison based sorting algorithm in the worst case scenario?
What complexity class does the Recursive Fibonacci algorithm belong to?Exponential timeLinear timeQuadratic timeLogarithmic time
What is an NP-Complete problem?
What is the time complexity for Insertion sort in worst case scenario?O(n^2)O(n log n)O(n)O(1)
What is the concept of 'Big O' notation used for?
What type of graph would use the Bellman-Ford algorithm?Graphs with negative-weight cyclesWeighted graphsNon-weighted graphsDirected acyclic graphs
What is the purpose of a hash table?
When does the Quick sort perform the worst?When the array is already sortedWhen the array is reversely sortedWhen the array has all same elementsWhen the array has random elements