Merge sort uses ?
Divide and conquer strategy
Backtracking approach
Heuristic search
Greedy approach
Correct Answer :
A. Divide and conquer strategy
Related Questions
……………. Is a pile in which items are added at one end and removed from the other.
Queue
Stack
List
None of the above
Which of the following data structure cant store the non-homogeneous data elements?
Arrays
Records
Pointers
None
The operation of processing each element in the list is known as
Sorting
Merging
Inserting
Traversal
Two dimensional arrays are also called
tables arrays
matrix arrays
both of above
none of above
Finding the location of the element with a given value is:
Traversal
Search
Sort
None of above
To represent hierarchical relationship between elements, Which data structure is suitable?
Tree
Graph
Priority
Dequeue
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
Which of the following is not the part of ADT description?
Data
Operations
Both of the above
None of the 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 statement is true ?
Breath first search cannot be used to find converted components of a graph.
Optimal binary search tree construction can be performed efficiently using dynamic programming.
Given the prefix and post fix walks over a binary tree.The binary tree cannot be uniquely constructe
Depth first search can be used to find connected components of a graph.
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
Which of the following data structure is non linear type?
Lists
Strings
Graph
Stacks
Which of the following data structure is not linear data structure?
Arrays
Linked lists
Both of above
None of above
Which of the following algorithm design technique is used in the quick sort algorithm?
Dynamic programming
Greedy method
Divide and conquer
Backtracking
_______ level is where the model becomes compatible executable code
Abstract level
Implementation level
Application level
All of the above
Which of the following case does not exist in complexity theory
Best case
Null case
Worst case
Average case
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 data structure can't store the non-homogeneous data elements?
Arrays
Records
Pointers
Stacks
_____ is not the component of data structure.
Operations
Algorithms
Storage Structures
None of above
Which if the following is/are the levels of implementation of data structure
Application level
Abstract level
Implementation level
All of the above
The number of possible ordered trees with three nodes A,B,C is?
16
12
6
10
______ is very useful in situation when data have to stored and then retrieved in reverse order.
Stack
Queue
List
Link list
Which of the following data structure is linear data structure?
Trees
Graphs
Arrays
None of above
A data structure where elements can be added or removed at either end but not in the middle
Linked lists
Stacks
Queues
Deque
The complexity of Binary search algorithm is
O(n)
O(log )
O(n2)
O(n log n)
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.
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
When inorder traversing a tree resulted E A C K F H D B G; the preorder traversal would return
FAEKCDBHG
FAEKCDHGB
EAFKHDCBG
FEAKDCHBG
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 store the homogeneous data elements?
Arrays
Records
Pointers
None