Data Structure Interview Questions And Answers on algorithm for viva and freshers

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.

=>Compiler Design,
=> Operating System,
=> Database Management System,
=> Statistical analysis package,
=> Numerical Analysis,
=> Graphics,
=> Artificial Intelligence,
=> Simulation

=>RDBMS - Array (i.e. Array of structures)
=>Network data model – Graph
=>Hierarchical data model – Trees

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. .

Two. One queue is used for actual storing of data and another for storing priorities. .

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.

Polish and Reverse Polish notations.

Prefix Notation: ^ - * +ABC - DE + FG Postfix Notation: AB + C * DE - - FG + ^

(d) Deletion.
Using insertion we can perform insertion sort, using selection we can perform selection sort, using exchange we can perform the bubble sort (and other similar sorting methods). But no sorting method can be done just using deletion.

a>Straight merging,
b> Natural merging,
c> Polyphase sort,
d> Distribution of Initial runs.

a>The manipulation of Arithmetic expression,
b> Symbol Table construction,
c> Syntax analysis.

a> Sparse matrix,
b> Index generation.

(b) Linked list

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.

No. minimum spanning tree of a graph give the shortest distance between any 2 specified node Minimal spanning tree assures that the total weight of the tree is kept at its minimum. But it doesn’t mean that the distance between any two nodes involved in the minimum-spanning tree is minimum.

(a) Sequential

According to Access strategies Linked list is a linear one.
According to Storage Linked List is a Non-linear one.

(b) Complete Binary Tree.
By the method of elimination:
Full binary tree loses its nature when operations of insertions and deletions are done. For incomplete binary trees, extra storage is required and overhead of NULL node checking takes place. So complete binary tree is the better one since the property of complete binary tree is maintained even after operations like additions and deletions are done on it.

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.

a> Open addressing (closed hashing), The methods used include:
Overflow block,
b> Closed addressing (open hashing) The methods used include:
Linked list,
Binary tree…

=> Subtraction method,
=> Modulo-Division method,
=>Digit-Extraction method,
=> Mid-Square method,
=> Folding method,
=> Pseudo-random method.
=> Direct method,

If the ‘pivotal value’ (or the ‘Height factor’) is greater than 1 or less than –1.