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
- 30589 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 is difference between rb tree and avl tree?
What is circular queue example?
What are the advantages of selecetion sort?
What is the use of treemap?
What is dynamic array how is it created?
Describe tree rotation in avl tree.
What is meant by heap sort?
What is a bubble sort and how do you perform it?
Which is the simplest file structure? (a) Sequential (b) Indexed (c) Random (a) Sequential
What are the types of collection?
What is the method to find the complexity of an algorithm?
Can you list out the areas in which data structures are applied extensively?
Is priority queue sorted?
Why do we need a data structure?
Is bubble sort adaptive?
