NPTEL...3) 2 points 4) 2 points No, the answer is incorrect. Score: 0 Accepted Answers: a) a1 b) a2...

X

Courses » Database Management System

Unit 5 - Week 4

[email protected] ▼

Announcements Course Ask a Question Progress Mentor

Course outline

How to access theportal

Week 1

Week 2

Week 3

Week 4

Week 5

Week 6

Week 7

Week 8

First Run AssignmentSolutions

DOWNLOAD VIDEOS

Lecture 16 :Relational DatabaseDesign /1

Lecture 17 :Relational DatabaseDesign (Contd.)




Week 4 LectureMaterial

Feedback for week4

Quiz :R1_W4_Assignment-4

Live Session 8thMarch PPT

Due on 2018-03-11, 23:59 IST.

1) 2 points

2) 2 points

R1_W4_Assignment-4The due date for submitting this assignment has passed.

Submitted assignment

No, the answer is incorrect.

Score: 0

Accepted Answers:

A project of In association with Funded by

Powered by

© 2014 NPTEL - Privacy & Terms - Honor Code - FAQs -

Database Management System - - Unit 5 - Week 4 https://onlinecourses.nptel.ac.in/noc18_cs15/uni...

1 of 11 Thursday 10 May 2018 04:32 PM

3) 2 points

4) 2 points


Score: 0

Accepted Answers:

a) a1

b) a2

c) a3

d) a1 and a2


Score: 0

Accepted Answers:

b) a2

c) a3

a) Conversion to First Normal Form

b) Conversion to Second Normal Form

c) Conversion to Third Normal Form

d) Conversion to Fourth Normal Form



5) 2 points

6) 0 points


Score: 0

Accepted Answers:



Score: 0

Accepted Answers:



7) 2 points

8) 2 points


Score: 0

Accepted Answers:



c) Conversion to Boyce Codd Normal Form

d) Conversion to Fourth Normal Form


Score: 0

Accepted Answers:




9) 2 points

a) lossy

b) lossless

c) neither lossy nor lossless

d) lossy and lossless


Score: 0

Accepted Answers:

a) lossy

a) lossy

b) lossless

c) neither lossy nor lossless



10) 0 points

11) 2 points

d) lossy and lossless


Score: 0

Accepted Answers:

b) lossless


Score: 0

Accepted Answers:


Score: 0



12) 2 points

13) 2 points

Accepted Answers:


Score: 0

Accepted Answers:



14) 2 points

15) 2 points

16) 2 points


Score: 0

Accepted Answers:


Score: 0

Accepted Answers:


Score: 0

Accepted Answers:

Suppose if R(A, B, C, D, E) is a relation with functional dependencies AB → C and CD → E. A, B, D are the prime

attributes of R. There can be at most 4 dierent values for each of the attributes A, B, and D. What is the maximum number of di

erent values E can take?

a) 4

b) 16

c) 64



17) 2 points

18) 0 points

19) 2 points

20) 2 points

d) 12


Score: 0

Accepted Answers:

c) 64

If R(P, Q, R, S, T) is a relation. PQ → R, PT → S, and S → Q are the functional dependencies. Identify the

candidate key set for relation R

a) PQ

b) PR

c) PT

d) PS


Score: 0

Accepted Answers:

c) PT

Consider the relation can_work (person name, department, role), where a person can work for multiple departments

and with multiple roles per department in a company. Choose the correct options about the relation. The allotment of roles and

departments are a random process.

a) There will be no redundancies in can_work.

b) person_name is the key

c) This relation is not in BCNF.

d) can_work is a normalized design.


Score: 0

Accepted Answers:

c) This relation is not in BCNF.

Consider the following functional dependencies

PQ → R

R → S

QS → T

for the relation set R(P,Q,R,S,T). Which of the following set of attributes do not functionally determine T?

a) PRS

b) QRS

c) PQ

d) PQR


Score: 0

Accepted Answers:

a) PRS

Consider the relation R(A,B,C,D,E) which satises the following functional dependencies:

AB → C

BC → D

CD → E

DE → A

AE → B

Which of the following functional dependencies are also guaranteed to be satised by relation R?

a) AC → D

b) BCD → A

c) C → E

d) A → C




21) 2 points

22) 2 points

23) 2 points

24) 2 points

Score: 0

Accepted Answers:

b) BCD → A

a) It is a lossy decomposition


Score: 0

Accepted Answers:

a) It is a lossy decomposition

A, B, C, D, E, F, G, H are the attributes of the relation R. If CH → G, A → BC, B → CFH, E → A, F → EG is a set of

functional dependencies (FDs) such that F+ is exactly the set of FDs that hold for R.

The number of candidate keys in the relation R is

a) 3

b) 4

c) 5

d) 6


Score: 0

Accepted Answers:

b) 4

Consider the relation R(A, B, C, D, E, F) with the set of following functional dependencies F ={AB → C;A → D;D

→ AE;E → F} Relation R supports transitive dependencies. Identify the primary key from the following options.

a) ABCDEF

b) ABCD

c) ABDEF

d) AB


Score: 0

Accepted Answers:

d) AB

Identify the correct functional dependency rules from the following options. Note that the correct rules should be

valid on all relations.



25) 2 points


Score: 0

Accepted Answers:

Consider the set of functional dependencies {A → BC; CD → E; B → D; E → Ag} Identify the correct canonical

cover for the given set.


Score: 0

Accepted Answers:

Previous Page End



Date post:	28-Feb-2021
Category:	Documents
Upload:	others
View:	4 times
Download:	0 times

NPTEL...3) 2 points 4) 2 points No, the answer is incorrect. Score: 0 Accepted Answers: a) a1 b) a2...

Documents