First assignments Questions

1. Explain the various asymptotic notations with related graphs and suitable examples
2. Using recursion tree method to determine a good asymptotic upper bound on the
recurrence relation T(n) = 2T(n/2) + n2
3. State the master method and , solve the following recurrence relation using master
theorem: T(n) = 2T(n/2) + n
4. Define amortized analysis? Explain the accounting method in amortized analysis.
5. Explain the aggregate analysis technique used in amortized analysis using multipop
stack and binary counter problems.
6. Write the complete bellman ford algorithm with initialize. Trace it for the below
graph Bellman ford algorithm

7. Describe how to find bipartite matching for a given graph considering suitable
examples.
8. Write Johson’s algorithm for finding the all pair shortest path problem
 First Internal Questions
Answer any 3 questions 10 Marks * 3 = 30 Marks

Module 1

1. Explain the various asymptotic notations with related graphs and suitable examples
2. Using recursion tree method to determine a good asymptotic upper bound on the
recurrence relation T(n) = 2T(n/2) + n2
3. Explain the aggregate analysis technique used in amortized analysis using multipop
stack and binary counter problems.

Module 2

4. Write the complete bellman ford algorithm with initialize. Trace it for the below
graph Bellman ford algorithm

5. a) Describe how to find bipartite matching for a given graph considering suitable
examples.
b) Write Johsons algorithm for finding the all pair shortest path problem
 Second assignments Questions
1. Give Ford- Fulkerson algorithm for solving the maximum flow problem . Apply the
same algorithm to find the maximum flow for the graph . shown in the figure.

2. Write and explain iterative FFT

3. Explain the point value representation of a polynomial with examples.
4. a) Write extended Euclid algorithm for computing GCD of two numbers.
Find GCD(99, 78) using Extended Ecludian Algorithm and show the computation
steps at each level of the recursion.
5. Define group and list its properties
6. Discuss the chinese remainder theorem. And find the solution to the following :
x= 4(mod 5)
x=5(mod 11)
7. Write the procedural steps of RSA public key cryptosystem. Also consider RSA key
set with p=11, q = 29 , e =3. What value of d should be used in the secret key? And
what is the encryption of the message M=100.
 Second Internal Questions
Answer any 3 questions 10 Marks * 3 = 30 Marks

Module 2

1. Give Ford- Fulkerson algorithm for solving the maximum flow problem . Apply the
same algorithm to find the maximum flow for the graph . shown in the figure.

2. a) Write and explain iterative FFT 5

b) Explain the point value representation of a polynomial with examples. 5

Module 3

3. a) Write extended Euclid algorithm for computing GCD of two numbers.

Find GCD(99, 78) using Extended Ecludian Algorithm and show the computation
steps at each level of the recursion. 6

b) Define group and list its properties 4

4. Discuss the chinese remainder theorem. And find the solution to the following :
x= 4(mod 5)
x=5(mod 11)

5. Write the procedural steps of RSA public key cryptosystem. Also consider RSA key
set with p=11, q = 29 , e =3. What value of d should be used in the secret key? And
what is the encryption of the message M=100.