Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged relational-algebra
1
votes
2
answers
271
Given two R union compatible relation R1 (A, B) and R2 (C, D) what is the result of the operation
Given two R union compatible relation R1 (A, B) and R2 (C, D) what is the result of the operation R1 A= C AB = D R2? a) R1⋃R2 b) R1 ⨯ R2 c) R1 – R2 d) R1 ∩R2 How to solve these kind of questions
Given two R union compatible relation R1 (A, B) and R2 (C, D) what is the result of the operationR1 A= C AB = D R2?a) R1⋃R2 b) R1 ⨯ R2 ...
Sara
6.9k
views
Sara
asked
Dec 24, 2015
Databases
relational-algebra
+
–
2
votes
1
answer
272
relational algebra
THE DIFFERENCE BETWEEN FOLLOWING 2 EXPRESSIONS? a. (selection)year≥2009(takes) NATURAL JOIN student b. (selection)year≥2009(takes NATURAL JOIN student)
THE DIFFERENCE BETWEEN FOLLOWING 2 EXPRESSIONS?a. (selection)year≥2009(takes) NATURAL JOIN studentb. (selection)year≥2009(takes NATURAL JOIN student)
Amey
503
views
Amey
asked
Dec 22, 2015
Databases
databases
relational-algebra
+
–
5
votes
4
answers
273
division in relational algebra confirm plz
Suppose that cardinalities of relations $A$ and $B$ are $m$ and $n$ respectively, then the maximum cardinality of the resultant relation $A \div B$ is ($A$ divides $B$) (A) $m$ (B) $m-n$ (C) $\left \lceil {\frac{m}{n}} \right \rceil$ (D) $\left \lfloor {\frac{m}{n}} \right \rfloor$
Suppose that cardinalities of relations $A$ and $B$ are $m$ and $n$ respectively, then the maximum cardinality of the resultant relation $A \div B$ is ($A$ divides $B$)(A...
yes
2.2k
views
yes
asked
Dec 16, 2015
Databases
databases
relational-algebra
+
–
27
votes
3
answers
274
TIFR CSE 2013 | Part B | Question: 19
In a relational database there are three relations: $Customers = C\textsf{(CName)}$, $Shops = S \textsf{(SName)}$, $Buys = B\textsf{(CName, SName)}$ ... $S - \Pi _{\textsf{SName}}((C \times S) - B)$ None of the above
In a relational database there are three relations:$Customers = C\textsf{(CName)}$,$Shops = S \textsf{(SName)}$,$Buys = B\textsf{(CName, SName)}$.Which of the following r...
makhdoom ghaya
3.3k
views
makhdoom ghaya
asked
Nov 8, 2015
Databases
tifr2013
databases
relational-algebra
+
–
1
votes
2
answers
275
Total number of tuples
resuscitate
1.6k
views
resuscitate
asked
Nov 2, 2015
Databases
databases
relational-algebra
+
–
12
votes
3
answers
276
GATE CSE 1997 | Question: 76-a
Consider the following relational database schema: EMP (eno name, age) PROJ (pno name) INVOLVED (eno, pno) EMP contains information about employees. PROJ about projects and involved about which employees involved in which projects. The underlined ... which is equivalent to SQL query. select eno from EMP|INVOLVED where EMP.eno=INVOLVED.eno and INVOLVED.pno=3
Consider the following relational database schema:EMP (eno name, age)PROJ (pno name)INVOLVED (eno, pno)EMP contains information about employees. PROJ about projects and i...
go_editor
6.2k
views
go_editor
asked
Oct 15, 2015
Databases
gate1997
databases
sql
relational-algebra
descriptive
+
–
39
votes
5
answers
277
TIFR CSE 2010 | Part B | Question: 33
In a relational database there are three relations: $Customers = C \textsf{(CName)}$ $Shops = S \textsf{(SName)}$ $Buys = B \textsf{(CName, SName)}$ Then the Relational Algebra expression ( $\Pi $ ... from at least two shops. Customers who buy from all shops. Customers who do not buy buy anything at all. None of the above.
In a relational database there are three relations:$Customers = C \textsf{(CName)}$$Shops = S \textsf{(SName)}$$Buys = B \textsf{(CName, SName)}$Then the Relational Algeb...
makhdoom ghaya
3.7k
views
makhdoom ghaya
asked
Oct 10, 2015
Databases
tifr2010
databases
relational-algebra
+
–
5
votes
4
answers
278
Why is the maximum number of tuples in full outer join equal to m*n ?
Why is the maximum number of tuples in full outer join equal to m*n, where m is the number of attributes in one relation and n is the attribute count in other ? Can someone give an example to illustrate this ?
Why is the maximum number of tuples in full outer join equal to m*n, where m is the number of attributes in one relation and n is the attribute count in other ?Can someon...
learncp
3.4k
views
learncp
asked
Sep 5, 2015
Databases
databases
relational-algebra
+
–
42
votes
2
answers
279
GATE CSE 2015 Set 1 | Question: 7
SELECT operation in SQL is equivalent to The selection operation in relational algebra The selection operation in relational algebra, except that SELECT in SQL retains duplicates The projection operation in relational algebra The projection operation in relational algebra, except that SELECT in SQL retains duplicates
SELECT operation in SQL is equivalent toThe selection operation in relational algebraThe selection operation in relational algebra, except that SELECT in SQL retains dupl...
makhdoom ghaya
11.2k
views
makhdoom ghaya
asked
Feb 12, 2015
Databases
gatecse-2015-set1
databases
sql
relational-algebra
easy
+
–
2
votes
4
answers
280
True or False: Relational algebra cannot perform aggregate function
True or False: Relational algebra cannot perform aggregate function
True or False: Relational algebra cannot perform aggregate function
Keith Kr
2.3k
views
Keith Kr
asked
Jan 31, 2015
Databases
relational-algebra
normal
+
–
54
votes
4
answers
281
GATE IT 2005 | Question: 68
A table 'student' with schema (roll, name, hostel, marks), and another table 'hobby' with schema (roll, hobbyname) contains records as shown below: ... between the number of rows output by the SQL statement and the number of tuples in $S'$ is $6$ $4$ $2$ $0$
A table 'student' with schema (roll, name, hostel, marks), and another table 'hobby' with schema (roll, hobbyname) contains records as shown below:$$\overset{\text{Table:...
Ishrat Jahan
10.8k
views
Ishrat Jahan
asked
Nov 3, 2014
Databases
gateit-2005
databases
sql
relational-algebra
normal
+
–
30
votes
5
answers
282
GATE IT 2006 | Question: 15
Which of the following relational query languages have the same expressive power? Relational algebra Tuple relational calculus restricted to safe expressions Domain relational calculus restricted to safe expressions II and III only I and II only I and III only I, II and III
Which of the following relational query languages have the same expressive power?Relational algebraTuple relational calculus restricted to safe expressionsDomain relation...
Ishrat Jahan
9.2k
views
Ishrat Jahan
asked
Oct 31, 2014
Databases
gateit-2006
databases
relational-algebra
relational-calculus
easy
+
–
60
votes
4
answers
283
GATE IT 2007 | Question: 68
Consider the following relation schemas : b-Schema = (b-name, b-city, assets) a-Schema = (a-num, b-name, bal) d-Schema = (c-name, a-number) Let branch, account and depositor be respectively instances of the above schemas. Assume that account and ... depositor) Пc-name (σb-city = "Agra" branch ⋈ (σb-city = "Agra" ⋀ bal < 0 account ⋈ depositor))
Consider the following relation schemas :b-Schema = (b-name, b-city, assets)a-Schema = (a-num, b-name, bal)d-Schema = (c-name, a-number)Let branch, account and depositor ...
Ishrat Jahan
13.0k
views
Ishrat Jahan
asked
Oct 30, 2014
Databases
gateit-2007
databases
joins
relational-algebra
normal
+
–
35
votes
2
answers
284
GATE CSE 1996 | Question: 27
A library relational database system uses the following schema USERS (User#, User Name, Home Town) BOOKS (Book#, Book Title, Author Name) ISSUED (Book#, User#, Date) Explain in one English sentence, what each of the following relational algebra queries is ...
A library relational database system uses the following schemaUSERS (User#, User Name, Home Town)BOOKS (Book#, Book Title, Author Name)ISSUED (Book#, User#, Date)Explain ...
Kathleen
5.4k
views
Kathleen
asked
Oct 9, 2014
Databases
gate1996
databases
relational-algebra
descriptive
+
–
24
votes
3
answers
285
GATE CSE 1995 | Question: 27
Consider the relation scheme. ... for the publisher with PNAME='TECHNICAL PUBLISHERS'. Get the names of all authors who have published a book for any publisher located in Madras
Consider the relation scheme.$$\begin{array}{ll} \text{AUTHOR} & \text{(ANAME, INSTITUTION, ACITY, AGE)} \\\hline \text{PUBLISHER} & \text{(PNAME, PCITY)} \\\hline \te...
Kathleen
4.5k
views
Kathleen
asked
Oct 8, 2014
Databases
gate1995
databases
relational-algebra
normal
descriptive
+
–
18
votes
3
answers
286
GATE CSE 1994 | Question: 13
Consider the following relational schema: COURSES (cno, cname) STUDENTS (rollno, sname, age, year) REGISTERED_FOR (cno, rollno) The underlined attributes indicate the primary keys for the relations. The year' attribute for the STUDENTS relation indicates the year in ... for cno $322.$ Write a SQL query to print the age and year of the youngest student in each year.
Consider the following relational schema:COURSES (cno, cname)STUDENTS (rollno, sname, age, year)REGISTERED_FOR (cno, rollno)The underlined attributes indicate the primary...
Kathleen
6.4k
views
Kathleen
asked
Oct 5, 2014
Databases
gate1994
databases
relational-algebra
sql
normal
descriptive
+
–
26
votes
5
answers
287
GATE CSE 1994 | Question: 3.8
Give a relational algebra expression using only the minimum number of operators from $(∪, −)$ which is equivalent to $R$ $∩$ $S.$
Give a relational algebra expression using only the minimum number of operators from $(∪, −)$ which is equivalent to $R$ $∩$ $S.$
Kathleen
7.0k
views
Kathleen
asked
Oct 5, 2014
Databases
gate1994
databases
relational-algebra
normal
descriptive
+
–
97
votes
11
answers
288
GATE CSE 2007 | Question: 59
Information about a collection of students is given by the relation $\text{studInfo(}\underline{\text{studId}},\text{ name, sex)}$. The relation $\text{enroll(}{\text{studId}},{\text{ courseId}})$ gives which student has enrolled for ... Courses in which a proper subset of female students are enrolled. Courses in which only male students are enrolled. None of the above
Information about a collection of students is given by the relation $\text{studInfo(}\underline{\text{studId}},\text{ name, sex)}$. The relation $\text{enroll(}{\text{stu...
Aravind
20.8k
views
Aravind
asked
Oct 4, 2014
Databases
gatecse-2007
databases
relational-algebra
normal
+
–
47
votes
4
answers
289
GATE CSE 2012 | Question: 43
Suppose $R_{1} (\underline{A}, B)$ and $R_{2} (\underline{C}, D) $ are two relation schemas. Let $r_{1}$ and $r_{2}$ be the corresponding relation instances. $B$ is a foreign key that refers to $C$ in $R_{2}$. If data in $r_{1}$ and $r_{2}$ satisfy referential ... $\prod_{B}(r_{1}) = \prod _{C}(r_{2})$ $\prod_{B}(r_{1}) - \prod _{C}(r_{2}) \neq \varnothing$
Suppose $R_{1} (\underline{A}, B)$ and $R_{2} (\underline{C}, D) $ are two relation schemas. Let $r_{1}$ and $r_{2}$ be the corresponding relation instances. $B$ is a for...
Arjun
11.3k
views
Arjun
asked
Sep 29, 2014
Databases
gatecse-2012
databases
relational-algebra
normal
+
–
61
votes
3
answers
290
GATE CSE 2014 Set 3 | Question: 30
Consider the relational schema given below, where eId of the relation dependent is a foreign key referring to empId of the relation employee. Assume that every employee has at least one associated dependent in the dependent relation. employee (empId, ... is greater than that of some dependent. all dependents. some of his/her dependents. all of his/her dependents.
Consider the relational schema given below, where eId of the relation dependent is a foreign key referring to empId of the relation employee. Assume that every employee h...
go_editor
13.8k
views
go_editor
asked
Sep 28, 2014
Databases
gatecse-2014-set3
databases
relational-algebra
normal
+
–
43
votes
3
answers
291
GATE CSE 2014 Set 3 | Question: 21
What is the optimized version of the relation algebra expression $\pi_{A1}(\pi_{A2}(\sigma_{F1}(\sigma_{F2}(r))))$, where $A1, A2$ are sets of attributes in $r$ with $A1 \subset A2$ and $F1,F2$ are Boolean expressions based on the attributes in $r$ ... $\pi_{A2}(\sigma_{(F1 \wedge F2)}(r))$ $\pi_{A2}(\sigma_{(F1 \vee F2)}(r))$
What is the optimized version of the relation algebra expression $\pi_{A1}(\pi_{A2}(\sigma_{F1}(\sigma_{F2}(r))))$, where $A1, A2$ are sets of attributes in $r$ with $A1...
go_editor
10.8k
views
go_editor
asked
Sep 28, 2014
Databases
gatecse-2014-set3
databases
relational-algebra
easy
+
–
31
votes
10
answers
292
GATE CSE 1998 | Question: 27
Consider the following relational database schemes: COURSES (Cno, Name) PRE_REQ(Cno, Pre_Cno) COMPLETED (Student_no, Cno) COURSES gives the number and name of all the available courses. PRE_REQ gives the information about which courses are pre- ... relational algebra: List all the courses for which a student with Student_no 2310 has completed all the pre-requisites.
Consider the following relational database schemes:COURSES (Cno, Name)PRE_REQ(Cno, Pre_Cno)COMPLETED (Student_no, Cno)COURSES gives the number and name of all the availab...
Kathleen
8.2k
views
Kathleen
asked
Sep 26, 2014
Databases
gate1998
databases
relational-algebra
normal
descriptive
+
–
23
votes
1
answer
293
GATE CSE 1998 | Question: 1.33
Given two union compatible relations $R_1(A, B)$ and $R_2 (C, D)$, what is the result of the operation $R_1 \Join_{ A = C \wedge B = D} R_2$? $R_1 \cup R_2$ $R_1 \times R_2$ $R_1 – R_2$ $R_1 \cap R_2$
Given two union compatible relations $R_1(A, B)$ and $R_2 (C, D)$, what is the result of the operation $R_1 \Join_{ A = C \wedge B = D} R_2$?$R_1 \cup R_2$$R_1 \times R_2...
Kathleen
7.3k
views
Kathleen
asked
Sep 25, 2014
Databases
gate1998
normal
relational-algebra
+
–
38
votes
1
answer
294
GATE CSE 1999 | Question: 1.18, ISRO2016-53
Consider the join of a relation $R$ with a relation $S$. If $R$ has $m$ tuples and $S$ has $n$ tuples then the maximum and minimum sizes of the join respectively are $m+n$ and $0$ $mn$ and $0$ $m+n$ and $|m-n|$ $mn$ and $m+n$
Consider the join of a relation $R$ with a relation $S$. If $R$ has $m$ tuples and $S$ has $n$ tuples then the maximum and minimum sizes of the join respectively are$m+n$...
Kathleen
17.0k
views
Kathleen
asked
Sep 23, 2014
Databases
gate1999
databases
relational-algebra
easy
isro2016
+
–
45
votes
5
answers
295
GATE CSE 2005 | Question: 30
Let r be a relation instance with schema R = (A, B, C, D). We define $r_1 = \pi_{A, B, C} (R)$ and $r_2=\pi_{A, D} (r)$. Let $s =r_1 \: * \: r_2$ where $*$ denotes natural join. Given that the decomposition of $r$ into $r_1$ and $r_2$ is lossy, which one of the following is TRUE? $s \subset r$ $r \cup s =r$ $r \subset s$ $r*s=s$
Let r be a relation instance with schema R = (A, B, C, D). We define $r_1 = \pi_{A, B, C} (R)$ and $r_2=\pi_{A, D} (r)$. Let $s =r_1 \: * \: r_2$ where $*$ denotes natura...
Kathleen
16.3k
views
Kathleen
asked
Sep 22, 2014
Databases
gatecse-2005
databases
relational-algebra
natural-join
normal
+
–
65
votes
7
answers
296
GATE CSE 2004 | Question: 51
Consider the relation Student (name, sex, marks), where the primary key is shown underlined, pertaining to students in a class that has at least one boy and one girl. What does the following relational algebra expression produce? (Note: $\rho$ ... of girl students with marks not less than some boy student names of girl students with more marks than all the boy students
Consider the relation Student (name, sex, marks), where the primary key is shown underlined, pertaining to students in a class that has at least one boy and one girl. Wha...
Kathleen
17.9k
views
Kathleen
asked
Sep 18, 2014
Databases
gatecse-2004
databases
relational-algebra
normal
+
–
42
votes
4
answers
297
GATE CSE 2003 | Question: 30
Consider the following SQL query Select distinct $a_1, a_2, , a_n$ from $r_1, r_2, , r_m$ ... $\Pi_{a_1, a_2, a_n} \sigma_p \left(r_1 \cap r_2 \cap \dots \cap r_m \right)$
Consider the following SQL querySelect distinct $a_1, a_2, …, a_n$from $r_1, r_2, …, r_m$where PFor an arbitrary predicate P, this query is equivalent to which of the...
Kathleen
9.0k
views
Kathleen
asked
Sep 16, 2014
Databases
gatecse-2003
databases
relational-algebra
normal
+
–
32
votes
5
answers
298
GATE CSE 2002 | Question: 15
A university placement center maintains a relational database of companies that interview students on campus and make job offers to those successful in the interview. The schema of the database is given below: ... students were offered jobs, the name of the degree and the average offered salary of students in this degree program.
A university placement center maintains a relational database of companies that interview students on campus and make job offers to those successful in the interview. The...
Kathleen
5.6k
views
Kathleen
asked
Sep 15, 2014
Databases
gatecse-2002
databases
normal
descriptive
relational-algebra
sql
+
–
52
votes
3
answers
299
GATE CSE 2001 | Question: 1.25
Let r and s be two relations over the relation schemes R and S respectively, and let A be an attribute in R. The relational algebra expression $\sigma_{A=a}(r \bowtie s)$ is always equal to $\sigma_{A=a}(r)$ $r$ $\sigma_{A=a}(r) \bowtie s$ None of the above
Let r and s be two relations over the relation schemes R and S respectively, and let A be an attribute in R. The relational algebra expression $\sigma_{A=a}(r \bowtie s)...
Kathleen
7.4k
views
Kathleen
asked
Sep 14, 2014
Databases
gatecse-2001
databases
relational-algebra
+
–
54
votes
4
answers
300
GATE CSE 2001 | Question: 1.24
Suppose the adjacency relation of vertices in a graph is represented in a table Adj $(X,Y).$ Which of the following queries cannot be expressed by a relational algebra expression of constant length? List all vertices adjacent to a given ... self loops List all vertices which belong to cycles of less than three vertices List all vertices reachable from a given vertex
Suppose the adjacency relation of vertices in a graph is represented in a table Adj $(X,Y).$ Which of the following queries cannot be expressed by a relational algebra ex...
Kathleen
7.9k
views
Kathleen
asked
Sep 14, 2014
Databases
gatecse-2001
databases
relational-algebra
normal
+
–
Page:
« prev
1
...
5
6
7
8
9
10
11
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register