Which of the following is not true about comparison based sorting algorithms? (A) The minimum possible time complexity of a comparison based sorting algorithm is… Read More
Category Archives: Quizzes
Which of the following standard algorithms is not Dynamic Programming based. (A) Bellman–Ford Algorithm for single source shortest path (B) Floyd Warshall Algorithm for all… Read More
Which of the following pairs of traversals is not sufficient to build a binary tree from the given traversals? (A) Preorder and Inorder (B) Preorder… Read More
In delete operation of BST, we need inorder successor (or predecessor) of a node when the node to be deleted has both left and right… Read More
What is the worst case time complexity for search, insert and delete operations in a general Binary Search Tree? (A) O(n) for all (B) O(Logn)… Read More
Which of the following algorithms is NOT a divide & conquer algorithm by nature? (A) Euclidean algorithm to compute the greatest common divisor (B) Heap… Read More
Consider a situation where swap operation is very costly. Which of the following sorting algorithms should be preferred so that the number of swap operations… Read More