Fresherdreamjob.com

Data Structures Interview Questions

 

 

Data Structures Interview Questions

  1. What is data structure? [Answer]
  2. List out the areas in which data structures are applied extensively? [Answer]
  3. What are the major data structures used in the following areas : RDBMS, Network data model & Hierarchical data model. [Answer]
  4. If you are using C language to implement the heterogeneous linked list, what pointer type will you use? [Answer]
  5. Minimum number of queues needed to implement the priority queue? [Answer]
  6. What is the data structures used to perform recursion? [Answer]
  7. What are the notations used in Evaluation of Arithmetic Expressions using prefix and postfix forms? [Answer]
  8. Convert the expression ((A + B) *  C – (D – E) ^ (F + G)) to equivalent Prefix and Postfix notations. [Answer]
  9. Sorting is not possible by using which of the following methods? [Answer]
  10.             (a) Insertion    
                (b) Selection    
                (c) Exchange     
                (d) Deletion

  11. What are the methods available in storing sequential files ? [Answer]
  12. List out few of the Application of tree data-structure? [Answer]
  13. List out few of the applications that make use of Multilinked Structures? [Answer]
  14. In tree construction which is the suitable efficient data structure? [Answer]
  15. What is the type of the algorithm used in solving the 8 Queens problem? [Answer]
  16. In an AVL tree, at what condition the balancing is to be done? [Answer]
  17. What is the bucket size, when the overlapping and collision occur at same time? [Answer]
  18. Traverse the given tree using Inorder, Preorder and Postorder traversals. [Answer]
  19. There are 8, 15, 13, 14 nodes were there in 4 different trees. Which of them could have formed a full binary tree? [Answer]
  20. Classify the Hashing Functions based on the various methods by which the key value is found. [Answer]
  21. What are the types of Collision Resolution Techniques and the methods used in each of the type? [Answer]
  22. In RDBMS, what is the efficient data structure used in the internal storage representation? [Answer]
  23. Of the following tree structure, which is, efficient considering space and time complexities? [Answer]
    Incomplete Binary Tree
    Complete Binary Tree     
    Full Binary Tree
  24. What is a spanning Tree? [Answer]
  25. Does the minimum spanning tree of a graph give the shortest distance between any 2 specified nodes? [Answer]
  26. Which is the simplest file structure?
    Sequential

    Indexed
    Random
    [Answer]
  27. Whether Linked List is linear or Non-linear data structure? [Answer]

 

 

 

 

 


 

Contact Us | ©2009 fresherdreamjob.com