Question

S.NO. REG.NO. NAME

No.
1 AAROKIYA RUBINA A 1
912522104001

2 912522104002 ABINAYA R 2

3 912522104003 ABISHIEK P 3

4 912522104004 ADHAVAN K 4

5 912522104005 ATHITHYA M 5

6 912522104006 BHARATH R 6

7 912522104007 CHANDRU.S -

8 912522104008 DARNISH PRIYAN J 7

9 912522104009 DURGA S 8

10 912522104010 GAYATHRI T 9

11 912522104011 HARIHARN S 10

12 912522104012 HARISH VISHVA S 11

13 912522104013 INFANT RAJA S 12

14 912522104014 JANARTHANAN R 1

15 912522104015 JEYAPRIYA G 2

16 912522104016 JEEVAGANTHAN M 3

17 912522104017 JENCY A 4

18 912522104018 JOSBIN ANITHA S 5

19 912522104019 KARUPPU S 6

20 912522104020 KAVIN S 7

21 912522104021 KAVI NESAR E 8

22 912522104022 MAITHILY A 9

23 912522104023 MANIKANDAN R 10
24 912522104024 MANIVEL M -
25 912522104025 MARI KISHORE P 11

26 912522104026 MOHANKUMAR S 12

27 912522104027 MURALI KARTHIK 1

28 912522104028 MUTHUKUMARA SWAMY S 2

29 912522104029 NANTHAKUMARAN S 3

30 912522104030 NITHISH A -

31 912522104031 NITHISHKA M 4

32 912522104032 NIVETHA R 5

33 912522104033 PALANIYAPPAN S 6

34 912522104034 PREETHIKA G 7

35 912522104035 PRIYADHARSHINI K 8

36 912522104036 RAFEEQA REEZZMAN 9

37 RAMESH K 10
912522104037

38 912522104038 RESHMA B 11

39 912522104039 ROHINI S 12

40 912522104040 SAKTHIVEL P 1

41 912522104041 SANTHYA C 2

42 912522104042 SANTHYAMARY Y 3

43 912522104043 SANTHOSH K 4

44 912522104044 SANTHOSH KANNA J 5

45 912522104045 SATHEESHKUMAR P 6

46 912522104046 SEVUGAPERUMAL U 7

47 912522104047 SIVADHARSHINI K 8

48 912522104048 SIVAGAMI S 9
 49 912522104049 SIVASANKARAN G 10

50 912522104050 SNEKA N 11

51 912522104051 SOMESHKANNA P 12

52 912522104052 SRIKARAN B 1

53 912522104053 SUBALAKSHMI J 2

54 912522104054 SUTHDESIBHARATHI J 3

55 912522104055 SUVITHA K 4

56 912522104056 THARANI D 5

57 912522104057 USHAMALINI K 6

58 912522104058 VIGNESH P 7

59 912522104059 VIGENESHWARAN G 8

60 912522104060 VIGNESHWARAN K 9

61 912522104301 BALAPRASANTH P 10

62 912522104302 HARIHARAN S 11

63 912522104303 KIRUTHIKKARAN M 12

64 912522104304 KISHORE CT 1

65 912522104305 RAVIKUMAR S 2

66 912522104306 SANKAR S 3
1. i)To 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 .
ii)To implement the graph traversal using Breadth first search.
2. i)To implement recursive binary 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 .
ii)To implement the graph traversal using Depth first search.
3. i)To a given a text txt[0…m-1]. Write a function search(char pat[], char txt[]) that print all
occurences of pat[] in txt[]. You may assume that n>m.
ii)To find the minimum cost spanning tree of a given undirected graph using prims algorithm.
4. i)To implement insertion sort and heap sort. Determine the time required to sort for an element.
Repeat the experiment for different values of n, the number of elements in the list to be sorted .
ii) To implement floyd’s algorithm for the all pair shortest path problem
5. i) To implement the graph traversal using Breadth first search.
ii)To implement randomized algorithms for finding them kth smallest number

6. i)To implement the graph traversal using Depth first search.

ii)To implement N Queens problem using backtracking.

7. i)To given vertex in a weighted connected graph, develop a program to find the shortest path to
other vertices using Dijikstra’s algorithm
ii)To a given a text txt[0…m-1]. Write a function search(char pat[], char txt[]) that print all
occurences of pat[] in txt[]. You may assume that n>m.

8. i)To implement the graph traversal using Depth first search.

ii)To compute the transitive closure of a given directed graph using warshall’s algorithm.

9. i)To develop a program to findout the maximum and minimum numbers in a given list of n
numbers using the divide and conquer.
ii)To implement N Queens problem using backtracking.

10. i)To implement Merge sort and Quick sort methods to sort an array of elements and determine the
time required to sort. 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.

ii)To implement randomized algorithms for finding them kth smallest number

11. i)To implement any scheme to find the optimal solution for the traveling salesman
problem and then solve the same problem instance using approximation algorithm and determine
the error in the approximation.
 ii)To implement the graph traversal using Depth first search.

12. i)To implement randomized algorithms for finding them kth smallest number
ii)To 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 .