Data Structures -Question Bank

1. What is data structure?

2. Differentiate between file and structure storage structure.
3. When is a binary search best applied?
4. What is a linked list?
5. How do you reference all the elements in a one-dimension array?
6. In what areas do data structures are applied?
7. What is LIFO?
8. What is a queue?
9. What are binary trees?
10. Which data structures are applied when dealing with a recursive function?
11. What is a stack?
12. Explain Binary Search Tree
13. What are multidimensional arrays?
14. Are linked lists considered linear or non-linear data structures?
15. How does dynamic memory allocation help in managing data?
16. What is FIFO?
17. What is an ordered list?
18. What is merge sort?
19. Differentiate NULL and VOID
20. What is the primary advantage of a linked list?
21. What is the difference between a PUSH and a POP?
22. What is a linear search?
23. How does variable declaration affect memory allocation?
24. What is the advantage of the heap over a stack?
25. What is a postfix expression?
26. What is Data abstraction?
27. How do you insert a new item in a binary search tree?
28. How does a selection sort work for an array?
29. How do signed and unsigned numbers affect memory?
30. What is the minimum number of nodes that a binary tree can have?
31. What are dynamic data structures?
32. In what data structures are pointers applied?
33. Do all declaration statements result in a fixed reservation in memory?
34. What are ARRAYs?
35. What is the minimum number of queues needed when implementing a
priority queue?
36. Which sorting algorithm is considered the fastest?
37. Differentiate STACK from ARRAY.
38. Give a basic algorithm for searching a binary search tree
39. What is a dequeue?
40. What is a bubble sort and how do you perform it?
41. What are the parts of a linked list?
42. How does selection sort work?
43. What is a graph?
44. Differentiate linear from a nonlinear data structure.
45. What is an AVL tree?
46. What are doubly linked lists?
47. What is Huffman’s algorithm?
48. What is Fibonacci search?
49. Briefly explain recursive algorithm.
50. How do you search for a target key in a linked list?
51. Why do we use stacks?
52. Explain the operations on stack
53. What are some of the applications of Queue?
54. How insertion sort and selection sort are different?
55. What is a spanning tree?
56. What are the different types of traversing?
57. Define pre-order traversal
58. Define post-order traversal
59. Define in-order traversal
60. What do you mean by overflow and underflow?
61. Stack can be described as a pointer. Explain
62. What Does Abstract Data Type Mean?
63. What Actions Are Performed When A Function Is Called?
64. What Are The Advantages Of Linked List Over Array (static Data Structure)?
65. We Apply Binary Search Algorithm To A Sorted Linked List, Why?
66. What Do You Mean By Free Pool?
67. What Do You Mean By Garbage Collection?
68. Define Circular List?
69. What Are The Issues That Hamper The Efficiency In Sorting A File?
70. Calculate The Efficiency Of Sequential Search?
71. Parenthesis Is Never Required In Postfix Or Prefix Expressions, Why?
72. Is Any Implicit Arguments Are Passed To A Function When It Is Called?
73. List Out The Areas In Which Data Structures Are Applied Extensively?
74. What Are The Major Data Structures Used In The Following Areas : Network Data
Model & Hierarchical Data Model?
75. If You Are Using C Language To Implement The Heterogeneous Linked List, What
Pointer Type Will You Use?
76. What Is The Type Of The Algorithm Used In Solving The 8 Queens Problem?
77. In An Avl Tree, At What Condition The Balancing Is To Be Done?
78. There Are 8, 15, 13, 14 Nodes Were There In 4 Different Trees. Which Of Them Could
Have Formed A Full Binary Tree?
79. In Rdbms, What Is The Efficient Data Structure Used In The Internal Storage
Representation?
80. Explain B+ Trees
81. What Are The Major Data Structures Used In The Following Areas : Rdbms, Network
Data Model & Hierarchical Data Model?
82. Define Static Data Structures?
83. List Some Of The Static Data Structures In C?
84. Define Dynamic Data Structures?
85. List Some Of The Dynamic Data Structures In C?
86. Define Graph Traversals?
87. What Do You Mean By Breadth First Search (bfs)?
88. List The Two Important Key Points Of Depth First Search?
89. What Is A Minimum Spanning Tree?
90. When Is A Graph Said To Be Weakly Connected?
91. What Is Meant By Strongly Connected In A Graph?
92. What Is An Acyclic Graph?
93. What Is A Cycle Or A Circuit?
94. What Is A Simple Path?
95. Define Path In A Graph?
96. Define Indegree Of A Graph?
97. Define Outdegree Of A Graph?
98. What Is A Weighted Graph?
99. Mention One Advantage And Disadvantage Of Using Quadratic Probing?
100. List The Limitations Of Linear Probing?
101. What Is The Need For Extendible Hashing?
102. What Do You Mean By Rehashing?
103. What Do You Mean By Double Hashing?
104. What Do You Mean By Secondary Clustering?
105. What Do You Mean By Probing?
106. What Do You Mean By Separate Chaining?
107. What Are The Collision Resolution Methods?
108. What Do You Mean By Collision In Hashing?
109. What Do You Mean By Hash Function?
110. What Do You Mean By Heap Order Property?
111. What is Minheap and Maxheap
112. What Are The Applications Of B-tree?
113. What Do You Mean By 2-3-4 Tree?
114. List The Types Of Rotations Available In Splay Tree?
115. Why It Is Said That Searching A Node In A Binary Search Tree Is Efficient
Than That Of A Simple Binary Tree?