1. Implement Linear Search. Determine the time required to search for an element.
Aim/Principle/Apparatus Tabulation/Circuit/ Calculation Viva-Voce Record Total
required/Procedure Program/Drawing & Results
10 10 100
(20) (30) (30)
INTERNAL EXAMINER EXTERNAL EXAMINER
2 Implement the binary search algorithm in C and analyse its time complexity.
Aim/Principle/Apparatus Tabulation/Circuit/ Calculation Viva-Voce Record Total
required/Procedure Program/Drawing & Results
10 10 100
(20) (30) (30)
INTERNAL EXAMINER EXTERNAL EXAMINER
3 Write a C program to implement Pattern Matching
Aim/Principle/Apparatus Tabulation/Circuit/ Calculation Viva-Voce Record Total
required/Procedure Program/Drawing & Results
10 10 100
(20) (30) (30)
INTERNAL EXAMINER EXTERNAL EXAMINER
4 (a) 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/Principle/Apparatus Tabulation/Circuit/ Calculation Viva-Voce Record Total
required/Procedure Program/Drawing & Results
10 10 100
(20) (30) (30)
INTERNAL EXAMINER EXTERNAL EXAMINER
4(b) Implement the heap sort algorithm in C. Compare its performance with other sorting algorithms for
different input sizes.
Aim/Principle/Apparatus Tabulation/Circuit/ Calculation Viva-Voce Record Total
required/Procedure Program/Drawing & Results
10 10 100
(20) (30) (30)
INTERNAL EXAMINER EXTERNAL EXAMINER
5 Develop a program to implement graph traversal using Breadth First Search.
Aim/Principle/Apparatus Tabulation/Circuit/ Calculation Viva-Voce Record Total
required/Procedure Program/Drawing & Results
10 10 100
(20) (30) (30)
INTERNAL EXAMINER EXTERNAL EXAMINER
6 Write a C program to implement the Graph Traversal :Depth First Search
Aim/Principle/Apparatus Tabulation/Circuit/ Calculation Viva-Voce Record Total
required/Procedure Program/Drawing & Results
10 10 100
(20) (30) (30)
INTERNAL EXAMINER EXTERNAL EXAMINER
7 Develop a program to find the shortest paths to other vertices using Dijkstra’s algorithm.
Aim/Principle/Apparatus Tabulation/Circuit/ Calculation Viva-Voce Record Total
required/Procedure Program/Drawing & Results
10 10 100
(20) (30) (30)
INTERNAL EXAMINER EXTERNAL EXAMINER
8 Implement Prim’s Algorithm for finding the minimum spanning tree of an undirected graph.
Aim/Principle/Apparatus Tabulation/Circuit/ Calculation Viva-Voce Record Total
required/Procedure Program/Drawing & Results
10 10 100
(20) (30) (30)
INTERNAL EXAMINER EXTERNAL EXAMINER
9 Develop a program to implement All-Pairs- Shortest-Paths problem using Floyd’s algorithm .
Aim/Principle/Apparatus Tabulation/Circuit/ Calculation Viva-Voce Record Total
required/Procedure Program/Drawing & Results
10 10 100
(20) (30) (30)
INTERNAL EXAMINER EXTERNAL EXAMINER
10 Develop a program to implement Warshall algorithm using Transitive closure.
Aim/Principle/Apparatus Tabulation/Circuit/ Calculation Viva-Voce Record Total
required/Procedure Program/Drawing & Results
10 10 100
(20) (30) (30)
INTERNAL EXAMINER EXTERNAL EXAMINER
11 Develop a program to find out the Maximum And Minimum in a given list of n numbers using the
divide and conquer technique.
Aim/Principle/Apparatus Tabulation/Circuit/ Calculation Viva-Voce Record Total
required/Procedure Program/Drawing & Results
10 10 100
(20) (30) (30)
INTERNAL EXAMINER EXTERNAL EXAMINER
12(a) Write a program to implement Merge Sort
Aim/Principle/Apparatus Tabulation/Circuit/ Calculation Viva-Voce Record Total
required/Procedure Program/Drawing & Results
10 10 100
(20) (30) (30)
INTERNAL EXAMINER EXTERNAL EXAMINER
12(b) Write a C program to implement Quick Sort
Aim/Principle/Apparatus Tabulation/Circuit/ Calculation Viva-Voce Record Total
required/Procedure Program/Drawing & Results
10 10 100
(20) (30) (30)
INTERNAL EXAMINER EXTERNAL EXAMINER
13 Write a C program to Implement N Queens problem using Backtracking.
Aim/Principle/Apparatus Tabulation/Circuit/ Calculation Viva-Voce Record Total
required/Procedure Program/Drawing & Results
10 10 100
(20) (30) (30)
INTERNAL EXAMINER EXTERNAL EXAMINER
14 Implement Traveling Salesperson problem and then solve the same problem instance using any
Approximation Algorithm and determine the error in the approximation.
Aim/Principle/Apparatus Tabulation/Circuit/ Calculation Viva-Voce Record Total
required/Procedure Program/Drawing & Results
10 10 100
(20) (30) (30)
INTERNAL EXAMINER EXTERNAL EXAMINER
15. Implement RANDOMIZED ALGORITHM for finding the kth smallest number.
Aim/Principle/Apparatus Tabulation/Circuit/ Calculation Viva-Voce Record Total
required/Procedure Program/Drawing & Results
10 10 100
(20) (30) (30)
INTERNAL EXAMINER EXTERNAL EXAMINER
16 Implement KNAPSACK ALGORITHM using Greedy Method
Aim/Principle/Apparatus Tabulation/Circuit/ Calculation Viva-Voce Record Total
required/Procedure Program/Drawing & Results
10 10 100
(20) (30) (30)
INTERNAL EXAMINER EXTERNAL EXAMINER