Scribd
Upload
657 views

DAA First-Internal Question Paper (2019) VI Sem

This document contains an exam for a design and analysis of algorithms course. It has two sections, with the first section containing 4 questions to be answered, and the second containing 2 of 4 additional questions to be answered. The questions cover topics like algorithm specification, asymptotic notation, greedy algorithms, best/worst/average case analysis of finding max/min elements, heapsort, weighted union and collapsing find algorithms, binary search, and solving a knapsack problem instance.

Uploaded by

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

DAA First-Internal Question Paper (2019) VI Sem

This document contains an exam for a design and analysis of algorithms course. It has two sections, with the first section containing 4 questions to be answered, and the second containing 2 of 4 additional questions to be answered. The questions cover topics like algorithm specification, asymptotic notation, greedy algorithms, best/worst/average case analysis of finding max/min elements, heapsort, weighted union and collapsing find algorithms, binary search, and solving a knapsack problem instance.

Uploaded by

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

Deccan College of Engineering and Technology

Darussalam, Nampally, Hyderabad Deccan College of Engineering and Technology


B.E III/IV (CSE A & B) VI Semester
Darussalam, Nampally, Hyderabad
Internal Examination-I (Feb-2019) B.E III/IV (CSE A & B) VI Semester
Design and Analysis of Algorithm Internal Examination-I (Feb-2019)
Section-A Design and Analysis of Algorithm
Answer all the questions (4*2=8M) Section-A

1. Explain about Algorithm specification. Answer all the questions (4*2=8M)


2. Explain asymptotic notation. 1. Explain about Algorithm specification.
3. What is greedy method? Explain with example. 2. Explain asymptotic notation.
4. Explain about Best, worst, Average case of finding maximum 3. What is greedy method? Explain with example.
and minimum element. 4. Explain about Best, worst, Average case of finding maximum

Section-B and minimum element.

Answer any two questions (2*6=12M) Section-B

5. Explain Heapsort with Algorithm. Answer any two questions (2*6=12M)


6. (a) What is weighted UNION and Collapsing FIND? 5. Explain Heapsort with Algorithm.
(b) solve the Recurrence relation T(n)=3T(n/2) + Kn, n>1 6. (a) What is weighted UNION and Collapsing FIND?
7. Explain Binary Search with Example. (b) solve the Recurrence relation T(n)=3T(n/2) + Kn, n>1
8. consider the following instance of knapsack problem where 7. Explain Binary Search with Example.
n=3,M=20,(P1,P2P3) = (25,24,15), & (W1,W2,W3) = (18,15,10). Find 8. consider the following instance of knapsack problem where
the optimal solution for (i) maximum profit (ii)minimum weight n=3,M=20,(P1,P2P3) = (25,24,15), & (W1,W2,W3) = (18,15,10). Find
(iii) maximum profit per unit weight. the optimal solution for (i) maximum profit (ii)minimum weight
*********** (iii) maximum profit per unit weight.
***********

You might also like