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
- 30719 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 are arrays used for?
What is bubble sort and quick sort?
What is data and data types?
How to traverse data in a linked list in forward and backward direction, write the algorithm?
What is the complexity of selection sort?
Can we store null in arraylist?
What is example of data?
Describe the complexity of Binary search
Is arraylist synchronized?
Is stack a dynamic data structure?
Who invented data structure?
How do you sort an arraylist in descending order?
How many types of arrays are there in visual basic?
What is mean by sorting?
Define 2-3-4 tree?
