|
Data Structures Interview Questions and Answers
What is data structure?
A data structure is a way of organizing data that considers not only the items
stored, but also their relationship to each other. Advance knowledge about the
relationship between data items allows designing of efficient algorithms for the
manipulation of data.
List out the areas in which
data structures are applied extensively?
Compiler Design, Operating System, Database Management System, Statistical
analysis package, Numerical Analysis, Graphics, Artificial Intelligence,
Simulation
If you are using C language
to implement the heterogeneous linked list, what pointer type will you use?
The heterogeneous linked list contains different data types in its nodes and we
need a link, pointer to connect them. It is not possible to use ordinary
pointers for this. So we go for void pointer. Void pointer is capable of storing
pointer to any type as it is a generic pointer type.
What is the data structures
used to perform recursion?
Stack. Because of its LIFO (Last In First Out) property it remembers its caller,
so knows whom to return when the function has to return. Recursion makes use of
system stack for storing the return addresses of the function calls. Every
recursive function has its equivalent iterative (non-recursive) function. Even
when such equivalent iterative procedures are written, explicit stack is to be
used.
What are the methods
available in storing sequential files ?
Straight merging, Natural merging, Polyphase sort, Distribution of Initial
runs.
List out few of the
Application of tree data-structure?
The manipulation of Arithmetic expression, Symbol Table construction, Syntax
analysis.
In RDBMS, what is the
efficient data structure used in the internal storage representation?
B+ tree. Because in B+ tree, all the data is stored only in leaf nodes, that
makes searching easier. This corresponds to the records that shall be stored in
leaf nodes.
What is a spanning Tree?
A spanning tree is a tree associated with a network. All the nodes of the graph
appear on the tree once. A minimum spanning tree is a spanning tree organized so
that the total edge weight between nodes is minimized.
Page Numbers :
1
2
3
4
5
6
7
Have a Question ?
post your questions here. It
will be answered as soon as possible.
Check
Structs Interview
Questions for more Structs Interview Questions with answers
Check
Object Oriented Interview
Questions for more Object Oriented Interview Questions with answers
|
