Discuss various types of data structures with example.
[3 marks]What is hash function used for? Give one example of a hash function.
[4 marks]What is time and space analysis? State and explain time analysis for linear search and binary search method.
[7 marks]Write an algorithm for INSERT operation to insert a node at a given position in a Link list.
[7 marks]Write an algorithm for INSERT, DELETE and DISPLAY function of Circular Queue.
[7 marks]Compare Array and Link list.
[3 marks]State disadvantages of simple queue. How to overcome it?
[4 marks]Discuss height balance tree.
[3 marks]Discuss Minimal Spanning Tree.
[4 marks]Write a recursive function to compute factorial of a number. Show usage of STACK in recursion for this function.
[7 marks]Write an algorithm to find length of a simple link list.
[3 marks]Write an algorithm to insert a node in a Circular Link List at the FIRST position.
[4 marks]Write an algorithm for DELETE operation in a Binary search tree.
[7 marks]Discuss Threaded Binary Tree.
[3 marks]Write an algorithm for a non recursive (Iterative) pre order traversal of Binary search tree.
[4 marks]Create an AVL tree for the following sequence of numbers. Also mention name of action taken. 200, 400, 800, 900, 850, 700, 950, 100, 150
[7 marks]Define following with respect to Tree:
[3 marks]M-ary tree ii) Out Degree iii) Leaf
[ marks]State at least one efficient representation of a sparse matrix.1
[4 marks]Discuss algorithm of Breadth First Search (BFS) traversal for a Graph. Explain with an example.
[7 marks]Write algorithm for Bubble sort method.
[3 marks]Write algorithm for Merge sort method.
[4 marks]Explain Sequential Files and Indexed Sequential Files Structures
[7 marks]Create 2-3 Tree for the following sequence: 50, 100, 150, 200
[3 marks]Represent following in form of an expression tree: A+B*(C+D)
[4 marks]State and explain collision resolution techniques in hashing.
[7 marks]