Interview Questions - Data Structures
17.
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.
18.
What are the types of Collision Resolution Techniques and the methods used in each of the type?
- Open addressing (closed hashing), The methods used include: Overflow block.
- Closed addressing (open hashing), The methods used include: Linked list, Binary tree.
19.
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.
20.
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.
Quick links
Quantitative Aptitude
Verbal (English)
Reasoning
Programming
Interview
Placement Papers