Compare Array and Linked List.
[3 marks]Define algorithm. Discuss key characteristics of algorithms.
[4 marks]Find the reasons doe’s algorithm analysis become necessary? Also outline Asymptotic Notations.
[7 marks]List out General Characteristics of Greedy algorithms.
[3 marks]Make a Cprogram for selection sort.
[4 marks]Write an Algorithm to convert Infix expression into Postfix expression with suitable example.
[7 marks]Design a pseudocode for Insert and Delete an element from Circular queue.
[7 marks]Write an algorithm to perform PEEP and CHANGE operation on stack.
[3 marks]How multiplication of large integers can be done efficiently by using divide and conquer technique? Also, multiply 35 with 78 using the same approach.
[4 marks]What is a binary search tree? Create a binary search tree for the following data. 38, 13, 51, 10, 12, 40, 84, 25, 89, 37, 66, 95 . Perform all Preorder, Postorder & Inorder traversal on resultant tree.
[7 marks]Solve the following recurrence with master method. T(n)= 4 T(n /2 )+ n
[3 marks]Apply quick sort on following data:
[4 marks]Write an algorithm to insert a node in Ordered Singly Linked List.
[7 marks]What is graph? How it can be represented?
[3 marks]Explain binary search technique with example. Also write worst case and average case time complexity of binary search.
[4 marks]What is hashing? What are the qualities of a good hash function? Explain any two hash functions in detail.
[7 marks]Give difference between greedy approach and dynamic programming.1
[3 marks]Solve the following knapsack problem using greedy method. Number of items = 5, knapsack capacity W – 100, weight vector = {10, 20, 30, 40, 50} and profit vector = {20, 30, 66, 40, 60}.
[4 marks]Show the steps of BFS and DFS traversal for following graph starting from vertex 2.
[7 marks]Explain Activity selection problem with example.
[3 marks]Define minimum spanning tree. Find minimum spanning tree using Krushkal’s algorithm of the following graph:
[4 marks]Explain Matrix chain multiplication with suitable example
[7 marks]What is Travelling Salesman problem?
[3 marks]Find Longest Common Subsequence from given two Strings. S1 : abbacdcba S2 : bcdbbcaac
[4 marks]Solve a making change problem using Dynamic programming where coins={2,3,5,10} and Amount to pay W=15.
[7 marks]