edited by
26,173 views
64 votes
64 votes

Consider the following $\text{ER}$ diagram

The minimum number of tables needed to represent $M$, $N$, $P$, $R1$, $R2$ is

  1. $2$
  2. $3$
  3. $4$
  4. $5$
edited by

6 Answers

1 votes
1 votes
Relationship  between M & P is N:1 so solve Accordingly .

The Side which Has "Arrow" has Cardinality = 1 always.(Remember That).
0 votes
0 votes
ans is c.4

m(m1m2m3)

pr1r2(p1p2m1n1)

n1(n1n2)

n2(n1)
Answer:

Related questions

50 votes
50 votes
6 answers
4
Kathleen asked Sep 12, 2014
21,494 views
A B-tree of order $4$ is built from scratch by $10$ successive insertions. What is the maximum number of node splitting operations that may take place?$3$$4$$5$$6$