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
- 30492 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
Does arraylist allow null values?
What do you mean by level of the tree?
What is priority queue in data structure?
Differentiate null and void?
List some applications of queue data structure.
Can we add heterogeneous elements into treemap?
Write an algorithm to show the reverse of link list?
Is treemap synchronized?
What is a node in it?
What is the relationship between a queue and its underlying array?
What are the major data structures used in the following areas : network data model & hierarchical data model?
Why would we use dynamically allocated arrays vs vectors?
What is map data structure?
Why linked lists are better than arrays?
How will you free the memory that is allocated at run time?
