Consider the following Python code snippet.
def f(a, b):
if (a == 0):
return b
if (a % 2 == 1):
return 2 * f((a - 1) / 2, b)
return b + f(a - 1, b)
print(f(15, 10))
The value printed by the code snippet is 160 (Answer in integer).
Step 1: Understanding the function behavior.
The function f(a, b) follows a recursive pattern.
If \( a = 0 \), it returns \( b \).
If \( a \) is odd, it halves \( a - 1 \) and multiplies the result by 2.
Otherwise, it reduces \( a \) by 1 and adds \( b \).
Step 2: Evaluating \texttt{f(15, 10).}
1. \( f(15,10) = 2 \times f(7,10) \)
2. \( f(7,10) = 2 \times f(3,10) \)
3. \( f(3,10) = 2 \times f(1,10) \)
4. \( f(1,10) = 2 \times f(0,10) \)
5. \( f(0,10) = 10 \)
6. \( f(1,10) = 2 \times 10 = 20 \)
7. \( f(3,10) = 2 \times 20 = 40 \)
8. \( f(7,10) = 2 \times 40 = 80 \)
9. \( f(15,10) = 2 \times 80 = 160 \)
Thus, the output of the program is: 160.
def f(a, b):
if (a == 0):
return b
if (a % 2 == 1):
return 2 * f((a - 1) / 2, b)
return b + f(a - 1, b)
print(f(15, 10))
The value printed by the code snippet is 160 (Answer in integer).
Consider the following ANSI C program.

The output of the program upon execution is \(\underline{\hspace{2cm}}\).
Consider the following ANSI C function:
int SomeFunction(int x, int y)
{
if ((x == 1) || (y == 1)) return 1;
if (x == y) return x;
if (x > y) return SomeFunction(x - y, y);
if (y > x) return SomeFunction(x, y - x);
} The value returned by SomeFunction(15, 255) is \(\underline{\hspace{2cm}}\).
Consider the following tables, Loan and Borrower, of a bank.

Query: \[ \pi_{\text{branchname}, \text{customername}} (\text{Loan} \bowtie \text{Borrower}) \div \pi_{\text{branchname}}(\text{Loan}) \] where \( \bowtie \) denotes natural join. The number of tuples returned by the above relational algebra query is (Answer in integer).
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');