What do you mean by Base case, Recursive case, Binding Time,
Run-Time Stack and Tail Recursion?

Answers were Sorted based on User's Feedback



What do you mean by Base case, Recursive case, Binding Time, Run-Time Stack and Tail Recursion?..

Answer / wonder surong

These terms are found in Recursion.
1.Base Case:it is the case in recursion where the answer is
known,or we can say the termination condition for a
recursion to unwind back.
For example to find Factorial of num using recursion:

int Fact(int num){

if(num==1 || num==0)//base case
return 1;
else // recursive case:
return num*Fact(num-1);
}

2.Recursive case:It is the case whcih brings us to the
closer answer.

Run Time Stack:It is a system stack us to save the frame
stack of a function every recursion or every call.
This frame stack consists of the return address,local
variables and return value if any.

Tail Recursion:The case where the function consist of
single recursive call and it is the last statement to be
executed.A tail Recursion can be replace by iteration.
The above funtion consists of tail recursion case.
where as the below function does not.

void binary(int start,int end,int el){
int mid;
if(end>start){
mid=(start+end)/2;
if(el==ar[mid])
return mid;
else{
if(el>ar[mid])
binary(mid+1,end,ele);
else
binary(start,mid-11,ele);
}
}
}

Is This Answer Correct ?    38 Yes 2 No

What do you mean by Base case, Recursive case, Binding Time, Run-Time Stack and Tail Recursion?..

Answer / 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

More Data Structures Interview Questions

What is the use of space complexity and time complexity?

0 Answers  


Which list does not allow duplicates?

0 Answers  


What do you mean by structure property in a heap?

0 Answers  


Which process places data at the back of the queue?

0 Answers  


Is Arraylist faster than Array? Why?

0 Answers   QuestPond,


Explain exception filter?

0 Answers  


Which sorting algorithm is considered the fastest?

0 Answers  


How do you find the length of an arraylist?

0 Answers  


What are the types of bulleted list?

0 Answers  


How does a selection sort work for an array?

0 Answers  


an array of size N in which every number is between 1 and N, determine if there are any duplicates in it. You are allowed to destroy the array if you like. [ I ended up giving about 4 or 5 different solutions for this, each supposedly better than the others ].

0 Answers  


What is application of data structure?

0 Answers  


Categories