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
Correct Answer :
A. Much more complicated to analyze than that of worst case
Related Questions
To represent hierarchical relationship between elements, Which data structure is suitable?
Tree
Graph
Priority
Dequeue
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
The situation when in a linked list START=NULL is
underflow
overflow
housefull
saturated
Herder node is used as sentinel in ____
Graphs
Binary tree
Stacks
Queues
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 linear type?
Graph
Binary tree
Trees
Stack
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
Which data structure is used in breadth first search of a graph to hold nodes?
Array
Stack
Tree
queue
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 operation of processing each element in the list is known as
Sorting
Merging
Inserting
Traversal
A ______ is a data structure that organizes data similar to a line in the supermarket, where the first one in line is the first one out.
Stacks linked list
Queue linked list
Both of them
Neither of them
The term push and pop is related to the
array
lists
stacks
all of above
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
_____ is not the component of data structure.
Operations
Algorithms
Storage Structures
None of above
When inorder traversing a tree resulted E A C K F H D B G; the preorder traversal would return
FAEKCDBHG
FAEKCDHGB
EAFKHDCBG
FEAKDCHBG
Which of the following is not the part of ADT description?
Data
Operations
Both of the above
None of the above
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
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 complexity of Binary search algorithm is
O(n)
O(log )
O(n2)
O(n log n)
The complexity of merge sort algorithm is
O(n)
O(log n)
O(n2)
O(n log n)
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
Which of the following data structure is not linear data structure?
Arrays
Linked lists
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
The complexity of linear search 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
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
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 is non-liner data structure?
List
Stacks
Trees
Strings
Which if the following is/are the levels of implementation of data structure
Application level
Abstract level
Implementation level
All of the 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