This section contains more frequently asked Data Structure Fundamentals Multiple Choice Questions Answers in the various University level and competitive examinations.
1. Which of thefollowing sorting algorithm is of divide-and-conquer type?
- Bubble sort
- Quick sort
- Insertion sort
- All of above
B. Quick sort
2. An algorithm that calls itself directly or indirectly is known as
- Sub algorithm
- Polish notation
- Recursion
- Traversal algorithm
C. Recursion
3. The running time of quick sort depends heavily on the selection of
- No of inputs
- Size o elements
- Arrangement of elements in array
- Pivot element
D. Pivot element
4. In stable sorting algorithm
- One array is used
- More then one arrays are required
- In which duplicating elements are
- Duplicating elements remain in not handled. same relative position after sorting
D. Duplicating elements remain in
not handled. same relative position after sorting
5. Which sorting algorithn is faster :
- O(n^2)
- O(n+k)
- O(nlogn)
- O(n^3)
B. O(n+k)
6. In Quick sort algorithm,constants hidden in T(n lg n) are
- Large
- Not known
- Medium
- Small
D. Small
7. Quick sort is based on divide and conquer paradigm; we divide the problem on base of pivotelementand:
- There is explicit combine process as well to conquer the solution.
- No work is needed to combine the sub-arrays, the array is already sorted
- Merging the subarrays
- None of above.
A. There is explicit combine process as well to conquer the solution.
8. Dijkstra’s algorithm :
- Has greedy approach to find all shortest paths
- Has both greedy and Dynamic approach to find all shortest paths
- Has greedy approach to compute single source shortest paths to all other vertices
- Has both greedy and dynamic approach to compute single source shortest paths to all other vertices.
C. Has greedy approach to compute single source shortest paths to all other vertices
9. What algorithm technique is used in the implementation of Kruskal’ssolution for theMST?
- Greedy Technique
- Divide-and-ConquerTechnique
- Dynamic Programming Technique
- The algorithm combines more than one of the above techniques
A. Greedy Technique
10. Which is true statement in the following?
- Kruskal’salgorithm is multiple source technique for finding MST.
- Kruskal’s algorithm is used to find minimum spanning tree of a graph, time complexity of this algorithm is O(EV)
- Both of above
- Kruskal’s algorithm (choose best non-cycle edge) is better than Prim’s (choose best Tree edge) when the graph has relatively few edges )
D. Kruskal’s algorithm (choose best non-cycle edge) is better than Prim’s (choose best
Tree edge) when the graph has relatively few edges )