Search Interview Questions
Question: Explain the depth of recursion?
Answer: This is another recursion procedure which is the number of times the procedure is called recursively in the process of enlarging a given argument or arguments. Usually this quantity is not obvious except in the case of extremely simple recursive functions, such as FACTORIAL (N), for which the depth is N.


Question: Explain the depth of recursion?
Answer: This is another recursion procedure which is the number of times the procedure is called recursively in the process of enlarging a given argument or arguments. Usually this quantity is not obvious except in the case of extremely simple recursive functions, such as FACTORIAL (N), for which the depth is N. Source: CoolInterview.com Recursion is the simplest method for using the same procedure number of times i.e it uses the for loop it repeats until condition true.depth of recursion function in Factorial(N) is N. Source: CoolInterview.com Answered by: sharan  Date: 1/29/2010  Contact sharanThe depth of recursion basically depends on the arguments passed in the recursive calls and the no of recursive calls within the function.these recursive calls can be represented using a tree structure where the parent function call(with its own arguments ) have the recursive calls (with their own arguments)as the parents children..In this representation, the growth of the tree height with increase in N gives a bound on the depth of recursion.Also the total no of nodes will give you the depth for a particular 'n' value. Source: CoolInterview.com Answered by: ramnath  Date: 3/15/2010  Contact ramnathIf you have the better answer, then send it to us. We will display your answer after the approval Rules to Post Answers in CoolInterview.com:

Related Questions  
Explain about procedural body and computation boxes? 


How can an inductive definition be realized? 


State recursion and its different types? 


Define and describe an iterative process with general steps of flow chart? 


Given a system of N equations whose coefficient matrix A is triangular and is stored in a vector R and the right hand side vector B, this algorithm obtains the solution vector X. Sum is a temporary variable. I am M are integer variables. How to follow the algorithm? 


In Algorithmic context how would you define ?book keeping operations?? 


Explain the function SUB in algorithmic notation? 


What are the arguments present in pattern matching algorithms? 


Define string in an algorithmic notation and an example to support it? 


What are the two ways through which the Markov algorithm terminates? 


What is the general strategy for Markov Algorithm? 


The most basic tool used to express generating functions in closed form is the closed form expression for the geometric series, which is an expression of the form a+ar+ar2++arn. It can either be terminated or extended indefinitely. What are the restrictions for this geometric series? 


Name any three skills which are very important in order to work with generating functions. 


Explain about the algorithm ORD_WORDS? 


Explain the function of KWIC_Create? 


What is the general algorithm model for any recursive procedure? 


Give the difference of format between an algorithm and a sub algorithm? 


Define and state the importance of sub algorithm in computation and its relation ship with main algorithm? 


How to find median of a BST? 


How do you apply Binary Search on 2D array supposed you have 2D array with integers sorted both horizontally and vertically. If you find any occurrence of the value you are looking for you return true else false. What is the complexity? For example the 2D array could look like the following 1 4 5 6 2 5 7 9 

Please Note: We keep on updating better answers to this site. In case you are looking for Jobs, Pls Click Here Vyoms.com  Best Freshers & Experienced Jobs Website.
View All Algorithm Interview Questions & Answers  Exam Mode / Learning Mode
India News Network 