Interested to Buy Any Domain ? << Click Here >> for more details...
What do you mean by Base case, Recursive case, Binding Time,
Run-Time Stack and Tail Recursion?
- 2 Answers
- 30731 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
Differentiate bfs and dfs?
What are hashmaps good for?
What is difference between hashmap and linkedhashmap?
How many sorting algorithms are there?
How does selection sort work?
Write the advantage of separate chaining?
What is data and information explain with example?
What are the tasks performed while traversing a binary tree?
how to insert a new node in linked list where free node will be available?
Is map a data structure?
Given M x N matrix with sorted elements row wise and column wise, find elements?
What is stack algorithm?
How to find 3rd element from end in a linked list in one pass?
Why quicksort is faster than merge sort?
What is meant by binary tree traversal?
