Scribd
Upload
11 views2 pages

DBMS PQY and Important Question

PQYS and Important Question for DBMS by which lot of student who study in Aktu will get help interested studies

Uploaded by

221294
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 views2 pages

DBMS PQY and Important Question

PQYS and Important Question for DBMS by which lot of student who study in Aktu will get help interested studies

Uploaded by

221294
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/ 2

IMPORTANT QUESTION FOR PUT & MAKEUP TEST

What is Data Independency in DBMS?

List any Three disadvantages of file system approach over data based approach

When are relation called a recursive relationship set?


What is strong & weak entity set? Explain with Example.

Discuss three level of abstractions or schemas architecture of DBMS.

Explain the following with example: Generalization, Specialization, and Aggregation.

What is Relational Calculus?


What is Equi-Join in database?
What are different Integrity Constraints?
Explain cursor with Example.

What do you mean by trigger? Explain it by a suitable example.


What are Joins? Discuss all types of Joins with the help of suitable examples.
What is Trivial Dependency? Explain with Example.

Write different Inference Rule for Functional Dependency?

What is highest normal form of the Relation R( W,X,Y,Z) with the set F= { WY → XZ,X →Y }
Consider a relation R(A,B,C,D,E) with set F= { A→CD, C→B,B→AE} What are the prime attributes of this
Relation and Decompose the given relation in 3NF.

Explain the procedure of calculating the canonical cover of a given functional dependency set with suitable example.

Discuss 4NF and 5NF with suitable Example.

When is a transaction Rolled Back?


What are ACID properties of Transaction?

Discuss the features of immediate database modification in brief.

Define replication in distributed database.

Describe serializable schedule. Discuss conflict serializability with suitable example


Discuss the procedure of deadlock detection and recovery in transaction?
List the various levels of locking?
Explain Thomas Write Rule.
Explain strict 2PL Protocol.

Explain Recovery from Concurrent Transaction

Discuss Time stamp based protocol with suitable example. How the validation based protocols differ from
2PC?
Explain Multi Version Schemes Protocol.

What are advantages of normalization?


Define the closure of an attribute set.
What is candidate key?
Explain 3nf and BCNF with Example.
Explain 4nf and 5th nf With Example.
Given the following set of FDs on schemaR(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)
What do you understand by transitive dependencies? Explain with an example any two problems
that can arise in the database if transitive dependencies are present in the database.
Describe Armstrong’s axioms in detail. What is the role of these rules in database development
process?
Discuss Consistency and Isolation property of a transaction.
What are Concurrent Transactions?
Draw a state diagram and discuss the typical states that a transaction goes through during execution.
Explain type of Data fragmentation.
Discuss Conservative2PL and Strict 2PL.
What is VIEW Serializability? Explain the difference between conflict and view serializable schedule using suitable
example?

(a) Consider schedules S1, S2, and S3 below. Determine whether each schedule is strict,
cascade less, recoverable, or non recoverable. (Determine the strictest recoverability
condition that each schedule satisfies.)
S1:r1 (X); r2(Z);r1 (Z); r3 (X);r3 (Y);w1(X); c1;w3 (Y); c3; r2(Y);w2(Z); w2 (Y); c2;
S2:r1(X);r2(Z);r1(Z);r3(X);r3(Y);w1(X);w3(Y);r2(Y);w2(Z);w2(Y);
c1;c2;c3;
S3:r1(X);r2(Z);r3(X);r1(Z);r2(Y);r3(Y);w1(X);c1;w2(Z);w3(Y);w2 (Y);c3; c2;

You might also like