Which of the following is not a limitation of binary search algorithm?
must use a sorted array
requirement of sorted array is expensive when a lot of insertion and deletions are needed
there must be a mechanism to access middle element directly
binary search algorithm is not efficient when the data elements are more than 1000.
Correct Answer :
D. binary search algorithm is not efficient when the data elements are more than 1000.
Related Questions
For an algorithm the complexity of the average case is
Much more complicated to analyze than that of worst case
Much more simpler to analyze than that of worst case
Sometimes more complicated and some other times simpler than that of worst case
None or above
Two main measures for the efficiency of an algorithm are
Processor and memory
Complexity and capacity
Time and space
Data and space
The complexity of linear search algorithm is
O(n)
O(log n)
O(n2)
O(n log n)
Which one of the following permutations can be obtained the output using stack assuming that the input is the sequence 1,2,3,4,5 in that order ?
3,4,5,2,1
3,4,5,1,2
5,4,3,1,2
1,5,2,3,4
Each data item in a record may be a group item composed of sub-items; those items which are indecomposable are called
elementary items
atoms
scalars
all of above
Which of the following data structure is not linear data structure?
Arrays
Linked lists
Both of above
None of above
Stack is also called as
Last in first out
First in last out
Last in last out
First in first out
If the values of a variable in one module is indirectly changed by another module, this situation is called
internal change
inter-module change
side effect
side-module update
The operation of processing each element in the list is known as
Sorting
Merging
Inserting
Traversal
Arrays are best data structures
for relatively permanent collections of data
for the size of the structure and the data in the structure are constantly changing
for both of above situation
for none of above situation
A data structure where elements can be added or removed at either end but not in the middle
Linked lists
Stacks
Queues
Deque
Which of the following case does not exist in complexity theory
Best case
Null case
Worst case
Average case
……………. Is a pile in which items are added at one end and removed from the other.
Queue
Stack
List
None of the above
Linked lists are best suited
for relatively permanent collections of data
for the size of the structure and the data in the structure are constantly changing
for both of above situation
for none of above situation
Which data structure allows deleting data elements from and inserting at rear?
Stacks
Dequeues
Queues
Binary search tree
Identify the data structure which allows deletions at both ends of the list but insertion at only one end.
Stack
Input restricted dequeue
Priority queues
Output restricted qequeue
_______ level is where the model becomes compatible executable code
Abstract level
Implementation level
Application level
All of the above
Which of the following data structure store the homogeneous data elements?
Arrays
Records
Pointers
None
______ is very useful in situation when data have to stored and then retrieved in reverse order.
Stack
Queue
List
Link list
The complexity of merge sort algorithm is
O(n)
O(log n)
O(n2)
O(n log n)
Which of the following is non-liner data structure?
List
Stacks
Trees
Strings
Which of the following data structure is linear data structure?
Trees
Graphs
Arrays
None of above
Which of the following data structure can't store the non-homogeneous data elements?
Arrays
Records
Pointers
Stacks
Which of the following is two way list?
grounded header list
circular header list
linked list with header and trailer nodes
none of above
The memory address of fifth element of an array can be calculated by the formula
LOC(Array[5]=Base(Array)+w(5-lower bound), where w is the number of words per memory cell for the array
LOC(Array[5])=Base(Array[5])+(5-lower bound), where w is the number of words per memory cell for the array
LOC(Array[5])=Base(Array[4])+(5-Upper bound), where w is the number of words per memory cell for the array
None of above
_____ is not the component of data structure.
Operations
Algorithms
Storage Structures
None of above
The term push and pop is related to the
array
lists
stacks
all of above
When determining the efficiency of algorithm, the space factor is measured by
Counting the maximum memory needed by the algorithm
Counting the minimum memory needed by the algorithm
Counting the average memory needed by the algorithm
Counting the maximum disk space needed by the algorithm
Given two sorted lists of size m and n respectively.The number of comparisons needed in the worst case by the merge sort algorithm will be?
mn
max(m,n)
min(m,n)
m+n-1
Which of the following statement is false?
Arrays are dense lists and static data structure
data elements in linked list need not be stored in adjacent space in memory
pointers store the next data element of a list
linked lists are collection of the nodes that contain information part and next pointer