Scribd
Upload
123 views2 pages

QB-1 ADA Module 1 4th Sem Vtu

This document is a question bank for the subject 'Analysis and Design of Algorithms' for the academic year 2024-25. It includes various questions covering topics such as algorithm definitions, analysis frameworks, Euclid's algorithm, efficiency analysis, asymptotic notations, recursive algorithms, and specific algorithm designs. The questions are structured to assess understanding of algorithm properties, efficiency, and design principles.

Uploaded by

vibhagowdaj20
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
123 views2 pages

QB-1 ADA Module 1 4th Sem Vtu

This document is a question bank for the subject 'Analysis and Design of Algorithms' for the academic year 2024-25. It includes various questions covering topics such as algorithm definitions, analysis frameworks, Euclid's algorithm, efficiency analysis, asymptotic notations, recursive algorithms, and specific algorithm designs. The questions are structured to assess understanding of algorithm properties, efficiency, and design principles.

Uploaded by

vibhagowdaj20
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Subject Name : Analysis and design of Algorithm

Subject Code : BCS401


Semester: IV Question Bank: 1
Faculty: Anoop N Prasad
AcademicYear 2024-25(Even)
Q.No Question marks

1 Define an algorithm? What are the properties of an algorithm? Briefly discuss the algorithm 8
specification
2 Draw a Analysis framework and explain all its dimensions(6 dimensions) 4

3 Design Euclid’s algorithm for computing GCD(m,n).Find GCD(60,24) using Euclid’s algorithm

Discuss the notion of algorithm and elaborate with an example how a new variable count 4+4
4 introduced in a program can be used to find the number of steps needed by a program to solve a
particular problem instance
5 Design an algorithm to search an element in an array using sequential search. discus the worst
case, best case and average case efficiency of this algorithm
6 10
Elaborate the general plan for analyzing efficiency of non-recursive algorithms.
7 List and Define the commonly encountered asymptotic notations and illustrate with figures(3 10
notations)
a)Prove the theorem of asymptotic notations: If t1(n)Є O(g1(n)) and t2(n)Є O(g2(n)) then prove 10
the following assertion t1(n) + t2(n) Є O(max(g1(n)), (g2(n)))
8 b)Express the following using asymptotic notations.
(i)6*2n+ n2 (ii) ½ n(n-1)
9 Write an algorithm to compute n! Recursively. Set up a recurrence relation for the algorithm’s 8
basic count and solve it.
10 Give the general plan for analyzing the recursive algorithms. Mathematically analyze the tower of 10
Hanoi problem, clearly indicating the steps and comment on its complexity
11 -
Find the time efficiency for computing product of n x n matrices with an algorithm

12 Develop an algorithm to determine the minimum and maximum values in an array of integers. 7
Determine the worst case complexity
13 Suggest an algorithm and explain its working to find whether the elements in an array are distinct. 6+4
Analyze it’s efficiency
List the following functions according to their order of growth from lowest to the highest. State proper
14 reasons.
(n-2)! , 5log(n+100)10 ,22n , 0.001n4 + 3n3+1, 3n
Consider the following algorithm 10
Algorithm GUESS(A[ ][ ])
for i:=0 to n-1 do
15 for j:=0 to i do
A[i][j]:=0;
(i) What does the algorithm compute?
(ii) Mention its basic operation?
1
(iii) How many times the basic operation is executed?
(iv) What is the efficiency class of this algorithm?
(v)Can this algorithm be further imported?
Consider the following algorithm 10
Algorithm Mystery(n)
//input: A non-negative integer n
S:=0;
for i:=1 to n do
16 S:=S+(i*i)
return S;
(i) What does the algorithm compute?
(ii) Mention its basic operation?
(iii) How many time the basic operation is executed?
(iv) What is the efficiency class of this algorithm?
(v)Can this algorithm be further imported?
Design a recursive algorithm to computing 2 for a non-negative integer n, based on the formula 2n 10
17 = 2n-1 + 2n-1 . Set up a recurrence relation for the number of additions made by the algorithm and
solve it. For n=5, draw a tree of recursive calls for this algorithm and count the number of calls.

You might also like