GeekInterview.com
  I am new, Sign me up!
 
GeekInterview.com  >  Interview Questions  >  Concepts  >  Data Structures
Go To First  |  Previous Question  |  Next Question 
 Data Structures  |  Question 186 of 202    Print  
Recursive Algorithm
Explain how recursive algorithm is converted into recurrence relation with example.


  
Total Answers and Comments: 1 Last Update: May 30, 2008     Asked by: subindas 
  
 Sponsored Links

 
 Best Rated Answer
—

No best answer available. Please pick the good answer available or submit your answer.
February 27, 2009 12:49:19   #1  
riteshja88 Member Since: February 2009   Contribution: 1    
RE: Recursive Algorithm
Say we want to represent the following recursion

int recurse(int a)
{
return a+recurse(a-1);
}

x {x|x a(a+1)/2} for all a

 
Is this answer useful? Yes | No

 Related Questions

which of the following is not primitive recursive but computable ? 1. Carnot function 2. Riemann function 3. Bounded function 4. Ackermann function 
View Question | Asked by : Rujul
I had following question paper for data structures on 29th Oct, 2007. There were total 10 questions in the engineering paper to be done in 1 hr. I remember only 9 of those:1. A binary search tree was given. 
Latest Answer : Ans for 1: The node number 4 contains the 4th smallest value. ...
Explain how performance of algorithm is analysed? 
Latest Answer : The performance of an algorithm is analysed by the time complexity as well as its space complexity though both the complexities are trafe-offs between them. If time complexity increases then space complexity decreases & vice-versa. Also the best & ...
Read Answers (1) | Asked by : subindas
Explain how recursive algorithm is converted into recurrence relation with example. 
Latest Answer : Say we want to represent the following recursionint recurse(int a){       return a+recurse(a-1);}x={x|x=a(a+1)/2} for all a ...
Read Answers (1) | Asked by : subindas
Write an algorithm to calculate the number of items in a static queue? 
Latest Answer : [F=front, R=rear, P= pointer, q[] is the array variable] Algorithm:      if F != R       P= F       count = 0        while(P

 Sponsored Links

 
Related Articles

Breaking up XML into Relational Data

Breaking up XML into Relational Data While the preceding example shows how to construct an XML representation over relational data the example in this section illustrates how you can shred XML data back into relational data This reverse operation can be useful if your application works with relation
 

Querying Data with Oracle XQuery

Querying Data with Oracle XQuery Starting with Oracle Database 10g Release 2 you can take advantage of a full featured native XQuery engine integrated with the database With Oracle XQuery you can accomplish various tasks involved in developing PHP Oracle XML applications operating on any kind of dat
 

Retrieving XML Data

Retrieving XML DataTo retrieve XML data from an XMLType table you can use a SELECT SQL statement just as you would if you had to query a relational table For example to select the employee with the id set to 100 from the employees XMLType table discussed in the preceding section you might issue the
 

Using XMLType for Handling XML Data in the Database

Using XMLType for Handling XML Data in the Database Being an object type XMLType can not only be used to store XML data in the database but also to operate on that data via its built in methods Regardless of the storage model you choose XMLType provides a set of XML specific methods to operate on XM
 

Using Oracle Database for Storing, Modifying, and Retrieving XML Data

Using Oracle Database for Storing Modifying and Retrieving XML Data With Oracle XML DB you have various XML storage and XML processing options allowing you to achieve the required level of performance and scalability One of the most interesting things about Oracle XML DB is that it allows you to per
 

ODP.NET - Techniques to Improve Performance while Retrieving Data

ODP NET Techniques to Improve Performance while Retrieving Data Performance tuning is a great subject in Oracle Volumes of books would not be enough to cover every aspect of performance tuning in Oracle However in this section we will only discuss the fundamental performance techniques while working
 

ODP.NET - Populating a Dataset with a Single Data Table

ODP NET Populating a Dataset with a Single Data Table A dataset is simply a group of data tables These data tables can be identified with their own unique names within a dataset You can also add relations between data tables available in a dataset mosgoogle The following code gives you the details o
 

ODP.NET - Retrieving Typed Data

ODP NET Retrieving Typed Data While retrieving values from OracleDataReader we can extract information available in individual columns of a particular row either by using column ordinal position values or column names mosgoogle Retrieving Typed Data Using Ordinals ODP NET provides data specific enum
 

ODP.NET - Retrieving Data Using OracleDataReader

ODP NET Retrieving Data Using OracleDataReader OracleDataReader is simply a read only and forward only result set It works only if the database connection is open and it makes sure that the connection is open while you are retrieving data As the data that it retrieves is read only it is a bit faster
 

ODP.NET - Fundamental ODP.NET Classes to Retrieve Data

ODP NET Fundamental ODP NET Classes to Retrieve Data To retrieve data from an Oracle database using ODP NET we need to work with a few of the ODP NET classes At this point we will discuss the most fundamental classes available in ODP NET for retrieving data mosgoogle The following is the list of fun
 

About Us -  Privacy Policy -  Terms and Conditions -  Contact -  Ask Question -  Propose Category -  Site Updates 

Copyright © 2005 - 2009 GeekInterview.com. All Rights Reserved

Page copy protected against web site content infringement by Copyscape