0
1.5kviews
Analysis Of Algorithms Question Paper - Dec 18 - Computer Engineering (Semester 4) - Mumbai University (MU)
1 Answer
0
11views

Analysis Of Algorithms - Dec 18

Computer Engineering (Semester 4)

Total marks: 80
Total time: 3 Hours
INSTRUCTIONS
(1) Question 1 is compulsory.
(2) Attempt any three from the remaining questions.

Q1) Answer Following Question (Any Four)

(a) What is the backtracking Approach. Explain how it is used in graph coloring.
(5 marks) 00

(b) Explain Randomized algorithm with example.
(5 marks) 00

(c) What is knhuth Morris Pratt Matching? Give Examples.
(5 marks) 00

(d) Explain in brief the concept of Multistage Graphs?
(5 marks) 00

(e) Merge sort and its complexity.
(5 marks) 00

Q2)

a) Derive and comment on the complexity of quick sort algorithm.
(10 marks) 00

b) Solve following knapsack using dynamic approach.
(10 marks) 00

Q3)

a) What is sum of subset problem? Write the Algorithm and solve following.

array A = [2,3,5,6,7,8,9] and K=15

(10 marks) 00

b) Write the algorithm for finding strasens matrix multiplication and show the complexity is being affected?
(10 marks) 00

Q4)

a) What is Longest common subsequence Problem? Find LCS for following

string x = ACBAED

string y = ABCABE

(10 marks) 00

b) Explain Binary Search Tree? How to generate an optimal binary search tree.
(10 marks) 00

Please log in to add an answer.