C language

1. What pointer type is used to implement the heterogeneous linked list in C?

Answer:

Void pointer. The heterogeneous linked list contains different data types in it's nodes and we need a
link, pointer, to connect them. Since we can't use ordinary pointers for this, we use the void pointer.
Void pointer is a generic pointer type, and capable of storing pointer to any type.

2. What is the minimum number of queues needed to implement the priority queue?

Answer:

Two. One queue is used for the actual storing of data, and the other one is used for storing the
priorities.

3. Which data structure is used to perform recursion?

Answer:

The answer is Stack. Stack has the LIFO (Last In First Out) property; it remembers it's ‘caller’.
Therefore, it knows to whom it should return when the function has to return. On the other hand,
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.

4. What are some of the applications for the tree data structure?

Answer:

1- Manipulation of the arithmetic expressions.

2- Symbol table construction.
3- Syntax analysis.
5. Which data strucutres algorithm used in solving the eight Queens problem?

Answer: Backtracking