Data Structure and Algorithm Question Bank

1. What is data structure?

2. What are the goals of data structure?
3. What does abstract type mean?
4. What is the difference between stack and array?
5. What do you mean by recursive definition?
6. What is sequential search?
7. What actions are performed when a function is called?
8. What functions are performed when a function returns?
9. What is linked list?
10. What are the advantages of linked list over arrays(static data structure)?
11. Can we apply binary search algorithm to a sorted linked list, why?
12. What do you mean by garbage collection?
13. What do you mean by overflow and underflow?
14. What are the disadvantages of array implementations of linked list?
15. What is queue?
16. What is a priority queue?
17. What are the disadvantages of sequential storage?
18. What is dangling pointer and how to avoid it?
19. What are the disadvantages of linear list?
20. Define double linked list?
21. Is it necessary to sort a file before searching a particular item?
22. Calculate the efficiency of sequential search?
23. Parenthesis is never required in postfix or prefix expressions, why?
24. Minimum number of queues needed to implement the priority queue?
25. Which data structure is used to perform recursion?
26. What are the notations used in evaluation of arithmetic expression using prefix and
postfix forms?
27. Convert the expression ((A+B)*C-(D-E)^(F+G)) to equivalent prefix and postfix
notations?
28. List out few of the application of tree data structure?
29. In tree construction which is suitable efficient data structure?
30. What is a spanning tree?
31. Whether linked list is linear or non-linear data structure?
32. Stack is also called as?
33. List some of the static data structures in C?
34. Why it is said that searching a node in binary search tree is efficient than that of a simple
binary tree?
35. List the application of queue?
36. What is the difference between Null and void pointers?
37. Define a Binary Search Tree?
38. What are the tasks performed while traversing a binary tree?
39. What do you mean by level of the tree?
40. Define parent node?
41. State the difference between queues and linked list?
42. Define internal node?
43. Define degree of the node?
44. What do you mean by breadth first search?
45. What is the use of threaded binary tree?
46. What do you mean by shortest path?
47. Define depth and height of a tree?
48. What are the advantages of linked list over array?
49. Define Graph?
50. What do you mean by tree edge?
51. What is persistent and ephermal data structure?
52. Give applications of data structure?
53. How linear data structures differ from non-linear data structures?
54. What is stack/ what are the applications of stack?
55. What are binary trees?
56. What is the maximum number of nodes in a binary tree of height K?
57. What are tree traversals?
58. What are the applications of graph data structure?
59. How do you represent a graph?
60. What is the difference between tree and graph data structure?
61. What is breadth first search and depth first search?
62. What is topological sorting in a graph?
63. What is merge sort?
64. What is push and pop operations?
65. What is postfix expressions?
66. How do you insert a new item in binary search tree?
67. What is minimum number of nodes that a binary tree can have?
68. Which sorting algorithm is considered the fastest?
69. Give a basic algorithm for searching an item binary search tree?
70. What is dequeue?
71. What are the parts of linked list?
72. How does selection sort work?
73. What is algorithm and flowchart?
74. Explain what is quick sort algorithm?
75. Mention what types of notations used for time complexity?