GATE CS Normal Forms questions
Practise Normal Forms questions for GATE CS. Explore official PYQs and original topic-wise quizzes, check answers and view available solutions. Free, no sign-in.
Subject, topic, year and type filter the full library. Match any choice within a filter, and all selected filter categories. Search, source and sort apply to this page.
20 on this page
Let and be the attributes of a relation in a relational schema. Let indicate functional dependency in the context of a relational database, where . Which of the following options is/are always true?
In the context of relational database normalization, which of the following statements is/are true?
In the context of schema normalization in relational DBMS, consider a set of functional dependencies. The set of all functional dependencies implied by is called the closure of . To compute the closure of , Armstrong's Axioms can be applied. Consider , and as sets of attributes over a relational …
Consider a relational schema team , with functional dependencies . The relation team is decomposed into two relations, and . Which of the following statement(s) is/are TRUE?
Consider the following relational schema along with all the functional dependencies that hold on them. Which of the following statement(s) is/are TRUE?
Which of the following statements about a relation in first normal form is/are TRUE?
The symbol indicates functional dependency in the context of a relational database. Which of the following options is/are TRUE?
A functional dependency is termed as a useful functional dependency if and only if it satisfies all the following three conditions: is not the empty set. is not the empty set. Intersection of and is the empty set. For a relation with attributes, the total number of …
In a relational data model, which one of the following statements is
Consider a relation with the following three functional dependencies. The number of superkeys in the relation is ______________ .
Consider the relation with the following functional dependencies. Consider the decomposition of the relation into the constituent relations according to the following two decomposition schemes. …
Suppose the following functional dependencies hold on a relation with attributes , and : Which of the following functional dependencies can be inferred from the above functional dependencies?
Consider a relational table that is in , but not in BCNF. Which one of the following statements is TRUE?
Let the set of functional dependencies hold on a relation schema . is not in BCNF. Suppose is decomposed into two schemas and , where and . Consider the two statements given below. Both and are in BCNF Decomposition of …
Consider the following four relational schemas. For each schema , all non-trivial functional dependencies are listed, The bolded attributes are the respective primary keys. Registration(rollno, courses) Field ‘courses’ is a set-valued attribute containing the set of courses a student has registered for. Non-trivial functional dependency …
The following functional dependencies hold true for the relational schema : Which of the following is irreducible equivalent for this set of functional dependencies?
Which of the following is NOT a superkey in a relational schema with attributes and primary key ?
Consider two relations with the tuples and . Assume that is the full natural outer join of and . Consider the following tuples of the form Which one of the …
Consider the relation with the following set of functional dependencies Which of the following is the trivial functional dependency in , where is closure to F?
Given the following two statements: S1: Every table with two single-valued attributes is in and S2: is a minimal cover for the set of functional dependencies . Which one of the following is CORRECT?
