EASY
HSSC Clerk
IMPORTANT
Earn 100

Which of the following is not a limitation of the binary search algorithm?
(a)Must use a sorted array
(b)Requirement of sorted array is expensive, when a lot of insertion and deletions are needed
(c)There must be a mechanism to access middle element directly
(d)Binary search algorithm is not efficient, when the data elements are more than
(e)None of the above

50% studentsanswered this correctly

Important Questions on Practice Sets
EASY
HSSC Clerk
IMPORTANT
Two main measures for the efficiency of an algorithm are:

EASY
HSSC Clerk
IMPORTANT
A variable's _____ indicates how long the variables remain on the computer's memory.

EASY
HSSC Clerk
IMPORTANT
When an argument is passed by reference:

EASY
HSSC Clerk
IMPORTANT
The number of possible values of , such that equals, is:

EASY
HSSC Clerk
IMPORTANT
When you omit parameters from a function call, values can be provided by:

EASY
HSSC Clerk
IMPORTANT
The process of transforming one-bit pattern into another by bitwise operations is called:

EASY
HSSC Clerk
IMPORTANT
The average successful search time for sequential search on items is?

EASY
HSSC Clerk
IMPORTANT
Queue can be used to implement?
