Algorithm Analysis & Design

	Question
0	Suggest an approximation algorithm for traveling sales person problems using Minimum spanning tree algorithm. This question has 0 answers so far.
0	What is reducibility? Explain with example. This question has 0 answers so far.
0	Define and explain P, NP, NP hard and NP complete problems. This question has 0 answers so far.
0	Explain Rabin-karp algorithm to solve the string matching problem. This question has 0 answers so far.
0	Enlist all string matching algorithms and compare them on the basis of their storage requirement and time complexity. This question has 0 answers so far.
0	Explain characteristics of Greedy algorithm. Greedy techniques always find optimal solution State True/False. Also justify. This question has 0 answers so far.
0	Differentiate between Dynamic and Greedy methodology, This question has 0 answers so far.
0	Explain Matrix Chain Multiplication Algorithm in detail. This question has 0 answers so far.
0	Explain the Floyd Warshall algorithm with example. This question has 0 answers so far.
0	Illustrate the steps involved in analyzing algorithm using an example. This question has 0 answers so far.
0	Write an algorithm to search an item in a linear list in the minimum possible time. If there are n nodes in the list, what is the running time of your algorithm? This question has 0 answers so far.
0	Explain various asymptotic methods used to represent the rate of growth of running time of algorithms. This question has 0 answers so far.
0	Drive the time complexity of quick sort algorithm for Best Average and Worst Case. Explain which case is useful and why? This question has 0 answers so far.
0	Write a short note on string matching algorithms. This question has 0 answers so far.
0	Solve the recurrence relation, where T(1)=1 and T(n) for n>=2 satisfies T(n)=3T(n/2]+n. This question has 0 answers so far.
0	Write the Kruskal's algorithm for minimum spanning tree. This question has 0 answers so far.
0	Explain a sorting algorithm that use divide and conquer method. This question has 0 answers so far.