Register

Search results for made-easy+databases

0 votes
1 answer
1
Made Easy Test Series
Isn’t F$^{+}$ minimal cover? If C $\rightarrow$ A is already there, then why does augmented CD $\rightarrow$ A needs to be?
Isn’t F$^{+}$ minimal cover? If C $\rightarrow$ A is already there, then why does augmented CD $\rightarrow$ A needs to be?
User Avatar
0 votes
6 answers
3
made easy test series
Consider a relation $R(ABCDEFGH)$. How many superkeys will be there in relation $R$ if the candidate keys for relation are ${A, BC, CDE, EF}$?
Consider a relation $R(ABCDEFGH)$.How many superkeys will be there in relation $R$ if the candidate keys for relation are ${A, BC, CDE, EF}$?
User Avatar
1 votes
1 answer
6
MADE EASY TEST SERIES
Unique not null is equivalent to primary key. Relational Algebra and SQL has same expressive power. Which of the above statements are False?
Unique not null is equivalent to primary key.Relational Algebra and SQL has same expressive power.Which of the above statements are False?
User Avatar
0 votes
0 answers
8
Made easy DBMS
User Avatar
0 votes
0 answers
10
madeeasy workbook
According to me answer is 2.Is it right? Suggestion is needed how to approach this if it is given in more complexity.
According to me answer is 2.Is it right? Suggestion is needed how to approach this if it is given in more complexity.
User Avatar
0 votes
0 answers
11
ER Diagram
Can someone please provide me with the correct explanation for this question
Can someone please provide me with the correct explanation for this question
User Avatar
0 votes
1 answer
12
madeeasy
User Avatar
0 votes
2 answers
14
Made Easy Test Series | 3NF | True/False
A relation is in 3NF if every non-prime attribute of R is fully functionally reliant on every key of R TRUE FALSE
A relation is in 3NF if every non-prime attribute of R is fully functionally reliant on every key of RTRUEFALSE
User Avatar
1 votes
1 answer
15
Made easy || Database
Consider a relation schema r(A, B, C, D, E, F) and attribute A is element of every candidate key of r. Maximum number of possible candidate keys of r is ________.
Consider a relation schema r(A, B, C, D, E, F) and attribute A is element of every candidate key of r. Maximum number of possible candidate keys of r is ________.
User Avatar
1 votes
1 answer
16
MadeEasy Test Series 2018: Databases - Relational Algebra
Consider the following database table Supplier (Sid, Sname, rating) Parts (Pid, Pname, color) Catalog (Sid Pid, cost) Which of the following SQL query correct representation to retrieve Sid’s who supplied every red part.
Consider the following database tableSupplier (Sid, Sname, rating)Parts (Pid, Pname, color)Catalog (Sid Pid, cost)Which of the following SQL query correct representation ...
User Avatar
0 votes
1 answer
17
Databases
Somebody please verify the answer
Somebody please verify the answer
User Avatar
0 votes
0 answers
18
Databases
What is the meaning of first option
What is the meaning of first option
User Avatar
0 votes
2 answers
19
MadeEasy Subject Test: Databases - Sql
User Avatar
1 votes
2 answers
20
MadeEasy Workbook: Databases - Er Diagram
The minimum number of tables needed to represent M,N,P,R1,R2 is … The given ans is 2. I think the ans should be 3.
The minimum number of tables needed to represent M,N,P,R1,R2 is …The given ans is 2.I think the ans should be 3.
User Avatar
Page: