Consider the following tables, Loan and Borrower, of a bank.
Query: \[ \pi_{\text{branch\_name}, \text{customer\_name}} (\text{Loan} \bowtie \text{Borrower}) \div \pi_{\text{branch\_name}}(\text{Loan}) \] where \( \bowtie \) denotes natural join. The number of tuples returned by the above relational algebra query is 1 (Answer in integer).
Consider the following tables, Loan and Borrower, of a bank.
Query: \[ \pi_{\text{branch\_name}, \text{customer\_name}} (\text{Loan} \bowtie \text{Borrower}) \div \pi_{\text{branch\_name}}(\text{Loan}) \] where \( \bowtie \) denotes natural join. The number of tuples returned by the above relational algebra query is 1 (Answer in integer).
Show Hint
Solution and Explanation
Step 1: Understanding the division operation.
The relational division operation finds the set of customers who have taken loans from all branches appearing in the Loan table.
Step 2: Extracting relevant data.
The distinct branch names from the Loan table are: Banjara Hills, Kondapur, SR Nagar, Balanagar. A customer must have taken loans from all these branches to be included in the result.
Step 3: Identifying customers who satisfy this condition.
By analyzing the Borrower table, we find that the customer Karteek has loans in Banjara Hills (L11), Kondapur (L14), SR Nagar (L22), and Balanagar (L23), satisfying the condition.
Thus, the number of tuples returned by the query is: 1
Top Questions on Relational Algebra
- Consider the following three relations:
Car (model, year, serial, color)
Make (maker, model)
Own (owner, serial)
A tuple in Car represents a specific car of a given model, made in a given year, with a serial number and a color. A tuple in Make specifies that a maker company makes cars of a certain model. A tuple in Own specifies that an owner owns the car with a given serial number. Keys are underlined; (owner, serial) together form key for Own. (\(\bowtie\) denotes natural join)
\[ \pi_{owner} \left( Own \bowtie \sigma_{color="red"} \left( Car \bowtie \sigma_{maker="ABC"} Make \right) \right) \] Which one of the following options describes what the above expression computes?- GATE DA - 2025
- Computer Science
- Relational Algebra
- Let us consider two relations HISTORY and SCIENCE as depicted in the following Tables 1 and 2 respectively:
Table 1: HISTORYSNo NAME CLASS 1 MOHAN 6A 2 SANJAY 6B 3 YOGESH 7A
Table 2: SCIENCESNo NAME CLASS 1 NARESH 6B 2 SANJAY 6B 3 YOGESH 7A
What is the output of HISTORY - SCIENCE?- CUET (UG) - 2023
- Computer Science
- Relational Algebra
- Which of the following statement(s) is/are true?
A. Selection operation yields horizontal subset of a relation.
B. Selection operation yields vertical subset of a relation.
C. Union operator can work on relation with different degree.
D. Intersection and Cartesian product operations are not binary.
E. A record is a column on a datasheet.- CUET (UG) - 2023
- Computer Science
- Relational Algebra
- Let us consider two relations Student and Major as shown in Table 1 and Table 2 respectively.
Table 1 : StudentTable 2 : MajorSr No. Name Course 1. Aman CS 2. Ravi ECO 3. Mohit HIS 4. Sanjay MATH How many Tuples will be in the result table after Student U Major operation.Sr.No Name Course 1. Sanjay MATH 2. Abhay ENG 3. Sita HINDI 4. Aman CS 5. Ravi ECO - CUET (UG) - 2023
- Computer Science
- Relational Algebra
Questions Asked in GATE DA exam
- Consider the following pseudocode.
Create empty stack S Set x = 0, flag = 0, sum = 0 Push x onto S while (S is not empty){ if (flag equals 0){ Set x = x + 1 Push x onto S } if (x equals 8): Set flag = 1 if (flag equals 1){ x = Pop(S) if (x is odd): Pop(S) Set sum = sum + x } } Output sumThe value of \( sum \) output by a program executing the above pseudocode is:- GATE DA - 2025
- Data Structures
- Given the equation: $$ 3^{x^2} = 27 \times 9^x $$ Find the value of: $$ \frac{2^{x^2}}{(2^x)^2} $$
- GATE DA - 2025
- Algebra
Consider a directed graph \( G = (V,E) \), where \( V = \{0,1,2,\dots,100\} \) and
\[ E = \{(i,j) : 0 < j - i \leq 2, \text{ for all } i,j \in V \}. \] Suppose the adjacency list of each vertex is in decreasing order of vertex number, and depth-first search (DFS) is performed at vertex 0. The number of vertices that will be discovered after vertex 50 is:- GATE DA - 2025
- Data Structures
- 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).- GATE DA - 2025
- Recursion
- Let \( D = \{ x^{(1)}, x^{(2)}, \dots, x^{(n)} \} \) be a dataset of \( n \) observations where each \( x^{(i)} \in \mathbb{R}^{100} \). It is given that
\[ \sum_{i=1}^{n} x^{(i)} = 0. \] The covariance matrix computed from \( D \) has eigenvalues \( \lambda_i = 100^2 - i \), for \( 1 \leq i \leq 100 \). Let \( u \in \mathbb{R}^{100} \) be the direction of maximum variance with \( u^T u = 1 \). The value of
\[ \frac{1}{n} \sum_{i=1}^{n} \left( u^T x^{(i)} \right)^2 = \underline{\hspace{2cm}} \quad \text{(Answer in integer)} \]- GATE DA - 2025
- Matrix algebra