HARD
HSSC Clerk
IMPORTANT
Earn 100
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.
50% studentsanswered this correctly
Important Questions on Data Structures
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 _____.
HARD
HSSC Clerk
IMPORTANT
Which of the following is useful in implementing quick sort?
HARD
HSSC Clerk
IMPORTANT
Queue can be used to implement?
HARD
HSSC Clerk
IMPORTANT
The process of accessing data stored in a tape is similar to manipulating data on a __________.
HARD
HSSC Clerk
IMPORTANT
The memory address of the fifth element of an array can be calculated by which of the following formula?
HARD
HSSC Clerk
IMPORTANT
Which of the following data structure is linear data structure?
HARD
HSSC Clerk
IMPORTANT
Which of the following is not the type of queue?
