Scribd
Upload
20 views1 page

Algorithm Design and Analysis Assignment

This document outlines the first assignment for the Analysis and Design of Algorithms course at SKSVMA Charitable Trust for the academic year 2024-25. It includes various questions related to algorithm design, analysis, and efficiency calculations, with a total of 10 questions worth a maximum of 25 marks. The assignment covers topics such as asymptotic notations, recursive algorithms, search algorithms, sorting techniques, and algorithm design techniques.

Uploaded by

shruti.bhb18
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
20 views1 page

Algorithm Design and Analysis Assignment

This document outlines the first assignment for the Analysis and Design of Algorithms course at SKSVMA Charitable Trust for the academic year 2024-25. It includes various questions related to algorithm design, analysis, and efficiency calculations, with a total of 10 questions worth a maximum of 25 marks. The assignment covers topics such as asymptotic notations, recursive algorithms, search algorithms, sorting techniques, and algorithm design techniques.

Uploaded by

shruti.bhb18
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

SKSVMA Charitable Trust (Regd.

) CSE

Smt. hamaa &Sri lenkappx M Agadi (College of Engineering & Iechnology Assignment-1
SVMA
Lakshmeshwar 582116 Dist: Gadag 2024-25 (Even)
(Approved by AlCIE, New Delhi &Afiliatcd to VIU Belagavi, ISO 9001:2015 Certified)
FIRST ASSIGNMENT
Semester: IV Subject: Analysis and Design of Algorithms Sub. Code: BCS40|
Date: 1$-03-2025 Time: 1.5 hour Max. Marks :25
Question RBT
No Marks CO
Level
1. Explain the various steps in algorithm Design and Analysis process
with the flow diagram, 5 2 1

2. Give Formula and Informal definitions of asymptotic notations. 5 2 1

3. Explain the general plan of mathematical analysis ofrecursive algorithm


with an example. 1

4.
Developa linear search algorithm and calculate the best case, worst case
and average case efficiency in terms of order of growth. 3 1
5
Calculate and compare the order of growth of the following
a.
5
b. n÷ and 3 1
nco) and n
Make use of definitions of asymptoic notations to prove the following:
6.
3 1
then tiln)t taln) E O(max-icn) gen)})
7 Design an algorithm for tower of Hanoi problem and obtain its time
3 1
complexity.
Distinguish between Decrease and conquer and divide and conquer
8. algorithm design technique. Develop the insertion sort algorithm to sort 3 2
a list of integers and calculate its efficiency.
9. Write merge sort algorithm and sort the list E,X,A,M,P,L,E 3 2
Apply the DFS based algorithm tosolve the topologiçal sorting problem
for the flowing graph.

10. 3

Course Coordinatorsalas Module Coordinator HOD

You might also like