Design and Analysis of Algorithms PDF

EF FE9 9FC C58 85C CDA AAC C8A AF0 063D D07
F C
FE E9F CC 585 5CD DAA AC8 8AF F06 63D 07E E6E
9 C C 58 C A C A 0 3D 07 6 1D
9F FCC 585 5CD DA AC 8A F06 63D 07E E6E E1D 9E
A 8 F C
FC CC5 585C CD AA C8 AF 063 3D0 07E 6E1 1D9 9EC EF
C 8 A C A 0 D 7 6 E D E E E
CC 58 5C DA AC 8A F0 63D 07 E6E 1D 9E CE FE 9FC
58 5C DA AC 8A F06 63D 07 E6E 1D 9E CE FE 9FC C5
58 5C DA AC 8A F06 3D 07 E6E 1D 9E CE FE 9FC C5 85
D E 9
85 5CD AA AC8 8AF F063 3D0 07E 6E 1D9 9EC CEF FE9 FC C58 85C CDA
C A C A 0 6 D 7 6 E 1 D E E E F C
5C DA AC 8A F0 3D 07 E6 1 9E CE FE 9F CC 585 5CD DAA AC
D A 8 F 3 0 E 6 E D 9 C F 9 C 5 8 C A C 8A
DA AA C8A AF0 063 D0 7E6 6E1 1D9 EC EFE E9F FCC C58 5CD DA AC 8A F06
C A 8 F
tn =
D 7 E D E E C 5 5
}
{
AA AC8 8AF F06 63D 07E E6E 1D 9EC CEF FE9 9FC C5 85C CDA AA C8A AF0 063 3D0
3 0 6 1 9 F C 8
C8 AF 06 D0 7E E D EC EF E9 C 5 5C DA AC 8A F0 63 D07 7E6 C
AF 06 3D 7E 6E 1D 9EC EF E9 FC C5 85C DA A 8A F0 63 D0 E6 E1
06 3D 07E 6E 1D 9EC EF E9 FC C5 85C DA A C8A F0 63 D0 7E6 E1 D9
n
3D 07 6E 1D 9E E E FC C5 85 D A C8 F 63 D0 7E E D9 EC
07 E6E 1D 9E CE FE 9FC C 85 CD AA C8 AF 06 D0 7E 6E 1D EC EF
necessary.
int a,b,c,d,i.
E6 1 9 C FE 9F C 58 CD A C A 06 3D 7E 6E 1D 9E E E9
E1 D9 EC EF 9F CC 58 5C A AC 8A F0 3D 07 6E 1D 9E CE FE FC
D9 EC EF E9 C 58 5C DA AC 8A F0 63D 07 E6 1D 9E CE FE 9F C
d= c+a;
Date:- 14/05/2019
}
{
EC EF E9 FC C58 5C DA AC 8A F0 63D 07 E6 E1 9E CE FE 9F CC 585
EF E9 FC C58 5C DA AC 8A F0 63D 07 E6 E1 D9E CE FE 9F CC 585 CD
substitution method.
E9 FC C5 5C DA A 8A F0 63 0 E6 E1 D9 C FE 9F CC 58 CD A
FC C5 85C D A C8 F 63 D0 7E E1 D9 EC EF 9F CC 58 5C A AC
runtime of algorithm?
C5 85 D AA C8 AF 063 D0 7E 6E1 D9 EC EF E9 CC 58 5C DA AC 8A
85 CD AA C8 AF 063 D0 7E 6E D9 EC EF E9 FC 58 5C DA AC 8A F0
a = a+b;
CD AA C A 06 D 7E 6E 1D E E E9 FC C5 5C D A 8 F 63
Instructions to the Students

AA C8 8AF F06 3D 07E 6E 1D 9EC CEF FE9 FC C5 85C DA AA C8A AF0 063 D0
C8 AF 06 3D0 07E 6E 1D 9EC EF E9 FC C5 85C DA AC C8A F0 63 D07 7E6
for (i = 0 ;i<=11; i++)

t n-1 + t n-2 , otherwise

if n=0 or n=1
Branch: Computer Engineering
1. Each Question carries 12 marks.
T(n) = 2T (n/2) + cn
undefined
assume it and should mention it clearly.

Marks: 60
2. Attempt Any Five Questions of the following.
07 E6E 1D 9E CE FE 9FC C 85 CD AA C8 AF 06 D0 7E 6E 1D EC EF Q.1. Attempt Any Three from the following questions.
3D07E6E1D9ECEFE9FCC585CDAAC8AF06
Semester Examination – Summer - 2019
UNIVERSITY LONERE – RAIGAD -402 103
3. Illustrate your answers with neat sketches, diagram etc., wherever
c) Solve the following recurrence relation using characteristic polynomial.

