Scribd
Upload
7 views2 pages

Second Assignment Question - 16!03!2024

Uploaded by

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

Second Assignment Question - 16!03!2024

Uploaded by

seriousviper777
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

DBMS SECOND ASSIGNMENT QUESTIONS

Explain an informal design guideline for relational schema design

What is the need of normalization? Explain 1NF,2NF and 3NF with example

What do you understand by attribute closure? Give an example

What is functional dependency? Explain the inference rules for functional dependency with
proof.

Define 4NF. When it is violated? Why is it useful?

Consider two sets of functional dependency F={A --- > C, AC -→ D, E ---- > AD, E --- > H} and G= {
A --- > CD, E --- >AH }. Are they equivalent?

Why concurrency control is needed? Demonstrate with an example.

Explain the ACID properties of a database transaction.

Discuss Two-Phase Locking Technique for concurrency control.

When deadlock and starvation problem occur ? Explain how these problems can be resolved.

Explain types of update anomalies with examples.

Explain Armstrong inference rules.

What is functional dependency? Write an algorithm to find minimal cover for set of functional
dependencies. Construct minimal cover m for set of functional dependencies which are:
E : {B --- > A , D ---- > A, AB ---- > D }

Consider the schema R – ABCD, subjected to FDs F = { A ---- > B, B --- > C}, and the non-binary
partition D1 = {ACD, AB, BC }. State whether D1 is a lossless decomposition? [ give all steps in
details].

Define transaction. Discuss ACID properties.

With a neat diagram explain transition diagram of a transaction.

Why concurrency control and recovery are needed in DBMS? Explain types of problems that may
occur when two simple transaction run concurrently

Explain view serializability with example.

When deadlock and starvation problem occur? Explain how these problems can be resolved.

Define non-additive join property of a decomposition and write an algorithm for testing of non-
additive join property.
DBMS SECOND ASSIGNMENT QUESTIONS
Write the algorithm to find the minimal cover for a sets of FDs consider R = { A,B,C,D,E,F} FDs {A
--- > C, AC --- >D , E ---- >AD, E ----- > H } Find the irreducible cover for this set of FD’s (minimal
cover)

Check whether given schedule is serializable or not using precedence graph. Explain with
algorithm.
S1: r1(x) ; r2(z); r1(z); r3(y); r3(y); w1(x); w3(y); r2(y); w2(z); w2(y)

Explain basic time stamping algorithm.

What is a lock? Why is it needed? Explain the binary locking system and give the disadvantages
of it.

You might also like