Consider the relational database with the following four schemas and their respective instances: \[ \text{Student(sNo, sName, dNo)} \text{ }\text{Dept(dNo, dName)} \\ \text{Course(cNo, cName, dNo)} \text{ } \text{Register(sNo, cNo)} \]

SQL Query:
SELECT * FROM Student AS S WHERE NOT EXIST
(SELECT cNo FROM Course WHERE dNo = “D01”
EXCEPT
SELECT cNo FROM Register WHERE sNo = S.sNo) The number of rows returned by the above SQL query is___________.
SQL Query: \[ \text{SELECT FROM Student AS S WHERE NOT EXIST} \] \[ \left( \text{SELECT cNo FROM Course WHERE dNo = "D01"} \right) \] \[ \text{EXCEPT SELECT cNo FROM Register WHERE sNo = S.sNo} \] The number of rows returned by the above SQL query is: \[ \boxed{2}. \]


On a relation named Loan of a bank: 
On a relation named Loan of a bank: 
The following SQL query is executed:
SELECT L1.loannumber FROM Loan L1 WHERE L1.amount \(>\) (SELECT MAX(L2.amount) FROM Loan L2 WHERE L2.branchname = 'SR Nagar');
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).