23,905 views
57 57 votes

Which of the following tuple relational calculus expression(s) is/are equivalent to $\forall t \in r \left(P\left(t\right)\right)$?

  1. $\neg \exists t \in r \left(P\left(t\right)\right)$
  2. $\exists t \notin r \left(P\left(t\right)\right)$
  3. $\neg \exists t \in r \left(\neg P\left(t\right)\right)$
  4. $\exists t \notin r \left(\neg P\left(t\right)\right)$
    1. I only
    2. II only
    3. III only
    4. III and IV only

7 Answers

–1 –1 vote

∃t∈r(⌝ P(t))--means that there are some tuples in relation r which do not satisfy the constraint P(t)

and if we put not before this statement we get there are no tuples in relation r which do not satisfy the constraint P(t) which is equivalent to saying all tuples in relation r satify predicate condition P(t)

Answer:
Position:
Show:

Related questions

74 74 votes
4 answers 4 answers
35.4k
35.4k views
Kathleen asked Sep 12, 2014
35,389 views
Which of the following are NOT true in a pipelined processor?Bypassing can handle all RAW hazardsRegister renaming can eliminate all register carried WAR hazardsControl h...
70 70 votes
10 answers 10 answers
26.4k
26.4k views
Ishrat Jahan asked Oct 29, 2014
26,407 views
Consider the following relational schema:$\text{Student} (\underline{\text{school-id}, \text{sch-roll-no}}, \text{sname}, \text{saddress})$$\text{School} (\underline{\tex...
43 43 votes
3 answers 3 answers
21.0k
21.0k views
Arjun asked Nov 27, 2016
21,030 views
Consider the following $\text{ER}$ diagramThe minimum number of tables needed to represent $M$, $N$, $P$, $R1$, $R2$ is Which of the following is a correct attribute set ...
100 100 votes
8 answers 8 answers
47.2k
47.2k views
Kathleen asked Sep 12, 2014
47,196 views
Consider the following relational schemes for a library database:Book (Title, Author, Catalog_no, Publisher, Year, Price) Collection(Title, Author, Catalog_no)with the fo...