Data Structures - Interview Questions and Answers


  1. What are the notations used in Evaluation of Arithmetic Expressions using prefix and postfix forms?
    Polish and Reverse Polish notations.
  2. Convert the expression ((A + B) * C - (D - E) ^ (F + G)) to equivalent Prefix and Postfix notations.
    1. Prefix Notation: - * +ABC ^ - DE + FG
    2. Postfix Notation: AB + C * DE - FG + ^ -
  3. Sorting is not possible by using which of the following methods? (Insertion, Selection, Exchange, Deletion)
    Sorting is not possible in 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.
  4. What are the methods available in storing sequential files ?
    1. Straight merging,
    2. Natural merging,
    3. Polyphase sort,
    4. Distribution of Initial runs.
  5. List out few of the Application of tree data-structure?
    1. The manipulation of Arithmetic expression,
    2. Symbol Table construction,
    3. Syntax analysis.
  6. List out few of the applications that make use of Multilinked Structures?
    1. Sparse matrix,
    2. Index generation.