Data structures use to carry out recursion
What is the data structures employed to carry out recursion?
Expert
Stack. Due to its LIFO (Last in First Out) property it remembers its 'caller' so knows whom to return when the function has to return. Recursion makes employ of system stack for storing return addresses of function calls.
Every recursive function has its equal iterative (non-recursive) function. Even when these equal iterative processes are written, explicit stack is to be employed.
What are the areas wherein data structures are applied extensively?
Define the term process?
Illustrate the difference between the stack and Queue in brief?
What is minimum number of queues required to implementing the priority queue?
What are the applications in which stacks are used?
Explain about a matrix and its uses with an example.
Explain different types of cohension?
How is the front of the queue computed?
Define the term data structure? Describe the types of data structures?
Briefly describe the term Tree database. Elucidate its common uses?
18,76,764
1953645 Asked
3,689
Active Tutors
1416715
Questions Answered
Start Excelling in your courses, Ask an Expert and get answers for your homework and assignments!!