The complexity of Binary search algorithm is
O(n)
O(log )
O(n2)
O(n log n)
Correct Answer :
B. O(log )
Related Questions
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
Stack is also called as
Last in first out
First in last out
Last in last out
First in first out
The difference between linear array and a record is
An array is suitable for homogeneous data but the data items in a record may have different data type
In a record, there may not be a natural ordering in opposed to linear array.
A record form a hierarchical structure but a linear array does not
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
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
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
Each array declaration need not give, implicitly or explicitly, the information about
the name of array
the data type of array
the index set of the array
the first data from the set to be stored
Which of the following is true about the characteristics of abstract data types?
i) It exports a type.
ii) It exports a set of operations
True, False
False, True
True, True
False, False
_____ is not the component of data structure.
Operations
Algorithms
Storage Structures
None of above
Which of the following data structure is linear data structure?
Trees
Graphs
Arrays
None of above
_______ level is where the model becomes compatible executable code
Abstract level
Implementation level
Application level
All of the above
The initial configuration of the queue is a,b,c,d (a is the front end). To get the configuration d,c,b,a one needs a minimum of ?
3 additions and 2 deletions
2 deletions and 3 additions
3 deletions and 4 additions
3 deletions and 3 additions
The complexity of linear search algorithm is
O(n)
O(log n)
O(n2)
O(n log n)
Which of the following data structure can't store the non-homogeneous data elements?
Arrays
Records
Pointers
Stacks
The complexity of Binary search algorithm is
O(n)
O(log )
O(n2)
O(n log n)
Herder node is used as sentinel in ____
Graphs
Binary tree
Stacks
Queues
The number of possible ordered trees with three nodes A,B,C is?
16
12
6
10
The Average case occur in linear search algorithm
When Item is somewhere in the middle of the array
When Item is not in the array at all
When Item is the last element in the array
When Item is the last element in the array or is not there at all
Two main measures for the efficiency of an algorithm are
Processor and memory
Complexity and capacity
Time and space
Data and space
The situation when in a linked list START=NULL is
underflow
overflow
housefull
saturated
The memory address of the first element of an array is called
floor address
foundation address
first address
base address
Linked list are not suitable data structure of which one of the following problems ?
Binary search
Insertion sort
Radix sort
Polynomial manipulation
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.
Which of the following data structure cant store the non-homogeneous data elements?
Arrays
Records
Pointers
None
The complexity of merge sort algorithm is
O(n)
O(log n)
O(n2)
O(n log n)
Two dimensional arrays are also called
tables arrays
matrix arrays
both of above
none of above
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
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 of the following name does not relate to stacks?
FIFO lists
LIFO list
Piles
Push-down lists
Which data structure is used in breadth first search of a graph to hold nodes?
Array
Stack
Tree
queue