HARD
HSSC Clerk
IMPORTANT
Earn 100
The number of possible binary trees with nodes are _____.
50% studentsanswered this correctly
Important Questions on Data Structures
HARD
HSSC Clerk
IMPORTANT
Sorting is useful for _____.
HARD
HSSC Clerk
IMPORTANT
Choose the correct statements.
HARD
HSSC Clerk
IMPORTANT
A sorting technique that guarantees that records with the same primary key occurs in the same order in the sorted list as in the original unsorted list is said to be _____.
HARD
HSSC Clerk
IMPORTANT
The way a card game player arranges his cards as he picks them up one by one, is an example of _____.
HARD
HSSC Clerk
IMPORTANT
You want to check whether a given set of items is sorted or not. Which of the following sorting methods will be the most efficient if it is already in sorted order?
HARD
HSSC Clerk
IMPORTANT
Which of the following sorting methods will be the best if number of swapping done, is the only measure of efficiency?
HARD
HSSC Clerk
IMPORTANT
Which of the following sorting algorithms has the worst time complexity of n log n?
HARD
HSSC Clerk
IMPORTANT
The order of the binary search algorithm is _____.
