EASY
Earn 100
Which of the following method is used for sorting in merge sort
50% studentsanswered this correctly
Important Questions on Data Structure
HARD
In which of the following sorting algorithms, the number of comparisons needed is minimum if the items are initially in reverse order and maximum if the items are in order?
HARD
Among the following option which one does not describe the limitation of binary search algorithm?
EASY
Where does a binary search examine on each pass through?
HARD
Linked lists are not suitable data structures of which one of the following problems?
HARD
Which of the following traversal techniques lists the nodes of a binary search tree in ascending order?
HARD
Consider that elements are to be sorted. What is the worst case time complexity of Bubble sort?
HARD
Which of the following sorting methods will be the best if number of swapping done, is the only measure of efficiency?
EASY
What happens when you insert a key/value pair into a map and the key is already in the map?
HARD
Binary search algorithm can not be applied to _____.
EASY
The linear search method has an execution time of _______.
HARD
The number of swappings needed to sort the numbers 8, 22, 7, 9, 31, 19, 5, 13 in ascending order, using bubble sort is.
HARD
Linked lists are not suitable for which of the following problems?
HARD
In a circularly linked list organization, insertion of a record involves the modification of _____.
HARD
Which of the following sorting procedure is the slowest?
EASY
How many steps does a selection sort take if the length is n?
HARD
A sort which compares adjacent elements in a list and switches where necessary is a _____.
EASY
In a map, each item is associated with a unique ______ .
MEDIUM
In has-a and knows-a relationship, the association between the classes is assumed to be ________.
MEDIUM
A good specification should be:
HARD
Which of the following sorting method is stable?
