Scribd
Upload
2 views1 page

Design and Analysis of Algorithms Assignment

Uploaded by

Surabhi Gosavi
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
2 views1 page

Design and Analysis of Algorithms Assignment

Uploaded by

Surabhi Gosavi
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

Kalyani Charitable Trust’s

Late G. N. Sapkal College of Engineering


Kalyani Hills, Anjaneri, Trimbakeshwar Road,
Nashik – 422 213

ACAD-R-34 Academic Year: 2025-26


Rev.: 00 Assignment No.-1 Semester: VII
Date: 05-07-2025

Department of Computer Engineering


Course name & code: Design and Analysis of Algorithms (410241) (2019 course)

Semester: V, A.Y.: 2025-26 Class: B.E. Computer Div.: -

Syllabus: Unit- 1 and Unit- 2

Q. No. Question BL CO PO
Why correctness of the algorithm is important? Define loop
1, 2, 3,
1. invariant property and prove the correctness of finding
1,2 1,3 12
summation of n numbers using loop invariant property.
What is iterative algorithm? Explain interactive algorithm design 1, 2, 3,
2. issues using example. 1,2 1,3 12

What is NP-complete class problem? How would you prove 1, 2, 3,


3. 1,2 2
vertex cover problem is NP-complete class problem? 12
What is Best, Average and Worst case Analysis of Algorithms?
4. Analyse the following algorithm Best, Average and Worst case
int Linear-search(int a, int n, int item) {
int i; 1, 2, 3,
1,2,3
for (i = 0; i < n; i++) { 2 12
if (a[i] = = item) {
return a[i] }
} return - 1

You might also like