Data Structures - Interview Questions and Answers


  1. In tree construction which is the suitable efficient data structure? (Array, Linked list, Stack, Queue)
    Linked list is the suitable efficient data structure.
  2. What is the type of the algorithm used in solving the 8 Queens problem?
    Backtracking.
  3. In an AVL tree, at what condition the balancing is to be done?
    If the 'pivotal value' (or the 'Height factor') is greater than 1 or less than -1.
  4. 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.
  5. Classify the Hashing Functions based on the various methods by which the key value is found.
    1. Direct method,
    2. Subtraction method,
    3. Modulo-Division method,
    4. Digit-Extraction method,
    5. Mid-Square method,
    6. Folding method,
    7. Pseudo-random method.
  6. What are the types of Collision Resolution Techniques and the methods used in each of the type?
    1. Open addressing (closed hashing), The methods used include: Overflow block.
    2. Closed addressing (open hashing), The methods used include: Linked list, Binary tree.