The complexity of merge sort algorithm is
O(n)
O(log n)
O(n2)
O(n log n)
Correct Answer :
D. O(n log n)
Related Questions
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
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
Stack is also called as
Last in first out
First in last out
Last in last out
First in first out
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.
When determining the efficiency of algorithm the time factor is measured by
Counting microseconds
Counting the number of key operations
Counting the number of statements
Counting the kilobytes of algorithm
The memory address of the first element of an array is called
floor address
foundation address
first address
base address
A variable P is called pointer if
P contains the address of an element in DATA.
P points to the address of first element in DATA
P can store only memory addresses
P contain the DATA and the address of DATA
In linear search algorithm the Worst case occurs when
The item is somewhere in the middle of the array
The item is not in the array at all
The item is the last element in the array
The item is the last element in the array or is not there at all
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
The elements of an array are stored successively in memory cells because
by this way computer can keep track only the address of the first element and the addresses of other elements can be calculated
the architecture of computer memory does not allow arrays to store other than serially
both of above
none of above
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
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 data structure is used in breadth first search of a graph to hold nodes?
Array
Stack
Tree
queue
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
Which of the following is two way list?
grounded header list
circular header list
linked list with header and trailer nodes
none 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
Two dimensional arrays are also called
tables arrays
matrix arrays
both of above
none of above
The number of swapping needed to sort numbers 8,22,7,9,31,19,5,13 in ascending order using bubble sort is ?
11
12
13
14
______ is very useful in situation when data have to stored and then retrieved in reverse order.
Stack
Queue
List
Link list
Inserting an item into the stack when stack is not full is called _______ Operation and deletion of item form the stack, when stack is not empty is called _______operation.
push, pop
insert, delete
pop, push
delete, insert
The term push and pop is related to the
array
lists
stacks
all of above
Finding the location of the element with a given value is:
Traversal
Search
Sort
None of above
The complexity of Binary search algorithm is
O(n)
O(log )
O(n2)
O(n log n)
The situation when in a linked list START=NULL is
underflow
overflow
housefull
saturated
_____ is not the component of data structure.
Operations
Algorithms
Storage Structures
None of above
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
Which of the following case does not exist in complexity theory
Best case
Null case
Worst case
Average case
Which of the following is not the required condition for binary search algorithm?
The list must be sorted
there should be the direct access to the middle element in any sublist
There must be mechanism to delete and/or insert elements in list
none of above
Binary search algorithm can not be applied to
sorted linked list
sorted binary trees
sorted linear array
pointer array