# Data structure MCQ Set-6

1. 1. In analysis of algorithm, approximate relationship between the size of the job and the amount of work required to do is expressed by using _________
• Central tendency
• Differential equation
• Order of execution
• Order of magnitude
• Order of Storage
2. 2. Worst case efficiency of binary search is
• log2 n + 1
• n
• 2n
• log n.
3. 3. For defining the best time complexity, let f (n) = log n and g (n) = √n, _________
• f (n) Ω(g(n)), but g(n)  Ω (f(n))
• f (n) Ω(g(n)), but g(n)  Ω (f(n))
• f (n) Ω(g(n)), and g(n)  Ω (f(n))
• f (n) Ω(g(n)), and g(n)  Ω (f(n))
4. 4. For analyzing an algorithm, which is better computing time?
• O (100 Log N)
• O (N) (c)O (2N)
• O (N logN)
• O (N2).
5. 5. Let f, t: N→R  0, and t (n) O (f (n)) iff t(n)≤ c.f (n) where cis positive real constant andn≥ no, then no is ___________
• Upper bound
• Lower bound
• Duality value
• Threshold value
• Maximum value.
6. 6. Consider the usual algorithm for determining whether a sequence of parentheses is balanced. What is the maximum number of parentheses that will appear on the stack AT ANY ONE TIME when the algorithm analyzes: (()(())(()))
• 1
• 2
• 3
• 4
7. 7. Breadth first search __________
• Scans each incident node along with its children.
• Scans all incident edges before moving to other node.
• Issame as backtracking
• Scans all the nodes in random order.
8. 8. Which method of traversal does not use stack to hold nodes that are waiting to be processed?
• Dept First
• D-search