adplus-dvertising
frame-decoration

Question

Consider a relation R (A, B, C, D, E, F, G, H), where each attribute is atomic, and following functional dependencies exist.

CH → G
A → BC
B → CFH
E → A
F → EG

The relation R is ....................

a.

in 1NF but not in 2NF

b.

in 2NF but not in 3NF

c.

in 3NF but not in BCNF

d.

in BCNF

Answer: (a).in 1NF but not in 2NF

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. Consider a relation R (A, B, C, D, E, F, G, H), where each attribute is atomic, and following functional dependencies exist. CH → G A → BC B → CFH E → A F → EG The...
Shannu Be : June 26, 2023

kindly give explanation

Similar Questions

Discover Related MCQs

Q. Which of the following is true ?

Q. In DML, RECONNECT command cannot be used with

Q. A hash function f defined as f (key) = key mod 13, with linear probing is used to insert keys 55, 58, 68, 91, 27, 145. What will be the location of 79 ?

Q. The User Work Area (UWA) is a set of Program variables declared in the host program to communicate the contents of individual records between

Q. Given a Relation POSITION (Posting-No, Skill), then query to retrieve all distinct pairs of posting-nos requiring skill is

Q. If a relation with a Schema R is decomposed into two relations R1 and R2 such that (R1 ∪ R2) = R1 then which one of the following is to be satisfied for a lossless joint decomposition (---> indicates functional dependency)

Q. Which level of Abstraction describes how data are stored in the data base ? 

Q. Third normal form is based on the concept of ______.

Q. The student. marks should not be greater than 100. This  is

Q. GO BOTTOM and SKIP-3 commands are given one after another in a database file of 30 records. It shifts the control to

Q. An ER Model includes
1. An ER diagram portraying entity types.
II. Attributes for each entity type
III. Relationships among . entity types.
IV. Semantic integrity constraints that reflects the business rules about data not captured in the ERdiagram.

Q. Based on the cardinality ratio and participation______________associated with a relationship type, choose either the Foreign Key Design, the Cross Referencing Design or Mutual Referencing Design.

Q. Data Integrity control uses _______________

Q. Consider the following schemas
Branch = (Branch-name, Assets, Branch-city)
Customer = (Customer-name, Bank name, Customer-city)
Borrow = (Branch~name, loannumber, customer account-number)
Deposit = (Branch-name, Accountnumber,
Customer-name, Balance)
Using relational Algebra, the Query that finds customers who have balance more than 10,000 is_______

Q. Find the false statement :

Q. Consider the table:

Student (stuid, name, course, marks)
Which one of the following two queries is correct to find the highest marks student in course 5 ?

Q.1. Select S.stuid From student S Where not exists  (select * from student e where e.course = '5' and e.marks ≥s.marks)

Q.2. Select s.stuid From student S Where s.marks >any (select distinct marks from student S where s.course =5)

Q. Armstrong (1974) proposed systematic approach to derive functional dependencies. Match the following w.r.t. functional dependencies:

a.Decomposition Rule (i)   If X →Y and Z →W then {X, Z} → {Y, W}

b. Union Rule (ii)  If X →Y an  {Y,W} → Z then {X, W} → Z

c. Composition Rule (iii) If X →Y and X →Z then X → {Y, Z}
 
d. Pseudo transitivity Rule (iv) If X →{Y,Z} and  {Y,W} → Z then X → Y and  X →Z

Q. Match the following:
List - I                                         List - II

a. Secondary                          i.    Functional Dependency
Index

b. Nonprocedural                  ii.  B-Tree
Query
Language

c. Closure of                           iii. Relational Algebraic
set of                                                Operation
Attributes

d.  Natural                              iv. Domain Calculus
JOIN

Q. The best normal form of relation scheme R(A. B, C, D) along with the set of functional dependencies F = {AB → C, AB → D, C → A, D → B} is

Q. Identify the minimal key for relational scheme R(A, B, C, D, E) with functional dependencies F = {A → B, B → C, AC → D}