Databases - Transactions and concurrency control

1. A relation empdt1 is defined with attributes
empdt1(empcode, name, street, city, state,Pincode).
For any Pincode, there is only one city and state.
Also, forgiven street, city, and state, there is just one Pincode.
In normalization terms, empdt1 is a relation in

  • Option : B
  • Explanation : empdt1 {empcode, name, street, city, state, pincode)
    Given functional dependency
    pincode -> (city) (state)
    (street) (city) (state) -->pincode
    This is in I NF and 2NF but not in 3NF because it contains transitive dependency.
    Hence the correct answer is (b).
Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *


2. A table has fields F1, F2, F3, F4, F5 with the following functional dependencies
Fi —> F3,
F2 —> F4
(FI, F2) —> F5
In terms of normalization, this table is in

  • Option : A
  • Explanation : Primary key (candidates key) for this relation is [F1] [F2] because [F1, F2] column contains [F1, F2, F3, F4, F5]
    So, there is, functional dependency F1 -> F3, F2
    It also has partial dependency so it is not in 2nd, 3rd NF.
Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *


3. Amongst the ACID properties of a transaction, the 'Durability' property requires. that the changes made to the database by a successful transaction persist

Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *


4. In a schema with attributes A, B, C, D, and E following set of functional dependencies are given
A --> B
A -->C
CD —>E
B --> D
E —> A
Which of the following functional dependencies is implied by the above set.

  • Option : B
  • Explanation : CD—>A {CD —>E;E —> A; E —>C}
    CD —> C
    BC —> CD
    B—>D;
    CD—>E;
    E—>A;
    A—>C
    AC—>BC:
    A—>B:
    A—>C
Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *


5. Let R(A, B, C, D, E, P, G) be a relational schema in which the following functional dependencies are known to hold:
AB —> CD,
DE —> P,
C --> E,
P --> C and B —> G.
The relational schema R is

Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *