What do you mean by Base case, Recursive case, Binding Time,
Run-Time Stack and Tail Recursion?
- 2 Answers
- 29826 Views
- TCS, I also Faced
- E-Mail Answers
Answer Posted / khalith
Base case: A case in recursion, in which the answer is known when the termination for a recursive condition is to unwind back.
Recursive Case: A case which returns to the answer which is closer.
Run-time Stack: A run time stack used for saving the frame stack of a function when every recursion or every call occurs.
Tail Recursion: It is a situation where a single recursive call is consisted by a function, and it is the final statement to be executed. It can be replaced by iteration.
| Is This Answer Correct ? | 9 Yes | 2 No |
Post New Answer View All Answers
What is non linear structure?
Why is it called bubble sort?
What is inserting in data structure?
Why is hashset not ordered?
Why sorting algorithms are important?
What is the best sorting technique?
What is data algorithm?
Write an algorithm to find middle element in the linked list.
Is heap sort stable?
Which is faster hashmap or treemap?
List out the basic operations that can be performed on a stack?
What are the two types of data?
Name the areas in which you can apply data structures extensively?
What is immutablelist?
What is perfect binary tree?
