HARD
HSSC Clerk
IMPORTANT
Earn 100

Which of the following data structure can't store the non-homogeneous data elements?
(a)Arrays
(b)Records
(c)Pointers
(d)None
(e)None of these

50% studentsanswered this correctly

Important Questions on Data Structures
HARD
HSSC Clerk
IMPORTANT
Which of the following data structure store the homogeneous data elements?

HARD
HSSC Clerk
IMPORTANT
Each data item in a record may be a group item composed of sub-items; those items which are indecomposable are called _____.

HARD
HSSC Clerk
IMPORTANT
Which of the following is two way list?

HARD
HSSC Clerk
IMPORTANT
Which of the following name(s) related to stacks?

HARD
HSSC Clerk
IMPORTANT
When the efficiency of algorithm determine, then the space factor is measured by _____.

HARD
HSSC Clerk
IMPORTANT
Which of the following case does not exist in complexity theory?

HARD
HSSC Clerk
IMPORTANT
The Worst case occur in linear search algorithm when _____.

HARD
HSSC Clerk
IMPORTANT
The Average case occur in linear search algorithm _____.
