What do you mean by Base case, Recursive case, Binding Time,
Run-Time Stack and Tail Recursion?
- 2 Answers
- 29027 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
Can value be null in treemap?
Write a Program for Insert in a sorted list
Write a Program for Linked list manipulation.
State the different ways of representing expressions?
Will it create any problem if we add elements with key as user defined object into the treemap?
What is the use of heap sort?
What is the difference between the hash table and hash map?
what is traversal in linked lists?
Define an algorithm.
What is the height of binary tree?
Explain what is the type of the algorithm used in solving the 8 queens problem?
What is the difference between collection and collections?
You are given a singly linked list. How would you find out if it contains a loop or not without using temporary space?
Can treemap key null?
What is data and data types?
