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
- 30452 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
Which sorting algorithm is used in collections sort?
How does hashset maintain order?
What is the structure of an array?
What is the time complexity of arraylist and linked list?
Describe tree database.
Which data structure is used to perform recursion?
Define heap?
What is the height of binary tree?
What is impact of signed numbers on the memory?
What is stable sort?
Give a real time example of stack
Is heap sort faster than quicksort?
Is hashmap faster than arraylist?
Why do we need a data structure?
What is difference between hashmap and linkedhashmap?
