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
- 30605 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
Explain what is the data structures used to perform recursion?
Why is waste sorting important?
Define heap order property?
What is adt example?
Describe the complexity of Quick Sort
How do you find the height of a binary tree?
How does a treemap work?
Does treemap preserve order?
What is heap tree in data structure?
Which is the parent class of sortedset
What are the advantages of data structure?
What is the purpose of tochararray ()?
Define in brief an array.
What is minimum depth of binary tree?
Why is hashmap faster?
