Scribd
Upload
15 views3 pages

SELECT Operation in SQL Is Equivalent To

The document contains 10 multiple choice questions about database concepts such as entity relationship modeling, relational algebra, normal forms, functional dependencies, and transaction scheduling. The questions cover topics like keys, normal forms, functional dependencies, and serialization schedules.

Uploaded by

Swati Jain
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
15 views3 pages

SELECT Operation in SQL Is Equivalent To

The document contains 10 multiple choice questions about database concepts such as entity relationship modeling, relational algebra, normal forms, functional dependencies, and transaction scheduling. The questions cover topics like keys, normal forms, functional dependencies, and serialization schedules.

Uploaded by

Swati Jain
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

1. Given the basic ER and relational models, which of the following is INCORRECT?

(A) An attribute of an entity can have more than one value.


(B) An attribute of an entity can be composite.
(C) In a row of a relational table, an attribute can have more than one value.
(D) In a row of a relational table, an attribute can have exactly one value or a NULL
value.
Solution: C

2. Which one of the following is NOT a part of the ACID properties of database
transactions?
(A) Atomicity
(B) Consistency
(C) Isolation
(D) Deadlock-freedom
Solution: D

3. SELECT operation in SQL is equivalent to


(A) the selection operation in relational algebra
(B) the selection operation in relational algebra, except that SELECT in SQL retains
duplicates
(C) the projection operation in relational algebra
(D) the projection operation in relational algebra, except that SELECT in SQL retains
duplicates
Solution: D

4. Consider the following transaction involving two bank accounts x and y.


read(x); x : = x–50; write(x); read(y); y:=y+50; write(y)
The constraint that the sum of the accounts x and y should remain constant is that of
(A) Atomicity
(B) Consistency
(C) Isolation
(D) Durability
Solution: B

5. The maximum number of superkeys for the relation schema R(E,F,G,H) with E as
the key is
(A) 5
(B) 6
(C) 7
(D) 8
Solution: (D)
6. Consider the relation scheme R = (E,F, G, H, I, J, K, L, M, N) and the set of functional
dependencies {{E, F} → {G}, {F} → {I, J}, {E, H} → {K, L}, {K} → {M}, {L} → {N}} on R.
What is the key for R ?
(A) {E,F}
(B) {E,F,H}
(C) {E,F,H,K,L}
(D) {E}
Solution: B

7. Given the following two statements:


S1: Every table with two single-valued attributes is in 1NF, 2NF, 3NF and BCNF.
S2: AB→C, D→E, E→C is a minimal cover for the set of functional dependencies
AB→C, D→E, AB→E, E→C.
Which one of the following is CORRECT?
(A) S1 is TRUE and S2 is FALSE
(B) Both S1 and S2 are TRUE
(C) S1 is FALSE and S2 is TRUE
(D) Both S1 and S2 are FALSE
Solution: A

8. Consider the transactions T1, T2, and T3 and the schedules S1 and S2 given below.


T1: r1(X); r1(Z); w1(X); w1(Z)
T2: r2(Y); r2(Z); w2(Z)
T3: r3(Y); r3(X); w3(Y)
S1: r1(X); r3(Y); r3(X); r2(Y); r2(Z); w3(Y); w2(Z); r1(Z);
w1(X); w1(Z)
S2: r1(X); r3(Y); r2(Y); r3(X); r1(Z); r2(Z); w3(Y); w1(X);
w2(Z); w1(Z)
Which one of the following statements about the schedules is TRUE?
(A) Only S1 is conflict-serializable
(B) Only S2 is conflict-serializable
(C) Both S1 and S2 are conflict-serializable
(D) Neither S1 nor S2 is conflict-serializable
Solution: A

9. Relation R has eight attributes ABCDEFGH. Fields of R contain only atomic values. 


F={CH→G, A→BC, B→CFH, E→A, F→EG}  is a set of functional dependencies (FDs) so
that F+ is exactly the set of FDs that hold for R. How many candidate keys does the
relation R have?
(A) 3
(B) 4
(C) 5
(D) 6
Solution: B

10. Which of the following is TRUE?


(A) Every relation in 3NF is also in BCNF
(B) A relation R is in 3NF if every non-prime attribute of R is fully functionally
dependent on every key of R
(C) Every relation in BCNF is also in 3NF
(D) No relation can be in both BCNF and 3NF
Solution: C

You might also like