Step 1: Evaluate Statement S1.
A relation schema can have multiple foreign keys. For example, a table may reference multiple other tables, each via a different foreign key. Hence, S1 is false.
Step 2: Evaluate Statement S2.
A foreign key can reference the same relation (self-referencing foreign key), as in hierarchical or recursive relationships (e.g., an \texttt{Employee} table with a \texttt{ManagerID} referencing \texttt{EmployeeID}). Hence, S2 is false.
Step 3: Conclusion.
Since both S1 and S2 are false, the correct option is (D).
LIST I | LIST II | ||
| A | Constraint | I | Clause |
| B | DDL | II | Operator |
| C | Where | III | Alter table |
| D | Like | IV | Default |
In a 4-bit ripple counter, if the period of the waveform at the last flip-flop is 64 microseconds, then the frequency of the ripple counter in kHz is ______________. {(Answer in integer)}
Consider the following C code segment:
int x = 126, y = 105;
do {
if (x > y)
x = x - y;
else
y = y - x;
} while (x != y);
printf("%d", x);
The output of the given C code segment is ____________. (Answer in integer)
The following two signed 2’s complement numbers (multiplicand \( M \) and multiplier \( Q \)) are being multiplied using Booth’s algorithm:
| Multiplicand (\( M \)) | Multiplier (\( Q \)) |
|---|---|
| 1100 1101 1110 1101 | 1010 0100 1010 1010 |
The total number of addition and subtraction operations to be performed is __________. (Answer in integer)
The maximum value of \(x\) such that the edge between the nodes B and C is included in every minimum spanning tree of the given graph is __________ (answer in integer).
Consider the following C program
The value printed by the given C program is __________ (Answer in integer).