1 A complete graph can have1 In a tree of n nodes, how many edges are there?1 When India got independence1 Which of the following data structures can handle updates and queries in log(n) time on an array?1 Concept of Memorization is Used in Which of the Following1 What is Average case Complexity of Bubble Sort1 Queue data structure works on1 In a max-heap, element with the greatest key is always in the which node1 To represent hierarchical relationship between elements, Which data structure is suitable?1 Pushing an element into stack already having five element and stack size 5, then stack becomes

More Quizes

## Merge sort only follows divide-n-conquer approach as the problem is recursively broken down recursively until all elements become single and then they are recombined .Hence the complexity of merge sort is O(nlogn).

Amitsee full DiscussionNov 03, 2017 05:18