HARD
HSSC Clerk
IMPORTANT
Earn 100
Which of the following sorting algorithms has the worst time complexity of n log n?
50% studentsanswered this correctly
Important Questions on Data Structures
HARD
HSSC Clerk
IMPORTANT
The order of the binary search algorithm is _____.
HARD
HSSC Clerk
IMPORTANT
Stacks can't be used to __________.
HARD
HSSC Clerk
IMPORTANT
Which of the following abstract data types can be used to represent a many to many relation?
HARD
HSSC Clerk
IMPORTANT
Merge sort uses _____.
HARD
HSSC Clerk
IMPORTANT
The postfix expression for the infix expression is _____.
HARD
HSSC Clerk
IMPORTANT
Which of the following statements is true?
I. As the number of entries in the hash table increases, the number of collisions increases.
II. Recursive programs are efficient.
III The worst time complexity of quick sort is
IV. Binary search using a linked list is efficient.
HARD
HSSC Clerk
IMPORTANT
In a circularly linked list organization, insertion of a record involves the modification of _____.
HARD
HSSC Clerk
IMPORTANT
Stack is useful for implementing _____.
