GATEverse Practice, past papers & mock tests
GATE 2027: 115 days Sign in Create account
GATE 2006
Database ManagementRelational Model: Relational Algebra and Tuple CalculusmediumMCQ1 mark
Consider the following relational schema: • Suppliers(sid:integer, sname:string,city:string ,street:string ) • Parts(pid:integer, pname:string, color:string) • Catalog(sid:integer, pid:integer, cost:real) Assume that, in the suppliers relation above, each supplier and each street within a city has unique name, and (sname, city) forms a candidate key. No other functional dependencies are implied other than those implied by primary and candidate keys. Which one of the following is TRUE about the above schema?
Save your progress

Related Database Management PYQs

GATE 2006

In SQL, what is the result of evaluating the predicate: NULL = NULL?

GATE 2006

Which of the following SQL clauses is used to filter groups formed by a GROUP BY clause?

GATE 2006

A prime attribute of a relation schema R is an attribute that:

GATE 2006

Which relational algebra operator selects all tuples from relation R that satisfy a specified predicate P?

GATE 2006

A transaction schedule that is conflict serializable is always guaranteed to be:

GATE 2006

Which of the following relational algebra expressions selects tuples where attribute A is greater than 10 from relation R?