Register

UGC NET CSE | June 2007 | Part 2 | Question: 17

• edited by
540 views

1 Answer

0 votes
0 votes

The recursive foreign key is the key which refers back to the same table i.e. the foreign key is in the same table. So Parent and child table is the same.

For example :

Let's have a table Employee having to fields empID and managedbyempID, this both fields contain the employee id's(Both are employees)  from the same table. One act as a primary key and another one will act as a recursive foreign key.  

User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1 votes
1 votes
1 answer
1
go_editor asked Mar 28, 2020
478 views
UGC NET CSE | June 2007 | Part 2 | Question: 1
The following determiniotic finite automata recognizes: Set of all strings containing $’ab’$ Set of all strings containing $’aab’$ Set of all strings ending in $’abab’$ None of the above
The following determiniotic finite automata recognizes:Set of all strings containing $’ab’$Set of all strings containing $’aab’$Set of all strings ending in $’a...
User Avatar
0 votes
0 votes
0 answers
2
go_editor asked Mar 28, 2020
709 views
UGC NET CSE | June 2007 | Part 2 | Question: 2
Depth ion travels of the following directed graph is: $\text{A B C D E F}$ $\text{A B D E F C}$ $\text{A C E B D F}$ None of the above
Depth ion travels of the following directed graph is:$\text{A B C D E F}$$\text{A B D E F C}$$\text{A C E B D F}$None of the above
User Avatar
0 votes
0 votes
0 answers
3
go_editor asked Mar 28, 2020
1,163 views
UGC NET CSE | June 2007 | Part 2 | Question: 3
The maximum number of nodes in a binary tree of depth $10$: $1024$ $2^{10}-1$ $1000$ None of the above
The maximum number of nodes in a binary tree of depth $10$:$1024$ $2^{10}-1$ $1000$None of the above
User Avatar
1 votes
1 votes
1 answer
4
go_editor asked Mar 28, 2020
1,277 views
UGC NET CSE | June 2007 | Part 2 | Question: 4
The regular expression given below describes: $r=(1+01)$*$(0+\lambda)$ Set of all string not containing $’11’$ Set of all string not containing $’00’$ Set of all string containing $’01’$ Set of all string ending in $’0’$
The regular expression given below describes:$r=(1+01)$*$(0+\lambda)$Set of all string not containing $’11’$Set of all string not containing $’00’$Set of all stri...
User Avatar
Link Copied!