- World's Largest Collection of Interview Questions
Start Your Own website Now
Sponsored Links

Interview Questions
Our Services

Get 9,000 Interview Questions & Answers in an eBook.

  • 9500+ Pages
  • 9000 Question & Answers
  • All Tech. Categories
  • 14 MB Content

    Get it now !!

    Send your Resume to 6000 Companies

    Question :
    Explain the depth of recursion?
    Category Algorithm Interview Questions
    Rating (0.4) By 2016 users
    Added on 9/14/2009
    Views 1812
    Rate it!

    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.

    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.

    Posted by: sharan    

    Contact sharan Contact sharan

    The 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.

    Posted by: ramnath    

    Contact ramnath Contact ramnath

    It remains same depth at what depth the first recursion is called.. for example, at 5th depth if recursion is called then 5 will be its depth till recursion ends

    Posted by: anand.m.r.r    

    Contact anand.m.r.r Contact anand.m.r.r

    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.

    Posted by: madne ashok manik    

    Contact madne ashok manik Contact madne ashok manik

    If you have the better answer, then send it to us. We will display your answer after the approval.
    Rules to Post Answers in

  • There should not be any Spelling Mistakes.
  • There should not be any Gramatical Errors.
  • Answers must not contain any bad words.
  • Answers should not be the repeat of same answer, already approved.
  • Answer should be complete in itself.
  • Name :*
    Email Id :*
    Answer :*
    Verification Code Code Image - Please contact webmaster if you have problems seeing this image code Not readable? Load New Code
    Process Verification  Enter the above shown code:*
    Inform me about updated answers to this question

    Related Questions
    View Answer
    Explain about procedural body and computation boxes?
    View Answer
    How can an inductive definition be realized?
    View Answer
    State recursion and its different types?
    View Answer
    Define and describe an iterative process with general steps of flow chart?
    View Answer
    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?
    View Answer
    In Algorithmic context how would you define ?book keeping operations??
    View Answer
    Explain the function SUB in algorithmic notation?
    View Answer
    What are the arguments present in pattern matching algorithms?
    View Answer
    Define string in an algorithmic notation and an example to support it?
    View Answer
    What are the two ways through which the Markov algorithm terminates?
    View Answer
    What is the general strategy for Markov Algorithm?
    View Answer
    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?
    View Answer
    Name any three skills which are very important in order to work with generating functions.
    View Answer
    Explain about the algorithm ORD_WORDS?
    View Answer
    Explain the function of KWIC_Create?
    View Answer
    What is the general algorithm model for any recursive procedure?
    View Answer
    Give the difference of format between an algorithm and a sub algorithm?
    View Answer
    Define and state the importance of sub algorithm in computation and its relation ship with main algorithm?
    View Answer
    How to find median of a BST?
    View Answer
    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
    View Answer

    Please Note: We keep on updating better answers to this site. In case you are looking for Jobs, Pls Click Here - Best Freshers & Experienced Jobs Website.

    View ALL Algorithm Interview Questions

    User Options
    Sponsored Links

    Copyright ©2003-2015, All Rights Reserved.
    Privacy Policy | Terms and Conditions

    Download Yahoo Messenger | Placement Papers| FREE SMS | ASP .Net Tutorial | Web Hosting | Dedicated Servers | C Interview Questions & Answers

    Testing Articles | Testing Books | Testing Certifications | Testing FAQs | Testing Downloads | Testing Interview Questions | Testing Jobs | Testing Training Institutes

    Cache = 0.015625 Seconds