Scribd
Upload
11 views1 page

Imporatant Questions DBMS End Semester

Uploaded by

jhaaarti012017
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
11 views1 page

Imporatant Questions DBMS End Semester

Uploaded by

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

1. Physical and logical data independence.

2. Integrity Constraints.
3. Normalization : 1NF,2NF ,3NF ,BCNF and 4NF
4. Three-schema architecture.
5. Types of Triggers in SQL/PL SQL.
6. Timestamp ordering protocol and Validation Based Protocol for concurrency
control.
7. Serializability and test of Conflict Serializability.
8. Log Based Recovery.
9. ACID Properties.
10. ER diagram and Extended ER (Generalization, Specialization, Aggregation).
11. Given the following set of FDs on schema R (V, W, X, Y, Z) {Z→V, W→Y, XY→Z,
V→WX}
State whether the following decomposition are loss-less-join decompositions
or not. (i) R1=(V,W,X) , R2=(V,Y,Z) (ii) R1=(V,W,X), R2=(X,Y,Z).
12. Aggregate Function in SQL.
13. Joins and Types of Joins.
14. Cursor and Types of Cursor.
15. Lock Based Concurrency Control (Shared and Exclusive locks). And 2 Phase
Locking.
16. Schedule. Define the concepts of recoverable, cascade less and strict
schedules, and compare them in terms of their recoverability.
17. Consider the three transactions T1, T2, and T3, and the schedules S1 and
S2given below. State whether each schedule is serializable or not. If a schedule
is serializable, write down the equivalent serial schedule(s). T1: r1 (X); r1 (Z);
w1 (X); T2: r2 (Z); r2 (Y); w2 (Z); w2 (Y); T3: r3 (X); r3 (Y); w3 (Y); S1: r1 (X); r2
(Z); r1 (Z); r3 (X); r3 (Y); w1 (X); w3 (Y); r2 (Y); w2 (Z); w2 (Y); S2: r1 (X); r2 (Z); r3
(X); r1 (Z); r2 (Y); r3 (Y); w1 (X); w2 (Z); w3 (Y); w2 (Y);
18. Consider the relation R(a,b,c,d) with Set F={a→c,b→d}.
Decompose this relation in 2 NF. (ii) Explain the Loss Less Decomposition with
example.
19. Relational Algebra and its Operations: (Selection, Projection, Union,Rename)
20. SQL Languages : DDL , DML ,DCL,TCL (2 Commands).

You might also like