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 is known as error tracking?
Define the term heap in brief.
Briefly describe the term B tree?
Illustrates the use of semaphores for the critical sections of a task?
Write down a brief note on the term recursive algorithm?
Define cohension and coupling?
Explain about a matrix and its uses with an example.
Explain about the merge sort algorithm.
Minimum number of queues required implements the priority queue?
Specify the actions which are performed when a function is called?
18,76,764
1954305 Asked
3,689
Active Tutors
1415265
Questions Answered
Start Excelling in your courses, Ask an Expert and get answers for your homework and assignments!!