Unit Wise Important Questions UNIT-1(10M) Unit-1 (2M & 3M)

Transcription

1 Unit Wise Important Questions UNIT-1(10M) 1. Define Linked List? Explain the operations on Linked List? 2. Define Double Linked List? Explain the operations on Double Linked List? 3. Define Circular Linked List? Explain the operations on Circular Linked List? 4. Define sparse Matrices & Explain the Linked representation of Sparse Matrix? 5. Write the differences between Linked list &Array? Unit-1 (2M & 3M) 1. Define Algorithm? What are the Characteristics of Algorithm? 2. Define Recursion? Explain design methodology & imp of recursive of algorithm? 3. Difference between recursion & iteration? 4. Define Abstraction & ADT 5. Define ADT for Arrays 6. Define Frequency count & obtain the frequency for the following code Void fun() { a=0; for(i=0;i<n;i++) { a=a+i; } Printf( %d,a); } 7.Define Time Complexity? Write an algorithm to find smallest element in array of integers & analyze its Time Complexity 8.Define Space Complexity? Compute the space needed by the following algorithm justify your answer

2 Alg: Sum(a,n) s :=0.0; for i:=1 to ndo s : =s+a[i]; returns; 9.Define Asymptotic Notation & what are the Asymptotic Notation define them10.write about the classification of Data Structures 11.Define static & Dynamic Data Structures 12. Write about the structures of node in single linked list 13. Write about the structures of node in double linked list 14. Write about the structures of node in circular linked list 15.Differences between single & double linked list 16. What is an Array?syntax of array declaration 17. Define one-dimensional array with an example program 18. Define two-dimensional array with an example program 19. Define Sparse Matrices 20. Write about Sparse Matrix representation

3 UNIT-2 (10 M) 1. Define Stack ADT? Explain the operations in stack using Arrays with an example program. 2. Define Stack ADT? Explain the operations in stackusing Linked list with an example program. 3. Define Queue ADT? Explain the operations in Queueusing Arrays with an example program. 4. Define Queue ADT? Explain the operations in Queueusing Linked list with an example program. 5. Define Circular Queue ADT? Explain the operations in Circular Queueusing Arrays with an example program. 6. A) Convert the following infix expression to postfix form ( (A-(B+C)*D) $ (E+F) ) B) Write an algorithm to convert infix to postfix expression UNIT-2 ( 2M& 3M ) 1. Define Stack ADT?What are the operations in stack define them 2. Define QueueADT?What are the operations in queue define them 3.Define Circular Queue ADT? What are the operations in circular queue define them 4.DefineDeque ADT? What are the operations in deque define them 5.Write an algorithm for evaluation of postfix 6.Evaluate the following postfix expression 123+* 7.What are the various applications of stack 8.Define Expression? What are types of expression 9.Define infix Expression

4 10.Define postfix Expression 11.Define prefix Expression 12.Define Stack full operation 13.Define Stack empty operation 14.Define push & pop operations 15. What are the applications of Queue UNIT-3 (10M) 1. A) What is binary tree ADT? Explain about representation of binary tree using arrays B) Explain about representation of binary tree using linked list 2. What is binary tree? Write a program for creation or insertion & deletion of node from binary tree 3. A)Explain difference types of tree traversal techniques b)discuss threaded binary tree in detail 4. A)Construct a heap using for following list of elements 14,12,9,8,7,10,18 b)write an algorithm for insertion & deletion of node in the heap 5. A)Explain about graph traversal b)explain the following terms i)adjacency Matrix of graph. ii)adjacency list of graph UNIT-3 (2M & 3M) 1. Write about the definition of tree 2.Define the following terms. a)root b)parent node c)child node d)leaf node 3.Define the following terms. a)degree of node b)degree of tree c)level of tree

