a) Simulation of recursion
b) Simulation of arbitrary linked list
c) Simulation of limited resource allocation
d) Simulation of heap sort
Answer: c
Explanation: Simulation of recursion uses stack data structure. Simulation of arbitrary linked lists uses linked lists. Simulation of resource allocation uses queue as first entered data needs to be given first priority during resource allocation. Simulation of heap sort uses heap data structure.
Related Posts
What is the need for a circular queue?
What does the following Java code do?
public Object function()
{
if(isEmpty())
return -999;
else
{
Object high;
high = q[front];
return high;
}
}What is the term for inserting into a full queue known as?
In a circular queue, how do you increment the rear end of the queue?
Which of the following properties is associated with a queue?
Minimum number of queues to implement stack is ___________
Which of the following data structures can be used for parentheses matching?
Join The Discussion