Which of the following statements is INCORRECT?

S1: Data elements in the database can be modified by changing the data dictionary.

S2: The data dictionary contains the name and description of each data element.

Only S1
Only S2
Both S1 and S2
Neither S1 nor S2
Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.33
R is a relationship between the entities E1 and E2. The existence of E2 is completely dependent on the entity set E1. Which of the following construct is used to represent the entity set E2?
Dotted rectangle.
Diamond
Doubly outlined rectangle
Rectangle
Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.33
Given {student_id} is a candidate key, {student_name, student_street} is another candidate key then
{student_id, student_name} is also a candidate key
{student_id, student_street} is also a candidate key
{student_id, student_name, student_street} is also a candidate key
None
Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.33
An edge between an entity set and a binary relationship set can have an associated minimum and maximum cardinality, shown in the form (1, n) where ‘1’ is the minimum and ‘n’ is the maximum cardinality. The minimum value ‘1’ indicates:
total participation
partial participation
double participation
no participation
Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.33
In terms of relational model, which of the following is CORRECT?
Cardinality is termed as a number of tuples
Cardinality is termed as a number of tables
Cardinality is termed as a number of attributes
Cardinality is termed as a number of constraints
Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.33
Match the following:

1-c, 2-a, 3-b
1-a, 2-b, 3-c
1-b, 2-a, 3-c
1-c, 2-b, 3-a
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.66
Identify the CORRECT statements about the normalization process.

I. Reduces number of tables

II. Reduces database size

III. Reduces data constraints

IV. Reduces chances of data anomalies

Only II
I, II and IV
II and III
II and IV
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.66
If PQRST are the attributes of relation and PQRS is super key and PQR is also super key then

PQR must be candidate key
PQR cannot be super key
PQR cannot be candidate key
PQR may be candidate
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.66
Let R= (A, B, C, D, E, F) be a relation scheme with the following dependencies: C->F, E->A, EC->D, A->B. Which of the following is not a key for R?
CD
CE
BCE
CEF
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.66
Consider the relation R(A, B, C, D, E, F, G, H, I, J) and the set of functional dependencies

F = {{A,B}⟶{C}, {A}⟶{D,F}, {B}⟶{F}, {F}⟶{G,H}, {D}⟶{I,J}}

What is the key for R?

AB
BC
CD
EF
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.66
Consider the following ER diagram:

How many minimum numbers of tables are required to represent the above ER diagram?

2
3
4
1
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.66
Consider the relation R(ABCD) with its candidate key AB. The maximum number of super keys possible is ________.

4
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.00
Consider a table R(ABCDE) with the following functional dependencies:

A->C, B->D, AB->E. In terms of Normalization, this table is in

1 NF
2 NF
3 NF
None
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.66
Consider the relation R (ABCDE) and functional dependencies set {A → B, B → C, C → D, D → E}. What is the highest normal form of R?
1 NF
2 NF
3 NF
BCNF
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.66
Consider the relation scheme R(A, B, C, D) along with the set of functional dependencies F = {AB → C, AB → D, C → A, D → B}. Which of the following is not a candidate key of R?
AB
AC
AD
CD
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.66