5 4.Define the following terms. a)level of tree b)height of tree 5.Define the following terms. a)predecessor b)successor c)internal & external nodes d)siblings 6.Define the following terms. a)full binary tree b)complete binary tree c)left & right skewed trees 7.Define binary tree ADT 8.What are two ways of representing binary tree 9.Whatare six ways to traverse a tree. According to computing point of view.what are three different ways for traversing a tree 10.Define in-order traversal 11. Define pre-order traversal 12. Define post-order traversal 13.What is the purpose of threaded binary tree 14. What are advantages & disadvantages of threaded binary tree 15. Define priority queue? What are types of priority queue 16. Define Max triorty queue ADT 17. Define heap & types of heap 18. Comparisons between graph & tree 19. Define graph? What are the types of graph 20. What are properties of graph.define them 21. Define the following terms

6 a)weighted graph b)path c)cycle 22. Define the following terms a)component b)in & out degrees c)sort loop 23. Define graph ADT 24. What are applications of graph UNIT-4( 10M) 1. A)Explain about linear search with program B)Explain about binary search 2. What is hashing? Explain various hashing methods with suitable examples 3. Show the hash table entries for given data set using linear probing & quadratic probing 12,45,67,88,27,78,20,62,36,55 4. A)Explain selection sort technique with example b)explain insertion sort technique with example 5. A)Explain quick sort technique with example B)Explain radix sort technique with example 6. Explain heap sort technique with example UNIT-4 (2M & 3M) 1.What are advantages & disadvantages of linear searching 2.What are advantages & disadvantages of linear searching 3. Comparison between linear & binary searching 4. Define hash table 5. Define hashing & hash function 6. Define the followingterms a)division method b)mid square

7 7. Define the following terms a)multiplicative hash function b)digit holding 8. Define collision? What are types of collision handling techniques 9. Define sorting? What are the types of sorting 10. Which are sorting techniques based on divide & conquer method 11. Define dictionary & various operations 12. What is the need of sorting? What are applications of sorting 13. Write about the efficiency of selection sort 14. Write about the efficiency of insertion sort 15. Write about the efficiency of quick sort 16. Write about the efficiency of linear sort 17. Write about the efficiency of binary sort UNIT-5 (10 m) 1. A)What is the purpose of binary search tree? Explain the operations in binary search tree. b)what is BSTADT. Draw BST for the following data 10,08,15,12,13,07,09,17,20,18,04,05 2. A)What is AVL tree? Explain with example b)for each of following lists, construct an AVL tree by inserting their successively starting with the empty tree. a)1,2,3,4,5,6. b)6,5,4,3.,2,1. 3. A)Construct a binary tree of orders for the following data. 3,14,7,18,5,11,17,13,6,23,12,20,26,4,16,18,24,25, A)Describe Splay Trees b)describe Red Black Trees

8 5. Give the tail indexes used by KMP algorithm for following patterns a)aaab b)aabaacaababa c)abracadabra d)astracastrsa 1.What is binary search tree UNIT-5 (2M & 3M) 2. Write an algorithm for insertion of node in binary tree 3. What are the 3 cases which are possible from deletion of element from binary tree 4. Define BST & ADT 5. Define AVL trees 6. Define Balance factor 7. Write about the representation of AVL tree 8. What are different cases to rebalance the AVL tree 9. Define L.L. Rotation with example 10. Define R.R Rotation with example 11. Define L.R Rotation with example 12. Define R.L Rotation with example 13. Define binary tree with example 14. Define multiway search tree 15.What are applications of binary tree

9 16. Define what are the properties of Red Black Trees statistics the properties of binary trees 17. Define the following terms a) LR R imbalance b)ll R imbalance 18. Define the following terms a) RR R imbalance b)rl R imbalance 19. Define splay trees 20. Define the following terms a)zig-zay case b)zig-zig case c)zig case 21. Comparison between search tree & AVL trees 22. Define trie&it s advantages 23. Define binary trie 24. Define Compressed binary trie 25. Define multiway-tire