CDAC Technical Questions are given below. Such CDAC questions are asked in the admission papers and the placement papers held at cdac centers.
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?
The answers will be: Following are the fields / domains / areas in which the data structures are applied extensively:
Database Management System,
Statistical analysis package,
Artificial Intelligence and Simulation
Cdac sample technical c language interview questions with solutions and answers.
3. What are the major data structures used in RDBMS, Network data model & Hierarchical data model.
Answer: Following are the major data structures used in RDBMS, Network data model and hierarchial data model.
RDBMS – Array (i.e. Array of structures)
Network data model – Graph
Hierarchical data model – Trees
4. WHich pointer type will you use if you are using C language to implement the heterogeneous linked list?
Solution / explanation: We will use a void pointer.
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. Therefore void pointer will be used here.
5. What is the minimum number of queues required to implement the priority queue?
Answer: The minimum number of queues needed is 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 are used to perform recursion because of its LIFO (Last In First Out) property it remembers its ‘caller’ and it knows whom to return whenever the function has to return. Recursion makes use of the 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.
See the Whole / complete CDAC Question test paper and placement paper here. The whole 124 questions paper is given.