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.
Briefly describe the term stack operation?
Explain about the process management of operating system.
Give brief description of the term Quick Sort algorithm?
List the areas in that data structures are applied extensively?
Define software engineering?
Write down some of the queue operation.
What is meant by the precision?
Illustrate the difference between the stack and Queue in brief?
Describe in brief an array. Write down the various types of array operations?
18,76,764
1945083 Asked
3,689
Active Tutors
1456805
Questions Answered
Start Excelling in your courses, Ask an Expert and get answers for your homework and assignments!!