This section contains more frequently asked Data Structure and Algorithms Basics Multiple Choice Questions Answers in the various University level and competitive examinations.
PRACTICE IT NOW TO SHARPEN YOUR CONCEPT AND KNOWLEDGE
1. Huffmancodes are the applications of _________ with minimal weighted external path length obtained by an optimal set.
- BST
- MST
- Binary tree
- Weighted Graph
C. Binary tree
2. From the following which is not return optimal solution
- Dynamic programming
- Backtracking
- Branch and bound
- Greedy method
B. Backtracking
3. ____________ is an algorithm design method that can be used when the solution to a problem can be viewed as the result of a sequence of decisions
- Dynamic programming
- Backtracking
- Branch and bound
- Greedy method
A. Dynamic programming
4. The name backtrack was first coined by _________
- D.H.Lehmer
- L.Baumert
- R.J.Walker
- S. Golomb
A. D.H.Lehmer
5. The term ________ refers to all state space search methods in which all hildren of the –nodes are generated before any other live node can becomethe E-node.
- Backtacking
- Depth First Search
- Branch and Bound
- Breadth First Search
C. Branch and Bound
6. A __________ is a round trip path along n edges of G that visits every vertex once and returns to its starting position.
- MST
- TSP
- Multistage Graph
- Hamiltonian Cycle
D. Hamiltonian Cycle
7. Graph Coloring is which type of algorithm design strategy
- Backtacking
- Greedy
- Branch and Bound
- Dynamic programming
A. Backtacking
8. 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
D. binary search algorithm is not efficient when the data elements are more than 1000
9. Binary Search Algorithm cannot be applied to
- Sorted linked list
- Sorted linear array
- Sorted binary tree
- Pointer array
A. Sorted linked list
10. Two main measures for the efficiency of an algorithm are
- Processor and memory
- Time and space
- Complexity and capacity
- Data and space
B. Time and space
