Scribd
Upload
25 views5 pages

DAA

The document outlines the B. Tech. Examination paper for Design & Analysis of Algorithms for the academic year 2021-22, consisting of multiple sections with various algorithm-related questions. It includes topics such as algorithm definitions, time complexities, sorting algorithms, and specific problems like the 0/1 knapsack and Travelling Salesman Problem. Students are required to attempt all questions and demonstrate their understanding of algorithm design and analysis techniques.

Uploaded by

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

DAA

The document outlines the B. Tech. Examination paper for Design & Analysis of Algorithms for the academic year 2021-22, consisting of multiple sections with various algorithm-related questions. It includes topics such as algorithm definitions, time complexities, sorting algorithms, and specific problems like the 0/1 knapsack and Travelling Salesman Problem. Students are required to attempt all questions and demonstrate their understanding of algorithm design and analysis techniques.

Uploaded by

vy4396498
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
You are on page 1/ 5
S.No. : 182 BCS 3602 No. of Printed Pages : 05 Following Paper ID and Roll No. to be filled in your Answer Book. Rol N B. Tech. Examination 2021-22 DESIGN & ANALYSIS OF ALGORITHMS Time : Three Hours] [Maximum Marks : 60 Note :— Attemptall questions. 1. Attempt all parts of the following : (a) (b) (c) (d) (e) (Even Semester) SECTION-A 8x1=8 What is an algorithm? Define. Describe in details about asymptotic notations. Write best, average and worst case time complexity of quick sort. What is the concept of randomized algorithm? Differentiate between backtracking and branch and bound methods. [P.T.0. BCS 3602 () (g) (h) 2. Attempt any two parts of the following : (a) (b) (c) 2 Differentiate between breath first search ang depth first search. Differentiate between divide and conquer and greedy approach of algorithm. What is naive string matching algorithm. SECTION-B 2x6=12 What is 0/1 knapsack problem? Solve the following instance using dynamic program- ming. Write the algorithm also. Knapsack capacity = 10, P = <1, 6, 18, 22, 28> and w=. Describe in detail the Strassen's matrix multiplication algorithm based on divide and conquer strategies with suitable example. Write the string matching Rabin Karp algorithm using Rabin Karp algorithm on given data find the substring : P= 26, T = 3141592653589793 andq= ll. 3 BCS 3602 (d) Examine the time complexity of the equations : @) T)=T(Yn)+0() (ii) T(n)=7 (4) +n} SECTION-C Note :— Attempt all questions. Attempt any two parts from each questions. 5x8=40 Using Boyer Moore algorithm on the following 3. (a) data : P=ababca T=abbabbbababcaaa Find the substring also write algorithm. (b) Explain the concept of N, NP & NP completeness. (c) What is Travelling Salesman Problem (TSP)? Show that TSP is NP problem. Explain at least one approach used to solve the problem. 4. (a) Find out minimum spanning tree using Kruskal algorithm for giving graph [P.T.0. BCS 3602 4 (b) Write Merge Bort algorithm and compute its best and worst case time complexity. Sort L, U, C,K,N, O, W in alphabatical order using merge sort. (c) Write short note on binomial heap. (a) Find all pair of shortest path using Floyd's w algorithm for the given graph : (b) Write quick sort algorithm and compute its best and worst case time compexity. Sort 7,9, 2, 3, 15, 1, 12, 30 in ascending order using quick sort. (c) Write short note on AVL Tree. 5 BCS 3602 Find single source shortest path using Dijkstra's algorithm from a tod: Discuss any two methods of amortized analysis in detail. Sort given array A= {27, 46, 11, 95, 67, 32, 78} using insertion sort algorithm. Also perform best case and worst case analysis of insertion sort algorithm. HES

You might also like