31 Jan 2014

Datastructure theory set one




1.      If you are using C language to implement the heterogeneous linked list, what pointer type will you use? WIPRO
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.
2.      What is the data structures used to perform recursion? ORACLE

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.
      
3.      Minimum number of queues needed to implement the priority queue? TCS
Two. One queue is used for actual storing of data and another for storing priorities.


            Every recursive function has its equivalent iterative (non-recursive) function. Even when such equivalent iterative procedures are written, explicit stack is to be used.
6.      List out the areas in which data structures are applied extensively?         HCL
Ø  Compiler Design,
Ø  Operating System,
Ø  Database Management System,
Ø  Statistical analysis package,
Ø  Numerical Analysis,
Ø  Graphics,
Ø  Artificial Intelligence,
Ø  Simulation

1 comment: