Analysis and Design of Algorithms
Questions Bank
1. Consider the following algorithm for the searching
problem. ALGORITHM Linear search (A[0, n-1],key)
// Searches an array for a key value by Linear search.
//Input: Array A [0 n-1] of values and a key value to search.
//Output: Returns index if search is successful. For i 0 to n-1 do If [key== A[i]) Return i.
a) Apply linear search algorithm to search the list 10, 92,38,74,56,19,82,37 for a key value
74.
b) Is this algorithm efficient?
c) When can this algorithm be used?
2. What are the most important problem types used to illustrate different algorithm
design techniques and methods of algorithm analysis?
3. Write the asymptotic notations used for best case, worst case and average case of
algorithms.
4. Discuss various methods used for mathematical analysis for recursive and non-
recursive algorithms.
5. Illustrate briefly Big oh Notation, Omega Notation and Evaluate Theta Notations. Depict
the same graphically and explain.
6. Define a Mathematical analysis of recursive algorithms and Examine the efficiency of factorials
of some number n with the help of General plan.
7. Define a Mathematical analysis of Non-recursive algorithms. Write about the efficiency of
finding the element with maximum value in a given Array with the help of a General plan.
8. Define Towers of Hanoi problem and describe the time complexity of Towers of Hanoi problem.
9. Evaluate the following:
i) f(n) = 5n2 -6n = ϴ(n2 )
ii) f(n)=10n3 +5 prove that f(n)=O(n3)
10. Evaluate the following:
I. f(n)=10 n2+4n+2 prove that f(n)=O(n2)
II. f(n)= n3 +106 n +2 prove that f(n)=ϴ(n3 )
11. Evaluate the following:
i. f(n)=100 n +5 prove that f(n)=Ω(n )
ii. f(n)= 6.2n + n2 prove that f(n)=ϴ(n3 )
12. Arrange the following growth functions in increasing order: 1, n log n, n3, n2, 2n, 4n, 3n, n! and nn.
13. Explain time complexity analysis of iterative algorithms with an example.
14. Write an algorithm to sort an array to sort an array using bubble sort and analyze
for time complexity and express using asymptotic notations.
15. Explain algorithm design techniques in detail.
16. Explain the algorithm design concept of Divide and Conquer with an example.
17. Design an algorithm to sort an array of n numbers in descending order using merge sort.
18. Partition the array {10, 2, 4, 14, 5, 6, 11, 15, 3, 20} using divide and conquer technique to
sort it using a quick sort method.
19. Compare linear and binary search algorithms with respect to their time complexities.
20. Explain the types of problems i) Searching ii) Sorting iii) Combinatorial problems iv)
Geometrical problems v) Probabilistic algorithms.
21. Define an algorithm. Explain the characteristics of an algorithm.
22. Explain the asymptotic notations with examples.
23. Explain advantages and disadvantages of divide and conquer method.
24. Solve the graph G-1 given below using single source shortest path (Dijkstra’s) method.
Source=b.
25. Apply Floyd’s algorithm to the given graph G-2 below.
26. Explain the general framework for analyzing the efficiency of algorithms.
27. What are the steps involved in finding the time efficiency of recursive algorithms?
Please explain with an example.
28. Write the algorithm for Bubble Sort and apply the same on the following set of numbers
to arrange them in ascending order: 87, 64, 59, 82, 34, 60.
29. What is Divide & Conquer technique? Explain with a neat diagram and an example.
30. Write the Warshall’s algorithm and find the Transitive Closure for the following graph in
neat steps:
31. What is an Algorithm? Please explain with the help of a neat diagram.
33.Evaluate the following:
2 2
f (n)=6 n + 4 n , prove that f (n)=O(n ), prove that f (n)=Ω(n)
3
f (n)=100 n +5 , prove that f (n)=Ω(n)
32. Explain the Quick Sort algorithm? .Partition the array{10,2,4,14,5,6,1,15,3,20}as per
quick sort technique.
33. Explain the Merge sort technique. Write an algorithm for the same.
