Scribd
Upload
21 views3 pages

Daa Questions

The document contains a list of important questions for the Design & Analysis of Algorithms course at Meerut Institute of Engineering and Technology for the Odd Semester 2023-24. It includes questions categorized by course outcomes, covering topics such as sorting algorithms, data structures, graph algorithms, and string matching algorithms. Each question is associated with specific marks and references to previous academic years.

Uploaded by

dixirek277
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
21 views3 pages

Daa Questions

The document contains a list of important questions for the Design & Analysis of Algorithms course at Meerut Institute of Engineering and Technology for the Odd Semester 2023-24. It includes questions categorized by course outcomes, covering topics such as sorting algorithms, data structures, graph algorithms, and string matching algorithms. Each question is associated with specific marks and references to previous academic years.

Uploaded by

dixirek277
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
You are on page 1/ 3

Meerut Institute of Engineering and Technology, Meerut

Department of Computer Science & Engineering-AI and AIML


Important Questions-[5 per CO/Unit]-Odd Semester 2023-24
Subject Name : Design &
Analysis of Algorithm[KCS- Faculty Name: Kunwar Babar Ali Year/Sem: III/V
503]
Course Year and Sem
S. No. Q. No. Questions Marks
Outcome (Odd / Even)
1 1 Explain the concepts of quick sort method and analyze its its complexity with suitable example. AKTU 2021-22 2
2 2 What are the fundamental steps involved in algorithmic problem solving. AKTU 2018-19 2
3 3 Write an algorithm for merge sort. Also explain the complexity of the algorithm. AKTU 2019-20 10
4 4 Write an algorithm for quick sort. Also explain the complexity of the algorithm with example AKTU 2019-20 10
CO1 Solve the following recurrence relation:
5 5 i. T (n) = T (n-1) + n4 AKTU 2021-22 10
ii. T (n) = T (n/4) + T (n/2) + n2
Can the Master method be applied to solve recurrence
6 6 AKTU 2019-20 5
T(n) =4T(n/2) +n2 log n? Why or why not?
Discuss the various cases for insertion of key in red-black tree for given sequence of key in an
7 1 AKTU 2021-22 10
empty red black tree-{15,13,12,16,19,23,5,8}
Insert the following elements in an intially empty RB tree. 12,9,81,76,23,43,65,88,76,32,54.Now
8 2 AKTU 2019-20 7
Delete 23and 81
Using minimum degree 't' as 3,insert following sequence of integers
9 3 10,25,20,35,30,55,40,45,50,55,60,75,70,65,80,85 and 90 in sn initially empty B-tree.Give the AKTU 2019-20 7
CO2 number of nodes splitting operations that take place.
What is Binomial Heap?Write down the algorihtm for Decrease key operation in Binomial Heap
10 4 AKTU 2021-22 7
Also Write its time complexity
11 5 Explain the algorithm to delete a given element in a binomial heap.Give an example for the same. AKTU 2019-20 7

12 6 What is Skip List?Explain the Search operation in Skip list with Example.Also write its algorithm. AKTU 2021-22 10
Show all the steps of Stressen's Matrix Multiplication algorithm to multiply the following matrics
:
13 1 AKTU 2015-16 10

Explain Convex –Hull problem.


14 2 AKTU 2017-18 10

Find optimal solution to the Fractional Knapsack instances n=7 and Knapsack capacity M=15
15 3 where profits and weights are as follows (P1, P2, ...,P7) =(10,5,15,7,6,18,3) and (W1,W2,...,W7) AKTU 2015-16 10
= (2, 3, 5, 7, 1, 4, 1) respectively.
Apply the greedy single source shortest path algorithm on the following grapgh:

16 4 AKTU 2018-19 10
CO3
What is Minimum Cost Spanning Tree? Explain Kruskal's Algorithm and Find MST of the
graph. Also write its time complexity.

17 5 AKTU 2017-18 10

Define Floyd Warshal algorithm for all pair sortest path and applying the same on following
graph. Also write the complexity of the algorithm

18 6 AKTU 2019-20 7

Solve the following 0/1 Knapsack problem using dynamic programming. P= [11,21,31,33], w=
19 7 AKTU 2019-20 7
[2,11,22,15], C= 40. n=4.
When do Dijkstra and the Bellman-Ford algorithm both fail to find a shortest path?Can Bellman
ford detect all negative weight cycles in a graph?Apply Bellman Ford Algorithm on the following
graph:

20 8 AKTU 2018-19 7

Explain the method of finding Hamiltonian cycles in a graph using backtracking method with
21 1 AKTU 2021-22 10
suitable example.
What is sum of subset problem? Draw a state space tree for sum of subset problem using
22 2 AKTU 2020-21 10
backtracking? Let n = 6, m = 30 and w [1:6] = { 5, 10, 12, 13, 15, 18}.
23 3 What is N queens problem? Draw a state space tree for 4 queens problem using backtracking. AKTU 2021-22 10
24 4 Differentiate between Backtracking and Branch and Bound Techniques. AKTU 2019-18 2
What is travelling salesman problem (TSP)? Find the solution of following TSP using Branch &
CO4
Bound method.

AKTU 2020-21
25 5 10
AKTU 2021-22

AKTU 2019-20
26 1 AKTU 2021-22 7
Define NP-Hard and NP- complete problems. What are the steps involved in providing a problem
AKTU 2018-19
NP-Complete? Specify the problems already proved to be NP-complete.
Write Rabin Karp string matching algorithm. Working modulo q=11, how many spurious hits
27 2 does the Rabin karp matcher in the text T= 3141592653589793, when looking for the pattern AKTU 2021-22 10
P=26.

CO5 AKTU 2019-20


28 3 Describe in detail Knuth-Morris-Pratt string matching algorithm. Compute the prefix function π 7
AKTU 2021-22
for the pattern ababbabbabbababbabb when the alphabet is ∑ ={a,b}.
Compute the prefix function π for the pattern P= a b a c a b using KNUTHMORRIS–PRATT
29 4 AKTU 2017-18 10
Algorithm. Also explain Naïve String Matching algorithm.
30 5 Write an algorithm for naive string matcher? AKTU 2020-21 7
What is an approximation algorithm ? What is meant by P (n) approximation algorithms ? AKTU 2019-20
31 6 7
Discuss approximation algorithm for Travelling Salesman Problm. AKTU 2018-19
32 7 Write and explain the algorithm to solve vertex cover problem using approximation algorithm. AKTU 2021-22 10

You might also like