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
Correct Answer :
D. m+n-1
Related Questions
Which if the following is/are the levels of implementation of data structure
Application level
Abstract level
Implementation level
All of the 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
The term push and pop is related to the
array
lists
stacks
all of above
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
To represent hierarchical relationship between elements, Which data structure is suitable?
Tree
Graph
Priority
Dequeue
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
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
The operation of processing each element in the list is known as
Sorting
Merging
Inserting
Traversal
Which of the following data structures are indexed structures?
linear arrays
linked lists
both of above
none of above
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
Which of the following data structure is non linear type?
Lists
Strings
Graph
Stacks
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 non-liner data structure?
List
Stacks
Trees
Strings
Which of the following algorithm design technique is used in the quick sort algorithm?
Dynamic programming
Greedy method
Divide and conquer
Backtracking
Which of the following case does not exist in complexity theory
Best case
Null case
Worst case
Average case
The complexity of Binary search algorithm is
O(n)
O(log )
O(n2)
O(n log n)
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 data structure cant store the non-homogeneous data elements?
Arrays
Records
Pointers
None
The complexity of Bubble sort algorithm is
O(n)
O(log n)
O(n2)
O(n log n)
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
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
Binary search algorithm can not be applied to
sorted linked list
sorted binary trees
sorted linear array
pointer array
The complexity of merge sort algorithm is
O(n)
O(log n)
O(n2)
O(n log n)
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
A binary search tree whose left subtree and right subtree differ in hight by at most 1 unit is called ……
AVL tree
Red-black tree
Lemma tree
None of the 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
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 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
Which of the following data structure is linear data structure?
Trees
Graphs
Arrays
None of above
When new data are to be inserted into a data structure, but there is no available space; this situation is usually called
underflow
overflow
housefull
saturated