Paper Type : General - other
C-Dac Sample quesion paper - pattern 3
Answer: 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?
Compiler Design,
Operating System,
Database Management System,
Statistical analysis package,
Numerical Analysis,
Graphics,
Artificial Intelligence,
Simulation
3. What are the major data structures used in the following areas :
RDBMS, Network data model & Hierarchical data model.
RDBMS – Array (i.e. Array of structures)
Network data model – Graph
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.
|
123
Eng