You have already completed the quiz before. Hence you can not start it again.
Quiz is loading...
You must sign in or sign up to start the quiz.
You have to finish following quiz, to start this quiz:
Results
0 of 10 questions answered correctly
Your time:
Time has elapsed
You have reached 0 of 0 Marks, (0)
Average score
Your score
Categories
Database0%
Remark
Need to Improve.
All the Best!
Click on View Questions Button to Check Your Correct and Incorrect Answers List.
Remark
You can do better.
All the Best!
Click on View Questions Button to Check Your Correct and Incorrect Answers List.
Remark
Doing Good,Keep Working on your mistakes.
All the Best!
Click on View Questions Button to Check Your Correct and Incorrect Answers List.
Remark
Doing Good.
All the Best!
Click on View Questions Button to Check Your Correct and Incorrect Answers List.
Remark
Perfect! Doing Good.
All the Best!
Click on View Questions Button to Check Your Correct and Incorrect Answers List.
maximum of 10 Marks
Pos.
Name
Entered on
Marks
Result
Table is loading
No data available
Your result has been entered into leaderboard
Loading
1
2
3
4
5
6
7
8
9
10
Answered
Review
Question 1 of 10
1. Question
1 Marks
R(A,B,C,D) is a relation. Which of the following does not have a lossless join, dependency preserving BCNF decomposition?
Correct
Incorrect
Question 2 of 10
2. Question
1 Marks
The maximum number of superkeys for the relation schemaÂ R(E,F,G,H)Â withÂ EÂ as the key is _____.
Correct
Incorrect
Question 3 of 10
3. Question
1 Marks
In an Entity-Relationship (ER) model, supposeÂ RÂ is a many-to-one relationship from entity set E1 to entity set E2. Assume that E1 and E2 participate totally inÂ RÂ and that the cardinality of E1 is greater than the cardinality of E2.
Which one of the following is true aboutÂ R?
Correct
Incorrect
Question 4 of 10
4. Question
1 Marks
How many minimum relations required for given ER diagram ?
Correct
Incorrect
Question 5 of 10
5. Question
1 Marks
ACID properties of a transactions are
Correct
Incorrect
Question 6 of 10
6. Question
1 Marks
R(A1,A2,A3,………………,An) Â having A1A2 as its candidate key.
R(A1,A2,A3,………………,An) Â having A1 and A2 as its candidate key.
Number of Super Key in Part 1 and 2 Respectively :
Correct
Incorrect
Question 7 of 10
7. Question
1 Marks
Consider a relation R(ABCD) with candidate keys AB and BC then the number of super keys. of R is __________
Correct
Incorrect
Question 8 of 10
8. Question
1 Marks
Given R(ABCD) and
AB â†’ C ;
ABD â†’ C ;
ABC â†’ D ;
AC â†’ D
What the highest possible normal form for the above relation?
Correct
Incorrect
Question 9 of 10
9. Question
1 Marks
Let R(X,Y,Z,W) be a relational schema with the following functional dependencies:
Xâ†’Y Yâ†’Z Zâ†’W Wâ†’Y
The decomposition of R into (X,Y),(Y,Z),(Y,W) is
Correct
Incorrect
Question 10 of 10
10. Question
1 Marks
Consider the following statements.
If relation R is in 3NF and every key is simple, then R is in BCNF
If relation R is in 3NF and R has only one key, then R is in BCNF