# Best Data Structures Questions and Answers for Written Test

Here is an amazing guide on Data Structures Questions and Answers for Written Test for interview and exam preparation.

## Data Structures Questions and Answers for Written Test

• Data structures are necessary for all aspects involving data, including numerical analyses for operating platforms, compilers, database management, graphics, statistics, and statistics.

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

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

Sparse matrix,
Index generation

Backtracking

### What is the bucket size, when the overlapping and collision occur at same time?

One. If there is only one entry possible in the bucket, when the collision occurs,
there is no way to accommodate the colliding value. This results in the overlapping of
values.

### Classify the Hashing Functions based on the various methods by which the key value is found.

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

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

### Does the minimum spanning tree of a graph give the shortest distance between any 2 specified nodes?

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

### Whether Linked List is linear or Non-linear data structure?

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

### What is a Randomized Algorithm?

We call an algorithm randomized if its behavior is determined not only by its input but also by values produced by a random-number generator.

### What is Heap Data structure?

The (binary) heap data structure is an array object that can be viewed as a nearly complete binary tree. Each node of the tree corresponds to an element of the array that stores the value in the node.

### What is a hash table?

A hash table is an effective data structure for implementing dictionaries. The expected time to search for an element in a hash table is O(1). A hash table is a generalization of the simple notion of an ordinary array.