What is an algorithm? Why analysis of algorithm is required?
[3 marks]What is asymptotic notation? Find out big-oh notation of the function: f(n) = 3 n2 +5n+10
[4 marks]Sort the following list using quick sort algorithm: < 5, 3, 8, 1, 4, 6, 2, 7> Also write Best case, Worst case and Average case of the quick sort algorithm.
[7 marks]What is the difference between linear search and binary search?
[3 marks]Explain open hashing-separate chaining with example.
[4 marks]Write an algorithm to convert and infix expression to postfix expression. Give appropriate example to show the execution.
[7 marks]Write an algorithm to evaluate an infix expression. Give appropriate example to show the execution.
[7 marks]What is the difference between selection sort and bubble sort?
[3 marks]Explain quadratic probing with example.
[4 marks]Explain recursive tree method and solve following recurrence relation using recursive tree method. T(n) = √nT(√n)+ n
[7 marks]How divide and conquer approach work?
[3 marks]Write list of stack applications. Give any two with corresponding examples.
[4 marks]Explain master theorem and solve the following recurrence with master method. n T(n) = 9 T( )+ n3
[7 marks]Find Minimum Spanning Tree for the given graph using krushkal's algorithm.
[3 marks]Find the Huffman code for each symbol in following text ABCCDEBABFFBACBEBDFAAAABCDEEDCCBFEBFCAE
[4 marks]Write an algorithm of finding the kth minimum element in a BST. Also show the time complexicity of your algorithm.
[7 marks]Find Minimum Spanning Tree for the graph given in Q4(a) using Prim’s Algorithm.
[3 marks]Consider Knapsack capacity W=15, w = (4, 5, 6, 3) and v=(10, 15,12, 8) find the maximum profit using greedy method.
[4 marks]Explain Backtracking Method. What is N-Queens Problem? Give solution of 4- Queens Problem using Backtracking Method.
[7 marks]Write the characteristics of greedy algorithm.
[3 marks]Give difference between greedy approach and dynamic programming
[4 marks]Write an algorithm of finding Longest Common Subsequence (LCS) with example
[7 marks]Explain the Minimax principle and show its working for simple tic-tac-toe game playing.
[3 marks]Find out minimum number of multiplications required for multiplying: A[1 × 5], B[5 × 4], C[4 × 3], D[3 × 2], and E[2 × 1].
[4 marks]Explain travelling salesman problem with example.
[7 marks]