21.  If the decomposition is able to represent all the facts about the relation then such a decomposition is called as? 
Answer: (a).Lossless decomposition

22.  A domain whose elements are indivisible is called as ______ 
Answer: (c).Atomic domain

23.  If all the domains are atomic then the relational schema is in ________ normal form 
Answer: (a).1

24.  State true or false: Composite attributes have nonatomic domains. 
Answer: (b).False

25.  State true or false: Redundancy is desired in a relational schema 
Answer: (b).False

26.  An instance of a relation that satisfies all real world constraints is known as? 
Answer: (d).Legal relation

27.  If K → R then K is said to be the _______ of R 
Answer: (c).Super key

28.  X → Y holds on a schema k(K) if? 
Answer: (c).Each and every legal instance satisfies the functional dependency

29.  X→ Y is trivial if? 
Answer: (a).X ⊂ Y

30.  Which of the following is not a condition for X→ Y in Boyce codd normal form? 
Answer: (c).Y is the superkey for the relational schema R
