1. What is data structure?
A data structure is a way of organizing data that considers not only the items stored, but also their
relationship to each other. Advance knowledge about the relationship between data items allows
designing of efficient algorithms for the manipulation of data.
2. List out the areas in which data structures are applied extensively?
2.1 .Compiler Design,
2.2 .Operating System,
2.3 .Database Management System,
2.4 .Statistical analysis package,
2.5 .Numerical Analysis,
2.6 .Graphics,
2.7 .Artificial Intelligence,
2.8 .Simulation
3. What are the major data structures used in the following areas : RDBMS, Network data
model and Hierarchical data model.
2.9 .RDBMS = Array (i.e. Array of structures)
2.1 0. Network data model = Graph
2.1 1. Hierarchical data model = Trees
4. If you are using C language to implement the heterogeneous linked list, what pointer
type will you use?
The heterogeneous linked list contains different data types in its nodes and we need a link, pointer to
connect them. It is not possible to use ordinary pointers for this. So we go for void pointer. Void
pointer is capable of storing pointer to any type as it is a generic pointer type.
5. Minimum number of queues needed to implement the priority queue?
Two. One queue is used for actual storing of data and another for storing priorities.
6. What is the data structures used to perform recursion?
Stack. Because of its LIFO (Last In First Out) property it remembers its 'caller' so knows whom to
return when the function has to return. Recursion makes use of system stack for storing the return
addresses of the function calls.
Every recursive function has its equivalent iterative (non-recursive) function. Even when such
equivalent iterative procedures are written, explicit stack is to be used.
7. What are the notations used in Evaluation of Arithmetic Expressions using prefix and
postfix forms?
Polish and Reverse Polish notations.
8. Convert the expression ((A + B) * C - (D - E) ^ (F + G)) to equivalent Prefix and Postfix
notations.
8.1 . Prefix Notation: - * +ABC ^ - DE + FG
8.2 . Postfix Notation: AB + C * DE - FG + ^ -
