KEMBAR78
Assignment 2 | PDF
Scribd
Upload
39 views1 page

Assignment 2

This document outlines an assignment for a Database Management course for the academic session 2024-25, detailing the questions related to functional dependencies and relation schemas. It includes five specific tasks that require students to analyze and determine properties of given relation schemas and functional dependencies. The assignment is to be completed by November 8, 2024, and is graded out of a maximum of 10 points.

Uploaded by

sanyamch333
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
39 views1 page

Assignment 2

This document outlines an assignment for a Database Management course for the academic session 2024-25, detailing the questions related to functional dependencies and relation schemas. It includes five specific tasks that require students to analyze and determine properties of given relation schemas and functional dependencies. The assignment is to be completed by November 8, 2024, and is graded out of a maximum of 10 points.

Uploaded by

sanyamch333
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

DATABASE MANAGEMENT SESSION: 2024-25

SYSTEM (ACSE0506)
UNIT-3 and 4
CLASS/SEM: B TECH
CSE Vth (ODD)
Assignment Given Date: 28-Oct-2024 Maximum Points: 10
Assignment Return Date: 8-Nov-2024
Faculty Name: Dr. Mohd. Nazim Faculty Mail Id: mohd.nazim@niet.co.in

Note: Write solution of each question in clear handwriting.


BLOOM’S
Q. No. Question Statement Pts CO KNOWLEDG

E LEVEL

1 Let us consider a relation schema R = {A, B, C, D, E, H} having 2 CO3 K6


twofunctional dependency(FD) set F and G,
F = {A → C, AC → D, E → AD, E → H}
G = {A → CD, E → AH}
Check whether two sets are equivalent or not.

2 Given a relation schema R = {A, B, C, D, E}and a set of 2 CO3 K6


functionaldependencies F= {A → BC, CD → E, B → D, E → A}
To find the minimal cover for above given FD’s.

3 Find the Keys of relation R= {A, B, C, D, E} with FD’s 2 CO3 K6


F= {A→BC,CD →E,E → A,B → D}.
4 Given a relation schema R = {A, B, C, D, E, F} decomposed into 2 CO3 K6
three relations R1 (A, B, C), R2(C, D, E) and R3(E, F)
and a given set of functional dependencies F= {AB→ C, C →
D,D→ EF, F→ A, D→ B }
Check whether the decomposition is lossless or not.
5 2 CO4 K5

Check whether the given above schedule is :


a) Conflict Serializable
b) View Serializable

You might also like