Paper 2 CS · UNIT 04 · MOCK TEST

Mock 7 – Functional Dependencies & Normalisation (Part 2)

Unit 4: Database Management Systems · 15 questions · about 18 minutes. Press End Mock any time to see your score and the correct answers.

All 11 topic-wise mocks in this unit

0 / 15 answered 00:00

Q1. Which metrics are derived by normalizing quality and/or productivity measures by considering the size of the software that has been produced?

AFunction-Oriented Metrics BFunction-Point Metrics CLine of Code Metrics DSize-Oriented Metrics

Q2. A company has a choice of two languages L1 and L2 to develop a software for their client. Number of LOC required to develop an application in L2 is thrice the LOC in language L1. Also, software has to be maintained for the next 10 years. Various parameters for two languages are given below to decide which language should be preferred for development.

Parameter	L1	L2
Man-year needed for development	LOC/1000	LOC/1000
Development cost	Rs. 70,000	Rs. 90,000
Cost of maintenance per year	Rs. 1,00,000	Rs. 40,000

Total cost of the project includes the cost of development and maintenance. What is the LOC for L1 for which cost of developing the software with both languages must be the same?

A2000 B5000 C3000 D6000

Q3.

In a relational database, which one of the following is CORRECT:

AA relation with only two attributes is always in BCNF. BIf all attributes of a relation are prime attributes then the relation in BCNF CEvery relation has at least one non-prime attribute. DBCNF decomposition preserves functional dependencies.

Q4.

Arrange the following phases of database design in the correct order :

(A) Physical Design

(B) Conceptual Design

(D) Requirement Analysis

A(B), (D), (A), (C) B(C), (A), (B), (D) C(D), (B), (C), (A) D(A), (D), (C), (B)

Q5.

Let R(A, B, C, D) be a relational schema with dependencies A → B, B → C, C → D and D → B. The decomposition of R into (A, B), (B, C), (B, D):

Agives a lossless join, and is dependency preserving Bgives lossless join, but is not dependency preserving Cdoes not give a lossless join, but is dependency preserving Ddoes not give a lossless join and is not dependency preserving

Q6.

Consider the relation Student(stuid, dept, clsroll) with FDs: FD1: stuid → dept, FD2: dept → stuid, FD3: stuid → clsroll, FD4: clsroll → stuid, FD5: dept → clsroll. Which FDs can be removed to obtain a canonical cover? A. FD2 and FD3 B. FD1 and FD5 C. FD5 D. FD1

AA, B only BA, C only CB, C only DA, B, C only

Q7.

Let R(ABCDEFGH) be a relation schema and F = {A → B, ABCD → E, EF → G, EF → H, ACDF → EG}. The minimal cover of this set of dependencies is

AA → B, ACD → E, EF → G and EF → H BA → B, ACD → E, EF → G, EF → H and ACDF → G CA → B, ACD → E, EF → G, EF → H and ACDF → E DA → B, ABCD → E, EF → H and EF → G

Q8.

Match List I with List II. List I: A. BCNF, B. 3NF, C. 2NF, D. 4NF. List II: I. Removes multivalued dependency, II. Not always dependency preserving, III. Removes transitive dependency, IV. Removes partial functional dependency.

A(A)-(III), (B)-(II), (C)-(IV), (D)-(I) B(A)-(II), (B)-(IV), (C)-(I), (D)-(III) C(A)-(II), (B)-(III), (C)-(IV), (D)-(I) D(A)-(II), (B)-(I), (C)-(IV), (D)-(III)

Q9.

Given R(x, y, z, w) with F = {x → y, z → w}, where all attributes are atomic: A. R is in First Normal Form. B. R is in Second Normal Form. C. The primary key of R is xz.

AC only BB and C only CA and C only DB only

Directions (Q96–100): An organization maintains a database with five attributes A, B, C, D, E. Consider the universal relation R(A, B, C, D, E) with functional dependency set F = {A → BC, D → E, BC → D, A → D}. All attributes are simple and atomic.

Q10.

Minimal cover of functional F dependency set is

AF′ = {A → B, A → C, BC → D, D → E} BF′ = {A → BC, B → D, D → E} CF′ = {A → B, A → C, A → D, D → E} DF′ = {A → B, A → C, B → D, C → D, D → E}

Q11.

Identify the normal form in which relation R belong to

A1 NF B2 NF C3 N F DB C N F

Q12.

Identify the redundant functional dependency in F

ABC → D BD → E CA → D DA → BC

Q13.

Assume that given table R is decomposed in two tables R (A, B, C) 1 with functional dependency set f = {A → B, A → C} 1 and R (A, D, E) FD 2 with set F = {A → D, D → E} 2 . Which of the following option is true w.r.t. given decomposition?

ADependency preservation property is followed BR1 and R2 are both in 2NF CR1 is in 2NF and R2 is in 3NF DR1 is in 3NF and R2 is in 2NF

Q14.

In relational databases, if relation is in , then which of the following is true about relation R ?

AR is in 4NF BR is not in 1NF CR is in 2NF and not in 3NF DR is in 2NF and 3NF

Q15.

For a database relation R(a, b, c, d) where the domains of a, b, c and d include only atomic values, and only the following functional dependencies and those that can be inferred from them hold :

a → c

b → d The relation is in _________.

AFirst normal form but not in second normal form BSecond normal form but not in third normal form CThird normal form DBCNF

Next: Mock 8 – Transactions, Concurrency & Recovery →