Data Structures

1.      What is a data structure?

2.      List out the areas in which data structures are applied extensively

3.     What are the major data structures used in the following areas : RDBMS, Network data model & Hierarchical data model.

4.     If you are using C language to implement the heterogeneous linked list, what pointer type will you use?

5.     Minimum number of queues needed to implement the priority queue?

6.     What is the data structures used to perform recursion?

7.     What are the notations used in Evaluation of Arithmetic Expressions using prefix and postfix forms?

8.     Convert the expression ((A + B) *  C – (D – E) ^ (F + G)) to equivalent Prefix and Postfix notations.

9.     Sorting is not possible by using which of the following methods?

            (a) Insertion    

            (b) Selection    

            (c) Exchange     

            (d) Deletion

10.   A binary tree with 20 nodes has            null branches?

11.   What are the methods available in storing sequential files ?

12.   How many different trees are possible with 10 nodes ?

13.   List out few of the Application of tree data-structure?

14.   List out few of the applications that make use of Multilinked Structures?

15.   In tree construction which is the suitable efficient data structure?

16.  What is the type of the algorithm used in solving the 8 Queens problem?

17.  In an AVL tree, at what condition the balancing is to be done?

18.  What is the bucket size, when the overlapping and collision occur at same time?

19.  There are 8, 15, 13, 14 nodes were there in 4 different trees. Which of them could have formed a full binary tree?

20.  Sort the given values using Quick Sort?

                         65, 70, 75, 80, 85, 60, 55, 50,45

21.  For the given graph, draw the DFS and BFS?

22.  Classify the Hashing Functions based on the various methods by which the key value is found.

23.  What are the types of Collision Resolution Techniques and the methods used in each of the type?

24.  In RDBMS, what is the efficient data structure used in the internal storage representation?

25.  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

24.   26.  Of the following tree structure, which is, efficient considering space and time complexities?

(a)   Incomplete Binary Tree

(b)   Complete Binary Tree     

(c)    Full Binary Tree

27.  What is a spanning Tree?

28.  Does the minimum spanning tree of a graph give the shortest distance between any two specified nodes?

29.  Which is the simplest file structure?

(a)   Sequential

(b)   Indexed

(c)    Random

30.  Whether Linked List is linear or Non-linear data structure?

31.  Draw a binary Tree for the expression :

            A * B - (C + D) * (P / Q)

   

Google
 
Web freshersworld.com