answersLogoWhite

0

a function that recalls itself again and again is called recursive relationship.

User Avatar

Wiki User

13y ago

What else can I help you with?

Related Questions

When a single entity is related to itself then the relationship is termed as?

It will be a recursive relationship.


What is a recursive relationship in databases?

A recursive relationship can be defined as A relationship that is expressed about multiple records within one table. As an example if we take an employee table then there are some employees who are supervisor and some who are being supervised. This is the relationship of Supervisor and supervisee is called a recursive relationship. More concrete definition of Recursive relationship can be A relationship between information held in a field, group of fields, or complete record and information of the same type held in one or more other occurrences of that record, or part thereof.


What is a relationship in databases?

A recursive relationship can be defined as A relationship that is expressed about multiple records within one table. As an example if we take an employee table then there are some employees who are supervisor and some who are being supervised. This is the relationship of Supervisor and supervisee is called a recursive relationship. More concrete definition of Recursive relationship can be A relationship between information held in a field, group of fields, or complete record and information of the same type held in one or more other occurrences of that record, or part thereof.


What is the recursive relationship for the function t(n) where t(n) t(n - 1) 1/n?

The recursive relationship for the function t(n) is t(n) t(n - 1) 1/n.


What is recursive association?

a recursive association - as a aggregation is a special form of association, so recursive aggregation can be called as recursive association ... AKASH SISODIYA ......IT ...


What does the word recursive mean?

Something that is recursive is something that repeats.


Are all recursive programs non recursive?

None of them is, obviously.


What is the definition of recursive?

The term recursive refers to the recurrence or repetition.


What is set difference between recursive and recursively enumerable but not recursive?

All recursive Languages are recursively enumerable. But not all the recursively enumerable languages are recursive. It is just like NP complete.


What is the recursive formula for 1 4 13 40 121?

The sequence 1, 4, 13, 40, 121 can be described by a recursive formula. The recursive relationship can be expressed as ( a_n = 3a_{n-1} + 1 ) for ( n \geq 2 ), with the initial condition ( a_1 = 1 ). This means each term is generated by multiplying the previous term by 3 and then adding 1.


A relationship between the instances of a single entity type is called a ........................?

A relationship between instances of a single entity type is called a self-relationship or recursive relationship. This type of relationship occurs when an entity is related to other instances of the same entity type within the same entity set.


Is 4 9 19 39 79 159 recursive?

no it is not recursive