Register

GATE Overflow | Mock GATE | Test 1 | Question: 55

• recategorized
1,550 views
1 1 vote
Which of the following is/are true regarding Weak Entity Sets?
(P) An entity set that does not have a primary key is referred to as a weak entity set.
(Q) The existence of a weak entity set depends on the existence of a identifying entity set.
(R) It must relate to the identifying entity set via a total, one-to-many relationship set from the identifying to the weak entity set
(S) The primary key of a weak entity set is formed by the primary key of the strong entity set on which the weak entity set is existence dependent, plus the weak entity set's discriminator
(T) The primary key of the entity set is not explicitly stored with the weak entity set, since it is implicit in the identifying relationship.

  1. Only R, S and T are true
  2. All are true
  3. Only Q, R and S are true
  4. Only P, R and S are true

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
Answer:
← Previous · GATE Overflow | Mock...Next → · GATE Overflow | Mock...
← Previous in category · ME T1Next in category → · GATE Overflow | Mock...
Position:
Show:

Related questions

6 6 votes
2 2 answers
1.4k
1.4k views
Ruturaj Mohanty asked Dec 27, 2018
1,419 views
GATE Overflow | Mock GATE | Test 1 | Question: 49
Consider the following two relational schemas:MovieExec(name, address, cert, netWorth)Studio(name, address, presC)Suppose we wish to require that one must have a net wort...
2 2 votes
1 answers 1 answer
2.6k
2.6k views
Ruturaj Mohanty asked Dec 27, 2018
2,593 views
GATE Overflow | Mock GATE | Test 1 | Question: 27
A single query in DBMS can be executed through different algorithms or re-written in different forms and structures. The most optimal pathway of getting the correct outpu...
1 1 vote
1 1 answer
5.9k
5.9k views
Ruturaj Mohanty asked Dec 27, 2018
5,907 views
GATE Overflow | Mock GATE | Test 1 | Question: 27
Which of the following statements is incorrect with respect to B-tree and B+ trees?Deletion operation is easier in B-tree but complex in case of B+ trees.In B+ trees, dat...
4 4 votes
1 1 answer
3.6k
3.6k views
go_editor asked Jul 29, 2016
3,585 views
UGC NET CSE | December 2013 | Part 3 | Question: 55
Consider the following ER diagram:The minimum number of tables required to represent $M, N, P, R_1, R_2$ is2345