Scribd
Upload
45 views1 page

CS2008

The document contains a database engineering exam with 4 questions. Question 1 has multiple parts related to database normalization up to BCNF and dependency preservation. Question 2 covers redundant functional dependencies and Armstrong's axioms. Question 3 covers relational completeness and relational algebra operations. Question 4 addresses transaction isolation, concurrency problems like lost updates, and conflict serializability. The exam tests a variety of database concepts related to normalization, dependencies, relational operations, and transactions.

Uploaded by

Satya Das
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
45 views1 page

CS2008

The document contains a database engineering exam with 4 questions. Question 1 has multiple parts related to database normalization up to BCNF and dependency preservation. Question 2 covers redundant functional dependencies and Armstrong's axioms. Question 3 covers relational completeness and relational algebra operations. Question 4 addresses transaction isolation, concurrency problems like lost updates, and conflict serializability. The exam tests a variety of database concepts related to normalization, dependencies, relational operations, and transactions.

Uploaded by

Satya Das
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

NATIONAL INSTITUTE OF TECHNOLOGY ROURKELA

 Database Engineering CS2008  End Sem Spring 2020-21  UG  Pg 1  FM 50  2 Hrs

 Answer ALL questions.  All parts of a question MUST be answered together.  Mere answers without proper
explanation will not fetch marks.  Variation in quality of answer will vary the secured marks.

1. a. Does BCNF guaranty zero redundancy?


b. What are the problems in a non-normalized database?
c. For a schema R (A, B, C, D) bearing FDs F={A → B, B → C, C → D, D → A}, find if the decomposition of R
into R1 (A, B, C) and R2 (B, C, D) is dependency preserving?
d. For a schema R (A, B, C, D, E, F) bearing FDs G={A → B, A → C, C → D, AE → F}, find if the
decomposition of R into R1 (A, B, C), R2 (C, D), and R3 (A, E, F) is lossless? [1.5+2+4.5+4.5]

2. a. Check if BD → E, AC → E are the redundant FDs in F = {A → B, C → D, BD → E, AC → E}


b. Eliminate redundant FDs from F={X → Y, Y → X, Y → Z, Z → Y, X → Z, Z → X} using the Membership
algorithm.
c. What do you mean by soundness and completeness of Armstrong’s axioms? [3.5 + 6 + 3]

3. a. When a language is called relationally complete?


b. Find the content of tables G,H,I,J,K,L,M,N from the following tables R and S:
G ← R ./A=D S H ← R nA=D S I ← R oA=D S J ← R /A=D S
[3 + 1.5 × 8]
K ← R .A=D S L ← R ./A=D S M ← R ./ A=D S N ← R ./ A=D S
R(A, B, C) S(D, E, F)
A B C D E F
a1 b1 c1 a1 e1 f1
a1 b2 c1 a1 e2 f3
a2 b1 c1 a2 e2 f2
a3 b2 c2 a2 e4 f4
a4 b3 c3 a5 e2 f3

4. a. Explain the need of Isolation and Durability property of transaction.


b. What are the problems caused by concurrent transactions? Explain them.
c. What is lost update problem? Explain with an example.
d. Check if the following schedule S on two transactions T1 and T2 is conflict serializable:
S :{ R1 (A), W1 (A), R2 (A), W2 (A), R1 (B), W1 (B), R2 (B), W2 (B)} [(1+1)+1.5+1.5+5]

 BEST OF LUCK 

You might also like