06 3D 07E 6E 1D 9EC EF E9 FC C5 85C DA A C8A F0 63 D0 7E6 E1
DR. BABASAHEB AMBEDKAR TECHNOLOGICAL
3D 07 6E 1D 9E E E FC C5 85 D A C8 F 63 D0 7E E D
a) Define Big O notation? What is total time complexity of following code ?
d) Solve the following recurrence using master method. Verify solution using
07 E6E 1D 9E CE FE 9FC C 85 CD AA C8 AF 06 D0 7E 6E 1D
E6 1 9 C FE 9F C 58 CD A C A 06 3D 7E 6E 1D 9
E1 D9 EC EF 9F CC 58 5C A AC 8A F0 3D 07 6E 1D 9E
Time:- 3 Hrs.
D9 EC EF E9 C 58 5C DA AC 8A F0 63D 07 E6 1D 9E
(04*03=12)
Sem.:- IV
4. If some part or parameter is noticed to be missing, you may appropriately

======================================================
EC EF E9 FC C58 5C DA AC 8A F0 63D 07 E6 E1 9E CE
Subject and Subject Code:- Design and Analysis of Algorithms (BTCOC401)
b) Define algorithm. What is the need of algorithm analysis ? Which factors affect
---------------------------------------------------------------------------------------------
______________________________________________________________
EF E9 FC C58 5C DA AC 8A F0 63D 07 E6 E1 D9E CE

E9 FC C5 5C DA A 8A F0 63 0 E6 E1 D9 C F
FC C5 85C D A C8 F 63 D0 7E E1 D9 EC EF
C5 85 D AA C8 AF 063 D0 7E 6E1 D9 EC EF E
85 CD AA C8 AF 063 D0 7E 6E D9 EC EF E9
CD AA C A 06 D 7E 6E 1D E E E9 F
AA C8 8AF F06 3D 07E 6E 1D 9EC CEF FE9 FC
C8 AF 06 3D0 07E 6E 1D 9EC EF E9 FC
AF 06 3D 7E 6E 1D 9EC EF E9 FC C
06 3D 07E 6E 1D 9EC EF E9 FC C5
3D 07 6 1D 9E E E F C 8
F C
9 C C 58 C A C A 0 3D 07 6 1D
A 8 F C
C 8 A C A 0 D 7 6 E D E E E
D E 9
C A C A 0 6 D 7 6 E 1 D E E E F C
D A 8 F 3 0 E 6 E D 9 C F 9 C 5 8 C A C 8A
C D 7 E D E E C 5 5 A 8 F
3 0 6 1 9 F C 8
algorithm.
Matrix A = 1
Frequency 45
Matrix A = 1
3
using Merge Sort.
2
A={5
2
13 12
Characters A1 A2 A3
2

Q.3. Solve the following questions
16
Q.4. Solve the following questions:

frequencies using Greedy method.
Q.2.Attempt the following questions
Note that vertex z is source vertex.

4
9
Matrix B=

Matrix B=
7
5
undefined
“a” “b” “c” “d” “e” “f”

A4 A5 A6
5
5

1
6
6
3
8
X = < A, B, C, B, D, A, B > Y = < B, D, C, A, B, A >

a) What is Greedy method? Explain elements of Greedy method.
2
for X and Y. What is the length of longest common subsequence?

