QUESTION BANK
II YEAR/I SEM
DATA STRUCTURES
Short Answers Type Questions
1. What is data structure? Explain various types of datastructure.
2. Give the applications of stack.
3. Write an algorithm to convert Infix expression into postfix expression.
4. Describe abstract data type with example.
5. Write the applications of queue datastructure.
6. Explain stack as static data structure.
7. What is linked list.Explain its type with suitable diagram.
8. Write the applications of linked list.
9. Write the applications of binary search tree.
10. Give algorithm to sort a list using bubblesort.
11. Differentiate between stack and queue data structures.
12. What is graph. Explain the types of graph with example.
13. Why we need data structure?
14. Mention the types of searching
15. What is open addressing?
16. What are the collision resolution methods?
17. Define separate chaining
18. Write the disadvantages of separate chaining.
19. Differentiate between linear and non-linear datastructures.
20. Give the features of abstract data type(ADT).
21. What are the disadvantages of linked list?
22. Mention the advantages of linked list?
23. Distinguish between primitive and non-primitive datastructures.
24. Convert the following infix expression into postfix form(A+B)*(C+D)*E^F
25. Write the prefix and postfix form for:A+B*(C-D)/(E-F)
26. Explain the use of graph in datastructures?
27. Define hash function.
28. What is Dictionary.
29. What is hash table.
30. Define internal nodes
31. Define depth and height of a node
1
32. Define a complete binary tree
33. State the properties of a binary tree
34. What is meant by binary tree traversal?
35. What are the tasks performed during postorder traversal?
36. Define a AVL tree
37. What are the categories of AVL rotations?
38. What do you mean by balance factor of a node in AVL tree?
39. Define splay tree.
40. What is the idea behind splaying?
41. What are the properties of Red-Black tree,
42. Define adjacent nodes.
43. What is an undirected graph?
44. What is a loop?
45. Differentiate BFS and DFS.
46. What is an acyclic graph?
47. Define sorting
48. Mention the types of sorting
49. What is pattern matching.
50. What is Tries
Long Answers Type Questions
1. What is stack? Why it is known as LIFO? Write algorithm of PUSH and POP
operation on stack.
2. What is queue? Why it is known as FIFO? Write an algorithm to insert and delete an
element from a simple queue.
3. Explain how to represent singly linked list with help of diagram and example.
4. Write and explain algorithm to insert element at the beginning of singly linked list.
5. Explain algorithm to delete element from singlylinked list.
6. What is tree traversal. Explain the in-order,preorder and post-order traversal.
7. Differentiate between depth first search and breadth first search.
8. Explain how infix expressions are converted to polish notation. Illustrate your answer
with suitable example?
9. Explain quick sort algorithm with the help of an example.
10. Write an algorithm for insertion in binarysearch.
11. Discuss the difference between a general tree and a binary tree. What is a complete
binary tree? Give an algorithm for deleting a value X from a given binary tree.
2
12. Write an algorithm for the depth first search of a graph? State its advantages and
disadvantages?
13.What is the difference between an array and a linked list?
14. Explain in detail about separate chaining.
15. Formulate the rehashing technique with suitable example.
16. Discuss the common collision resolution strategies .
17. Explain Re-hashing and Extendible hashing.
18. Describe the algorithms used to perform single and double rotation on AVL tree.
19. Construct an expression tree for the expression (a+b*c) + ((d*e+f)*g). Give the outputs
When you apply inorder, preorder and postorder traversals
20. Explain the various representation of graph with example in detail?
21. Explain the Terminology of graph with example in detail?
22. Explain the merge sort with example in detail?
23. Explain the TRIES in detail?
24. Explain the Brute force algorithm with example in detail?
25. Explain the Boyer -Moore algorithm in detail?
26. Explain the Knuth-Morris-Pratt algorithm in detail?
27. Explain the Dictionaries in detail?
28. Explain the B+ tree with example?
29. Explain the Max –Heap with example?
30. Explain the Min- Heap wth example in detail?
3
4
