Define Algorithm. How to write an Algorithm?
[3 marks]Define Data Structure and classify it.
[4 marks]Discuss Time and Space complexity with example. Also discuss average, best and worst case analysis for it.
[7 marks]What is Stack? Write algorithm for PUSH operation in a stack.
[3 marks]Write an algorithm for evaluation of postfix expression.
[4 marks]Convert following infix expression into postfix format showing stack status after every step in tabular form. P * (Q - R/S * T) / (A + B * C/D + E)) + F
[7 marks]Write a pseudocode for Insert and Delete an element from Circular queue.
[7 marks]Differentiate between Stack and Queue.
[3 marks]What is Queue? Explain priority Queue in detail.
[4 marks]List out graph traversal techniques & explain anyone using suitable example.
[7 marks]List the advantages of a doubly linked list over singly linked list.
[3 marks]Differentiate between Array and Linked List.
[4 marks]Write a code to count number of nodes in singly linked list.
[7 marks]Write an algorithm for binary search technique.
[3 marks]Explain Selection sort algorithm and give its best case, worst case and average case complexity.
[4 marks]Explain all tree traversal method with an example.
[7 marks]Write down inorder traversal path for following tree.
[3 marks]How Divide & Conquer approach work? List advantages and disadvantages of it.
[4 marks]Explain Quick Sort Method with example. Give its Time Complexity.
[7 marks]Explain common characteristics of Dynamic Programming
[3 marks]Discuss and derive an equation for solving the 0/1 Knapsack problem using dynamic programming method.
[4 marks]Solve Making Change problem using Dynamic Programming. (Denominations: d1=1, d2=4, d3=6). Give your answer for making change of Rs. 8.
[7 marks]Explain Branch and Bound Technique in brief.
[3 marks]Consider Knapsack capacity W=50, w= (10, 20, 40) and v=(60, 80, 100) find the maximum profit using greedy approach.
[4 marks]Generate minimum spanning tree of following graph using Prim’s and Kruskal’s algorithms.
[7 marks]