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
- 30609 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 does arraylist remove do?
What is faster array or arraylist?
What is difference between an Array and ArrayList?
What do you mean by collision in hashing?
Which sorting is best?
What are the types of map?
How do signed and unsigned numbers affect memory?
Design a datastructure to represent the movement of a knight on a chess board
What does the term sorting refer to?
What do you mean by 2-3 tree?
Define Data Structures?
Is radix sort faster than quicksort?
What are the goals of data structure?
Explain how to find 3rd element from end in a linked list in one pass?
What are the types of collision resolution strategies in open addressing?
