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?
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?
Show Hint
- All owners of a red car, a car made by ABC, or a red car made by ABC
- All owners of more than one car, where at least one car is red and made by ABC
- All owners of a red car made by ABC
- All red cars made by ABC
The Correct Option is C
Solution and Explanation
\[ \pi_{owner} \left( Own \bowtie \sigma_{color="red"} \left( Car \bowtie \sigma_{maker="ABC"} Make \right) \right) \]
1. Step 1: Analyze the components of the expression.
The first part \( \sigma_{maker="ABC"} Make \) selects the rows from the Make relation where the maker is "ABC."
The second part \( Car \bowtie \) natural joins the result with the Car relation, combining information about cars that are made by "ABC."
The third part \( \sigma_{color="red"} \) selects only those cars from the result where the color is "red."
The final part \( Own \bowtie \) joins the result with the Own relation, combining the data about car owners with the cars that are red and made by "ABC."
Finally, \( \pi_{owner} \) projects (selects) only the "owner" field, which gives the owners of the selected cars.
2. Step 2: Interpret the result.
The result is the list of owners of the cars that are red and made by ABC.
3. Conclusion:
This corresponds to Option (C), which states "All owners of a red car made by ABC."
Top Questions on Relational Algebra
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).- GATE DA - 2025
- 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 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 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
- 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
Let \( G \) be a simple, unweighted, and undirected graph. A subset of the vertices and edges of \( G \) are shown below.
It is given that \( a - b - c - d \) is a shortest path between \( a \) and \( d \); \( e - f - g - h \) is a shortest path between \( e \) and \( h \); \( a - f - c - h \) is a shortest path between \( a \) and \( h \). Which of the following is/are NOT the edges of \( G \)?- GATE DA - 2025
- Graph Theory