This section contains more frequently asked Data Structure and Algorithms MCQs in the various University level and competitive examinations.
1. Time complexity of given algorithm Algorithm Display (A) { For I:=0 to n-1 { For J:=0 to n-1 { Write A; } } }
- 2n^2+4n+4
- 2n^2+n
- 2n^2+4n+2
- 2n^2-1
2. The sorting , which works very well for small file is ______________
- Count sort
- Selection sort
- Merge sort
- Quick sort
3. Merge sort is _________.
- Externalsorting
- Insertion sorting
- Internal sorting
- Exponential sorting
4. __________ is a step-by-step procedure for calculations
- Program
- Algorithm
- Greedy Method
- Problem
5. Advantage of finding maximum and minimum using divide and conquer method instead of using conditional operators is __________________
- Reduce Space complexity
- Get accurate value
- Reduce Time complexity
- Simple calculations
6. Given two non-negative functions f(n)= 5n2+6n+1 and g(n)=n2 . Calculate upper bound value ,C
- C=5
- C=12
- C=6
- C=11
7. Given two non-negative functions f(n)= 6n2+5n+1 and g(n)=n2 . Calculate lower bound value ,C
- C=5
- C=12
- C=6
- C=11
8. The functions f &g are non-negative functions. The function f(n)=O(g(n)) if and only if there exist positive constants c& n0 such that __________ for all n, n≥ n0
- f(n)≤C*g(n)
- f(n) = C*g(n)
- f(n) ≥ C*g(n)
- f(n) != C*g(n)
9. The functions f & g are non-negative functions. The function f(n)=Ω(g(n)) if and only if there exist positive constants c& n0 such that ___________ for all n, n≥ n0
- f(n) ≤ C*g(n)
- f(n) = C*g(n)
- f(n) ≥ C*g(n)
- f(n) != C*g(n)
10. The functions f & g are non-negative functions. The function f(n)=θ(g(n)) if and only if there exist positive constants c1,c2 & n0 such that ________for all n, n≥ n0
- C2*g(n)≤ f(n) ≤ C1*g(n)
- C2*g(n)≥ f(n) = C1*g(n)
- C2*g(n)!= f(n) = C1*g(n)
- C2*g(n)≤ f(n) = C1*g(n)