||JAI SRI GURUDEV||
Sri AdichunchanagiriShikshana Trust ®
SJB INSTITUTE OF TECHNOLOGY
(Affiliated to VTU, Approved by AICTE - New Delhi, Accredited by NAAC with “A” Grade)
No. 67, BGS Health & Education City, Dr. Vishnuvardhan Road, Kengeri, Bengaluru - 560 060
Department of Computer Science &Engineering
Module 1
Question Bank
Course Name : Design and Analysis of Algorithms
Course Code : 23CST402
Faculty Name : Dr. Krishna A N, Prof. & Head.
Dr. Arun Kumar D R, Asst. Prof
Mrs. Anusha M, Asst.Prof
Design and Analysis of Algorithm
MODULE 1
1. Define an algorithm. Explain the characteristics of an algorithm. [Aug/Sept-2020, Jan/
Feb 2021, Feb/ Mar 2022, July/August 2022, June/July 2023]
2. What are Asymptotic notations? List and describe the various asymptotic notations with an
example of each. [Dec.2019/Jan 2020, June/July-2019, Aug/Sept-2020, July/August
2022, June/July 2023, Dec 2023/Jan 2024]
3. Explain the general plan of mathematical analysis of non-recursive algorithm with an
example. [Aug/Sept-2020, Jan/ Feb 2021, Jan/Feb 2023, Dec 2023/Jan 2024]
4. What is the best case, worst case and average case efficiencies of sequential search?
[Aug/Sept-2020, June/July-2019, Feb/ Mar 2022, July/August 2022, Dec 2023/Jan
2024 ]
5. Illustrate mathematical analysis of recursive algorithm for Towers of Hanoi Problem.
[June/July-2019, Dec.2019/Jan 2020, Aug/Sept-2020, Jan/ Feb 2021, July/August 2022,
June/July 2023, Dec 2023/Jan 2024]
6. Discuss the important problem types and fundamentals of data structures. [Aug/Sept-2020,
Jan/ Feb 2021]
7. Give general plan for analyzing time efficiency of non recursive algorithms. Derive the
worst case analysis for algorithm to check whether all the elements in a given array are
distinct. [June/July-2019, July/August 2022, Jan/Feb 2023]
8. Explain the following types of problems: [June/July-2019, Jan/ Feb 2021, July/August
2022, June/July 2023]
i. Combinatorial problems.
ii. Sequencing
iii. Sorting
iv. Graph problems.
9. Outline an algorithm to find maximum of n elements and obtain its time complexity.
[Dec.2019/Jan 2020, July/August 2022, Jan/Feb 2023]
10. Prove the theorem. If f1(n) ∈ 0(g1(n)) and f2(n) ∈ 0 (g2(n)) Then f1(n)+f2(n) ∈ 0 (max
{g1(n),g2(n)}). [Dec.2019/Jan 2020, Feb/ Mar 2022, Jan/Feb 2023]
11. ALGORITHM Enigma (A[0..n − 1, 0..n − 1]) [Dec.2019/Jan 2020]
Dept. of CSE, SJBIT Page 1
Design and Analysis of Algorithm
for i ←0 to n − 2 do
for j ←i + 1 to n − 1 do
if A[i, j ]≠ A[j, i]
return false
end for
end for
return true
end algorithm
i) What does this algorithm compute?
ii) What is its input size?
iii) What is its basic operation?
iv) How many times is the basic operation executed?
v) What is the efficiency class of this algorithm?
12. The factorial function n! has value 1 when n<=1 and value n*(n-1)! When n>1. Write both
a recursive and an iterative algorithm to compute n! [Feb/ Mar 2022]
13. List the following functions according to their order of growth from the lowest to the
highest. State proper reasons, (n-2)!, 5log(n+100)10 , 22n ,0.001n4 + 3n3 + 1 , 1n2n, ∛n , 3n.
[Feb/ Mar 2022]
14. Write an algorithm to find the sum of first and last digit of a given number. [June/July
2023]
15. Define program basic operation. Write an algorithm to find the sum of n numbers, also find
the program step count for the above algorithm using step count method. [Jan/ Feb 2021,
June/July 2023]
16. Explain the notion of algorithm. Design Euclid’s algorithm for computing GCD (m,n). Find
GCD (60, 24) using Euclid’s algorithm. [Jan/Feb 2023]
17. Explain any four important problem types. [Jan/Feb 2023]
18. Define Space complexity and time complexity of an algorithm and compute the time
complexity of Fibonacci Numbers algorithm. [July/August 2022]
19. Discuss the various steps in algorithm design and analysis process with the flow diagram.
What are the criteria satisfied by any algorithm. [Dec 2023/Jan 2024]
20. Write an algorithm to sort n numbers using selection sort method. [Dec 2023/Jan 2024]
Dept. of CSE, SJBIT Page 2
Design and Analysis of Algorithm
Dept. of CSE, SJBIT Page 3
