Sort the letters of word “DESIGN” in alphabetical order using Bubble sort algorithm.
[7 marks]What is algorithm? What do you mean by performance analysis of an algorithm? Explain average case and worst case analysis with the help of suitable example.
[7 marks]Explain how to apply the divide and conquer strategy for sorting the elements using quick sort.
[7 marks]Explain asymptotic notation with the help of example.
[7 marks]Explain binary search algorithm with divide and conquer strategy and use the recurrence tree to show that the solution to the binary search recurrence relation is Θ (log n).
[7 marks]Give and explain Prim’s algorithm for Minimum Spanning Tree and compare it with Kruskal’s algorithm.
[7 marks]Discuss Matrix Chain Multiplication with Suitable example.
[7 marks]Compute Longest Common Subsequence for the strings: A= <X,Y,Z,Y,T,X,Y> B= <Y,T,Z,X,Y,X>
[7 marks]Explain accounting method of amortized analysis using stack operations.
[7 marks]Discuss how 8-queen problem can be solved using backtracking.
[7 marks]Give the algorithm with example to solve 0/1 Knapsack Problem using Dynamic Programming
[7 marks]Explain assembly line scheduling with example by dynamic programming.
[7 marks]Explain breadth first search algorithm with example.
[7 marks]Explain Rabin Karp string matching algorithm with an example.
[7 marks]Explain the following terms: A. P B. NP C. NP-Complete D. NP-hard
[7 marks]What is finite automata? How it can be sued in string matching?
[7 marks]Give the algorithm for depth first search of a graph. Also define “articulation point of a graph and explain how to find it.
[7 marks]