1. Implement the binary search algorithm in C and analyse its time complexity.

Aim/ Calculations
Program Viva-Voce Record Total
Algorithm and Results
20 30 30 10 10 100

2. Implement Linear Search. Determine the time required to search for an

element. Repeat the experiment for different values of n, the number of
elements in the list to be searched and plot a graph of the time taken versus n.
Aim/ Calculations
Program Viva-Voce Record Total
Algorithm and Results
20 30 30 10 10 100

3. Implement Insertion sort and repeat the experiment for different values of
n, the number of elements in the list to be sorted and plot a graph of the
time taken versus n.
Aim/ Calculations
Program Viva-Voce Record Total
Algorithm and Results
20 30 30 10 10 100
4. Given a text txt [0...n-1] and a pattern pat [0...m-1], write a function search
(char pat [ ], char txt [ ]) that prints all occurrences of pat [ ] in txt [ ]. You
may assume that n > m.
Aim/ Calculations
Program Viva-Voce Record Total
Algorithm and Results
20 30 30 10 10 100

5. Develop a program to implement graph traversal using Breadth First Search.

Aim/ Calculations
Program Viva-Voce Record Total
Algorithm and Results
20 30 30 10 10 100

6. Write a C program to implement the depth first search algorithm for a

graph and analyse its time complexity.
Aim/ Calculations
Program Viva-Voce Record Total
Algorithm and Results
20 30 30 10 10 100
7. Develop a program to find the shortest paths to other vertices using Dijkstra’s
algorithm.
Aim/ Calculations
Program Viva-Voce Record Total
Algorithm and Results
20 30 30 10 10 100

8. Develop a program to implement Floyd’s algorithm for the All-Pairs-

Shortest-Paths problem.
Aim/ Calculations
Program Viva-Voce Record Total
Algorithm and Results
20 30 30 10 10 100

9. Implement prims algorithm for finding the minimum spanning tree of an

undirected graph.
Aim/ Calculations
Program Viva-Voce Record Total
Algorithm and Results
20 30 30 10 10 100
10. Develop a program to find out the maximum numbers in a given list of n

numbers using the divide and conquer technique.

Aim/ Calculations
Program Viva-Voce Record Total
Algorithm and Results
20 30 30 10 10 100

11. Implement the heap sort algorithm in C. Compare its performance with

other sorting algorithms for different input sizes.

Aim/ Calculations
Program Viva-Voce Record Total
Algorithm and Results
20 30 30 10 10 100

12. Implement quick sort algorithm and analyse its time complexity.

Aim/ Calculations
Program Viva-Voce Record Total
Algorithm and Results
20 30 30 10 10 100
13. Implement Traveling Salesperson problem and then solve the same

problem instance using any approximation algorithm and determine the

error in the approximation.
Aim/ Calculations
Program Viva-Voce Record Total
Algorithm and Results
20 30 30 10 10 100

14. Write a C program to Implement N Queens problem using Backtracking.

Aim/ Calculations
Program Viva-Voce Record Total
Algorithm and Results
20 30 30 10 10 100

15. Implement randomized algorithms for finding the kth smallest number.

Aim/ Calculations
Program Viva-Voce Record Total
Algorithm and Results
20 30 30 10 10 100