• Data Structures - Section 1
11.  What are the notations used in Evaluation of Arithmetic Expressions using prefix and postfix forms?

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

13.  Sorting is not possible by using which of the following methods? (Insertion, Selection, Exchange, Deletion)

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

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

16.  In tree construction which is the suitable efficient data structure? (Array, Linked list, Stack, Queue)

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

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

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

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