Interview Questions of Data Structure
Data Structure is one of the favourite subject of interviewers for technical interview, so make expertise on it. Here I have collected few frequently asked questions, hope it will help you.
1.What is data structure?
2.What are the goals of Data Structure ?
3.What does abstract Data Type Mean?
4.What is the difference between a Stack and an 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 actions are performed when a function returns?
9.What is a linked list ?
10.What are the advantages of linked list over array(static data
11.Can we apply binary search algorithm to a sorted linked list,why ?
12.What do you mean by free pool ?
13.What do you mean by garbage collection ?
14.What do you mean by overflow and underflow ?
15.What are the disadvantages array implementation of linked list ?
16.What is a queue ?
17 . What is a priority queue ?
18.What are the disadvantages of sequential storage?
19.What are the disadvantages of representing a stack or queue by a
linked list ?
20.What is dangling pointer and how to avoid it ?
21.What are the disadvantages of linear list ?
22.Define circular list ?
23 . What are the disadvantages of circular list ?
24.Define double linked list?
25.Is it necessary to sort a file before searching a particular item ?
26.What are the issues that hampers the efficiency in sorting a file ?
27.Calculate the efficiency of sequential search ?
28 . Is any implicit arguments are passed to a function when it is
29.Parenthesis is never required in Postfix or Prefix expressions,
30.List out the areas in which data structures are applied
31.What are the major data structures used in the following areas :
network data model & Hierarchical data model.
32.If you are using C language to implement the heterogeneous linked
list, what pointer type will you use?
33.Minimum number of queues needed to implement the priority queue?
34.What is the data structures used to perform recursion?
35.What are the notations used in Evaluation of Arithmetic Expressions
using prefix and postfix forms?
36 . Convert the expression ((A + B) * C – (D – E) ^ (F + G)) to
equivalent Prefix and Postfix notations.
37 . Sorting is not possible by using which of the following methods?
38 . List out few of the Application of tree data-structure?
39 . List out few of the applications that make use of Multilinked
40 . In tree construction which is the suitable efficient data
41 . What is the type of the algorithm used in solving the 8 Queens
42 . What is a spanning Tree?
43 . Does the minimum spanning tree of a graph give the shortest
distance between any 2 specified nodes?
44 . Whether Linked List is linear or Non-linear data structure?