Scribd
Upload
5 views

DAA 2

This document is an examination paper for the First Year M.Sc. Computer Science course, specifically for the Design and Analysis of Algorithms subject. It consists of six questions, with various sub-questions covering topics such as time complexity, sorting algorithms, graph algorithms, and dynamic programming. The exam allows the use of a non-programmable scientific calculator and requires neat diagrams where necessary.

Uploaded by

Yash Sonawane
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
5 views

DAA 2

This document is an examination paper for the First Year M.Sc. Computer Science course, specifically for the Design and Analysis of Algorithms subject. It consists of six questions, with various sub-questions covering topics such as time complexity, sorting algorithms, graph algorithms, and dynamic programming. The exam allows the use of a non-programmable scientific calculator and requires neat diagrams where necessary.

Uploaded by

Yash Sonawane
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

Total No. of Questions : 6] SEAT No.

:
PB3026 [Total No. of Pages : 3
[6255]-201
First Year M.Sc.
COMPUTER SCIENCE
CS-551 - MJ : Design and Analysis of Algorithms
(2023 Credit Pattern) (Semester - II)
Time : 3 Hours] [Max. Marks : 70
Instructions to the candidates:
1) All questions are compulsory.
2) Neat diagrams must be drawn wherever necessary.
3) Use of single memory non programmable scientific calculator is allowed.
Q1) Solve any five of the following. [5×2=10]
a) Define time complexity. List asymptotic notations.
b) Merge sort is in place algorithms. Justify.
c) Consider 4 programs with the length 14, 5, 20, 8, 3 respectively are to be
stored on a computer tape. Find MRT using greedy method.
d) What is negative weighted cycle? Does Flyod Warshall algorithm consider
the negative weighted cycle?
e) What do you mean by branch and bound? Where this technique might be
useful.
f) Define P & NP class problem.

Q2) Attempt any two questions. [2×6=12]


a) What is Divide & Conquer strategy? Explain Binary Search algorithm
and State worst time complexity.
b) Find optimal solution using Knapsack instances n = 7 m = 15
(P1, P2, P3, P4, P5, P6, P7) - (10, 5, 15, 7, 6, 18, 3)
(W1, W2, W3, W4, W5, W6, W7) = (2, 3, 5, 7, 1, 4, 1) (Use Greedy method)
c) Apply the Flyod Warshall algorithm to find length of shortest paths.

P.T.O.
Q3) Attempt any two questions. [2×6=12]
a) Apply the Merge Sort to sort the following numbers. Derive its Time
complexity.
26, 5, 37, 1, 61, 11, 59, 15, 48, 19.
b) What is the best way to multiply a chain of matrices A1, A2, A3, A4 with
dimensions 15×5, 5×10, 10×20, 20×25 respectively using Dynamic
Programming?
c) Find shortest path for all vertices by using Dijkstra’s Algorithm.

Q4) Attempt any two questions. [2×6=12]


a) Define DFS & BFS. Illustrate on the following Graph.
(Start Vertex - 1)

b) Find all possible Hamiltonian Cycles for the following Graph.

c) What is longest common subsequence problem. Find the LCS of X & Y


X = < A, B, C, B, D, A, B > and Y = < B, D, C, A, B, A>

[6255]-201 2
Q5) Attempt any two questions. [2×6=12]
a) What is m-colouring problem? Find all possible solutions when the
following graph is coloured with exactly 3 colours.

b) Solve the following instance of TSP using Dynamic Programming Method


for following matrix.

  10 8 14 
 22  7 6 
A= 
 9 10  4 
 
 5 6 2 
c) Find the minimum spanning tree for the following graph using Kruskal’s
Algorithm.

Q6) Attempt any Three questions. [3×4=12]


a) What is Huffman code? Obtain the set of optimal Huffman codes for the
messages with frequencies 6, 7, 9, 10, 12, 14, 22
b) Define : Tree edge, Back Edge, Forward Edge, Cross Edge.
c) Write non deterministic algorithm to sort set of ‘n’ positive integers.
d) Explain string editing problem and write its recurrence realtion.



[6255]-201 3

You might also like