Explain why analysis of algorithm is important? Explain: Worst Case, Best Case & Average Case Complexity with suitable example.
[7 marks]Explain linear inequality and linear equations.
[7 marks]Explain how multiplication of large integers can be done efficiently by using divide and conquer method.
[7 marks]Write an algorithm for selection sort and show that the time complexity of this algorithm is quadratic.
[7 marks]Why amortized analysis is required? Explain any two method of amortized analysis with suitable example.
[7 marks]Write Quick sort algorithm and derive the worst case time complexity of quick sort algorithm.
[7 marks]Explain Knapsack problem using greedy method with example.
[7 marks]Explain LCS problem using dynamic programming with suitable example.
[7 marks]Design and explain Dijkstra’s shortest path algorithm
[7 marks]Explain Backtracking concept and apply the same on 8-queen problem.
[7 marks]Describe an assembly line scheduling problem and give dynamic programming algorithm to solve it.
[7 marks]What is Articulation Point? Explain how to find an Articulation Point of the graph with suitable example.
[7 marks]Explain Branch and Bound technique with suitable example.
[7 marks]Explain naive string matching algorithm with example.
[7 marks]Explain the concept of P, NP and NP-complete problem
[7 marks]Explain Breadth First Traversal Method for Graph with algorithm.
[7 marks]Explain Floyd’s algorithm for finding out shortest path with example.
[7 marks]