Course Code-Regular/Backlog-Batch (2020/2021)

Swami Vivekananda University

Telinipara, Barasat - Barrackpore Rd, Bara Kanthalia, West Bengal –
700121

Term End Examination 2020-2021/2021-2022

Programme Name: MTech CSE
Course Name: Advanced Algorithm Lab
Course Code: MTCS291
Course Type: Practical
(Semester – 2)

Group –A
A.Suggestive Viva Questions

1. What is Asymptotic Notation?2.

2.What are the various criteria used to improve the effectiveness of the algorithm?

3.Define Recurrence Relation. Discuss few popular techniques to solve Recurrence Relation.

4.Why is Master’s Theorem called Cookbook method?

5.What is Backtracking? Name few applications of backtracking.
6.Discuss N-Queens Problem.
7. Discuss an algorithm for 15-puzzle problem.
8.Analyze time complexity of Merge Sort.
9.What is Linear and Quadratic Probing?
10.State the difference between Branch-and-Bound and Backtracking?
11.Explain the classes P, NP, NP-complete, NP-Hard. Discuss the relationship between the
above-mentioned classes.
12.Explain Ford Fulkerson algorithm.
13.State the features of Dynamic Programming.

1
 Course Code-Regular/Backlog-Batch (2020/2021)

14.State the difference between Fractional Knapsack and 0/1 Knapsack.

15.State Horner’s Rule.
16.Compare KMP Algorithm & Naïve approach.
17.What is Graph Colouring method?
18.What is Chromatic Number?
19.What is FFT algorithm?
20.State the difference between BFS & DFS.

Group –B
1.Write a program in C/Java to implement BFS Algorithm.
2. Write a program in C/Java to implement DFS Algorithm.
3. Write a program in C/Java to implement Prim’s Algorithm.
4. Write a program in C/Java to implement Kruskal’s Algorithm.
5. Write a program in C/Java to implement Dijkstra’s Algorithm.
6. Write a program in C/Java to implement Bellman-Ford algorithm and determine its
performance.
7. Write a program in C/Java to implement a Miller Rabin / Monte Carlo algorithm to test the
primality of a given integer and determine its performance.
8. Write a program in C/Java to implement string matching problem using naïve approach.
9. Write a program in C/Java to implement KMP algorithm.
10. Write a program in C/Java to implement string matching problem using Finite Automata
and determine its performance.
11. Write a program in C/Java to implement string matching problem using Robin Karp
algorithm and determine its performance.
12. Write a program in C/Java to implement Quick Sort algorithm