**Data structure interview question**: For the given graph, draw the DFS and BFS?

**Data structure interview question**: Classify the Hashing Functions based on the various methods by which the key value is found.

**Answer**:

Ø Direct method,

Ø Subtraction method,

Ø Modulo-Division method,

Ø Digit-Extraction method,

Ø Mid-Square method,

Ø Folding method,

Ø Pseudo-random method.

**Data structure interview question**:What are the types of Collision Resolution Techniques and the methods used in each of the type?

**Answer**

**:**

Ø Open addressing (closed hashing),

The methods used include:

Overflow block,

Ø Closed addressing (open hashing)

The methods used include:

Linked list,

Binary tree…

**Data structure interview question**: In RDBMS, what is the efficient data structure used in the internal storage representation?

**Answer**: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.

**Data structure interview question**: Draw the B-tree of order 3 created by inserting the following data arriving in sequence – 92 24 6 7 11 8 22 4 5 16 19 20 78

## No comments:

## Post a Comment