Download AKTU B-Tech 5th Sem 2017-2018 NCS501 Design And Analysis Of Algorithms Question Paper

FirstRanker's choice FirstRanker.com

Printed pages: 01                                               Sub Code: NCS501

Paper Id: 1036                                               Roll No:

--- Content provided by FirstRanker.com ---

B TECH

(SEM V) THEORY EXAMINATION 2017-18

DESIGN AND ANALYSIS OF ALGORITHMS

Time: 3 Hours                                               Total Marks: 100

Notes: Attempt all Sections. Assume any missing data.

--- Content provided by FirstRanker.com ---

SECTION-A

1. Define/Explain the following: (2*10=20)

1. Difference between Complete Binary Tree and Binary Tree?
2. Difference between Greedy Technique and Dynamic programming.
3. Solve the following recurrence using Master method:
   

   --- Content provided by FirstRanker.com ---

   T (n) = 4T (n/3) + n²
4. Name the sorting algorithm that is most practically used and also write its Time Complexity.
5. Find the time complexity of the recurrence relation
   T(n)= n +T(n/10)+T(7n/5)
6. Explain Single source shortest path.

--- Content provided by FirstRanker.com ---

7. Define Graph Coloring.
8. Compare Time Complexity with Space Complexity.
9. What are the characteristics of the algorithm?
10. Differentiate between Backtracking and Branch and Bound Techniques.

SECTION-B

--- Content provided by FirstRanker.com ---

2. Attempt any three of the following: (10×3=30)

1. Solve the following By Recursion Tree Method
   T(n)=n+T(n/5)+T(4n/5)
2. Insert the following information F,S,Q,K,C,L,H,T,V,W,M,R,N,P,A,B,X,Y,D,Z,E,G,I.
   Into an empty B-tree with degree t=3.

--- Content provided by FirstRanker.com ---

3. What is Minimum Cost Spanning Tree? Explain Kruskal's Algorithm and Find MST
   of the Graph. Also write its Time-Complexity
   

   This download link is referred from the post: AKTU B-Tech Last 10 Years 2010-2020 Previous Question Papers || Dr. A.P.J. Abdul Kalam Technical University