1. Write a program to implement binary search.
Aim & Procedure Program Results Viva-Voce Record Total
20 40 20 10 10 100
Mark in words: …………………………………………………………………………………………………..
Signature of the Examiner
2. Write a program to implement binary search.
Aim & Procedure Program Results Viva-Voce Record Total
20 40 20 10 10 100
Mark in words: ………………………………………………………………………………………………….
Signature of the Examiner
3. Write a program to implement pattern searching algorithm.
Aim & Procedure Program Results Viva-Voce Record Total
20 40 20 10 10 100
Mark in words: ……………………………………………………………………………………………….
Signature of the Examiner
4. Write a program to implement heap sort.
Aim & Procedure Program Results Viva-Voce Record Total
20 40 20 10 10 100
Mark in words: …………………………………………………………………………………………………..
Signature of the Examiner
5. Write a program to implement graph traversal using breadth first search (BFS).
Aim & Procedure Program Results Viva-Voce Record Total
20 40 20 10 10 100
Mark in words: ………………………………………………………………………………………………….
Signature of the Examiner
6. Write a program to implement graph traversal using depth first search (DFS).
Aim & Procedure Program Results Viva-Voce Record Total
20 40 20 10 10 100
Mark in words: ……………………………………………………………………………………………….
Signature of the Examiner
7. Write a program to implement Dijkstra's algorithm.
Aim & Procedure Program Results Viva-Voce Record Total
20 40 20 10 10 100
Mark in words: …………………………………………………………………………………………………..
Signature of the Examiner
8. Write a program to implement Prim's algorithm.
Aim & Procedure Program Results Viva-Voce Record Total
20 40 20 10 10 100
Mark in words: ………………………………………………………………………………………………….
Signature of the Examiner
9. Write a program to implement Floyd's algorithm.
Aim & Procedure Program Results Viva-Voce Record Total
20 40 20 10 10 100
Mark in words: ……………………………………………………………………………………………….
Signature of the Examiner
10. Write a program to implement Warshall's algorithm.
Aim & Procedure Program Results Viva-Voce Record Total
20 40 20 10 10 100
Mark in words: …………………………………………………………………………………………………..
Signature of the Examiner
11. Write a program to implement divide and conquer technique.
Aim & Procedure Program Results Viva-Voce Record Total
20 40 20 10 10 100
Mark in words: ………………………………………………………………………………………………….
Signature of the Examiner
12. Write a program to implement merge sort.
Aim & Procedure Program Results Viva-Voce Record Total
20 40 20 10 10 100
Mark in words: ……………………………………………………………………………………………….
Signature of the Examiner
13. Write a program to solve N-Queens problem using backtracking.
Aim & Procedure Program Results Viva-Voce Record Total
20 40 20 10 10 100
Mark in words: …………………………………………………………………………………………………..
Signature of the Examiner
14. Write a program to implement approximation algorithms / randomized algorithms.
Aim & Procedure Program Results Viva-Voce Record Total
20 40 20 10 10 100
Mark in words: ………………………………………………………………………………………………….
Signature of the Examiner
15. Write a program to find kth smallest number.
Aim & Procedure Program Results Viva-Voce Record Total
20 40 20 10 10 100
Mark in words: ……………………………………………………………………………………………….
Signature of the Examiner