6}
b)Multiply following two matrices using Strassen’s matrix multiplication
b) Construct an optimal instance of Huffman Code for the following set of

b) Find the shortest path using Bellman Ford algorithm for the following graph.
a) Write an algorithm of merge sort and illustrate the operation on an array
(06*02=12)
(06*02=12)
(06*02=12)

E9 FC C5 5C DA A 8A F0 63 0 E6 E1 D9 C F a) Determine longest common subsequence using dynamic programming approach
06 3D 07E 6E 1D 9EC EF E9 FC C5
3D 07 6 1D 9E E E F C 8
F C
9 C C 58 C A C A 0 3D 07 6 1D
A 8 F C
C 8 A C A 0 D 7 6 E D E E E
D E 9
C A C A 0 6 D 7 6 E 1 D E E E F C
D A 8 F 3 0 E 6 E D 9 C F 9 C 5 8 C A C 8A
C D 7 E D E E C 5 5 A 8 F
3 0 6 1 9 F C 8
Black tree?
help of state space tree.

Q.5. Solve the following questions
9
5
1
Q.6. Attempt any three Questions:

13
6
2
14
10
a) Solve the following 15-Puzzle Problem.

undefined
7
3
15
8
4
11
12
d) Explain Polynomial time reduction with example.

**********************
configuration of B-Tree after each insertion operation.

a) Explain Class P, Class NP and Class NPC problems in detail.

Keys: F S Q K C L H T V W M R N P A B X Y D Z E
c) What do you mean by Red Black Tree?. What are the characteristics of Red
b) How 4- Queens problem is solved by backtracking approach? Explain with the
(06*02=12)
b) Insert the following keys into empty B-Tree with minimum degree 2. Show the
(04*03=12)

E9 FC C5 5C DA A 8A F0 63 0 E6 E1 D9 C F
06 3D 07E 6E 1D 9EC EF E9 FC C5
3D 07 6 1D 9E E E F C 8

Design and Analysis of Algorithms PDF

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Design and Analysis of Algorithms PDF

Uploaded by

Copyright:

Available Formats

EF FE9 9FC C58 85C CDA AAC C8A AF0 063D D07

Instructions to the Students

for (i = 0 ;i<=11; i++)

t n-1 + t n-2 , otherwise

assume it and should mention it clearly.

c) Solve the following recurrence relation using characteristic polynomial.

4. If some part or parameter is noticed to be missing, you may appropriately

EF E9 FC C58 5C DA AC 8A F0 63D 07 E6 E1 D9E CE

06 3D 07E 6E 1D 9EC EF E9 FC C5 85C DA A C8A F0 63 D0 7E6 E1 D9

Q.3. Solve the following questions

Q.4. Solve the following questions:

Note that vertex z is source vertex.

EF E9 FC C58 5C DA AC 8A F0 63D 07 E6 E1 D9E CE FE 9F CC 585 CD

“a” “b” “c” “d” “e” “f”

C8 AF 06 3D0 07E 6E 1D 9EC EF E9 FC C5 85C DA AC C8A F0 63 D07 7E6

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

for X and Y. What is the length of longest common subsequence?

b) Construct an optimal instance of Huffman Code for the following set of

06 3D 07E 6E 1D 9EC EF E9 FC C5 85C DA A C8A F0 63 D0 7E6 E1

EF E9 FC C58 5C DA AC 8A F0 63D 07 E6 E1 D9E CE

help of state space tree.

Q.6. Attempt any three Questions:

EF E9 FC C58 5C DA AC 8A F0 63D 07 E6 E1 D9E CE FE 9F CC 585 CD

d) Explain Polynomial time reduction with example.

configuration of B-Tree after each insertion operation.

a) Explain Class P, Class NP and Class NPC problems in detail.

EF E9 FC C58 5C DA AC 8A F0 63D 07 E6 E1 D9E CE

You might also like