*0205* GUG/W/14-2359

F.Y. M.Tech. (Computer Science & Engineering)

Semester – II : MT-1006
Advances in Algorithms
P. Pages : 3
Time : Three Hours Max. Marks : 70
-----------------------------------------------------------------------------
Notes : 1. All questions carry equal marks.
2. Due credit will be given to neatness and
adequate dimensions.
3. Assume suitable data wherever
necessary.
4. Illustrate your answers wherever with the
help of neat sketches.
5. Solve any five questions out of eight
questions.

1. a) What are different methods of solving 8

recurrence? Use the master method to
give tight asymptotic bounds for the
following recurrence.
i) T(u)=4T(u/2) +n
ii) T(u)=4T(u/2)+n2
iii) T(u)=4T(u/2)+n3

b) What is Amortized Analysis? Explain 6

any two methods to perform Amortized
Analysis.

GUG/W/14-2359 1 P.T.O
 2. a) Show how to reconstruct an LCS from 7
the completed 'c' table and the original
sequences <1,0,0,1,0,1,0,1> and
<0,1,0,1,1,0,1,1,0>

b) Use Strassen's Algorithm to compute 7

1 4 6 3
the matrix product 
 6 8   9 5 

3. a) Implement Ford-Fulkerson algorithm on 7

the following graph. Also write the
algorithm.
12
V1 V3
16 20

10 4 T
S 7

9
13 4
V2 V4
14

b) What is Extended-Euclid algorithm? 7

Explain in Detail.

4. a) Explain string matching using finite 8

automata for pattern P = aabab and
text string T = aaababaabaababaab.

b) Write pseudo code to compute DFT-1 in 6

0(n log n) time.

GUG/W/14-2359 2
 5. a) Solve the following equation using LUP 8
decomposition
 2 3 5  x1  14 
4 5 6 x   12
   2  
8 9 7  x 3  16 

b) Explain and write algorithm for 6

simplified DES encryption scheme.
6. a) What is information retrieval? Explain 6
various techniques of information
retrieval.
b) How polynomial reduction can be used 8
for showing NP- completeness of a
problem? Explain in Detail.
7. a) Explain two types of Randomize 7
algorithm and compare them in brief.
b) Explain Dijkestra's algorithm single 7
source shortest path.
8. a) Write and Explain algorithm 7
Pseudoprime for primality testing.

b) Explain Topological sort procedure for 7

Directed Acyclic Graph (DAG).

*********

GUG/W/14-2359 3 214 / 50
P.T.O
GUG/W/14-2359 4