Explain the concept of recursion and write a recursive Cprogram to calculate factorial of a number.
[7 marks]Define static, dynamic, linear and non-linear data structures.
[4 marks]What is data structure? Differentiate between data types and data structures
[3 marks]Evaluate the following expression using stack, show each step. 10 2 + 8 4 / * 6 3 -/
[4 marks]Write an algorithm to convert an infix expression to postfix.
[7 marks]Write a Cfunctions for insertion and deletion operation in simple queue.
[7 marks]Compare and contrast queue, priority queue and dequeue.
[3 marks]Compare and Contrast DFS and BFS
[4 marks]What is minimum cost spanning tree? Discuss Prim’s algorithm with an example
[7 marks]Write an algorithm to insert an element in an ordered link list
[7 marks]Convert the following expression to postfix using stack. Show each step clearly ((A-B)+D/((E+F)*G))
[4 marks]Differentiate Array and Linked lists
[3 marks]Define : 1. Directed Graph 2. Acyclic and cyclic graph 3. Weighted and unweighted graph
[3 marks]If the depth of the binary tree is k, the maximum number of nodes in the binary tree is 2k -1. Justify. Also mention atleast how many nodes a tree should have given it’s depth as k.1
[4 marks]For a given tree show the Inorder, Preorder and Postorder traversals
[7 marks]Explain the properties of binary tree and differentiate between complete binary tree, full binary tree and balanced binary tree
[3 marks]Insert the following nodes into an empty BST in this order: 50, 30, 70, 20, 40, 60, 80. Draw the resulting BST after each insertion
[4 marks]What is a binary search tree? write an algorithm to search an element in BST and show it’s time complexity
[7 marks]Define following with respect to Tree: i) M-ary tree ii) Out Degree iii) Leaf
[3 marks]Construct the 2-3 tree for the following sequence 10, 20, 30, 40, 50, 60, 70, 80, 90.
[4 marks]Write an algorithm to sort an array using selection sort method.
[7 marks]Sort following elements using quick sort. 22 15 26 06 40 31, 92, 45, 78
[3 marks]Compare the below different hashing methods and discuss about each method in a detailed Manner. i. Static Hashing. Ii. Dynamic Hashing
[4 marks]Insert the following keys into a hash table of size 10 using linear probing: 12, 26, 31, 92, 45, 78 Show the steps and the final hash table
[7 marks]Explain AVL tree with suitable example.
[3 marks]