GATE CSE 2014 Set 2 | Functional Dependencies and Normalization Question 12 | Database Management System

PREVIOUS NEXT

GATE CSE 2014 Set 2

Numerical

-0

The maximum number of superkeys for the relation schema $$R(E, F, G, H)$$ with $$E$$ as key is ______.

Your input ____

GATE CSE 2012

MCQ (Single Correct Answer)

-0.3

Which of the following is TRUE?

Every relation in $$3NF$$ is also in $$BCNF$$

A relation $$R$$ is in $$3NF$$ if every non-prime attribute of $$R$$ is fully functionally dependent on every key of $$R$$

Every relation in $$BCNF$$ is also in $$3NF$$

No relation can be in both $$BCNF$$ and $$3NF$$

GATE CSE 2005

MCQ (Single Correct Answer)

-0.3

Which one of the following statements about normal forms is FALSE?

$$BCNF$$ is stricter than $$3NF$$

Lossless, dependency $$-$$ preserving decomposition into $$3NF$$ is always possible

Lossless, dependency - preserving decomposition into $$BCNF$$ is always possible

Any relation with two attributes is in $$BCNF$$

GATE CSE 2005

MCQ (Single Correct Answer)

-0.3

A table has fields, $$F1, F2, F3, F4, F5,$$ with the following functional dependencies:
$$F1 \to F3.\,F2 \to F4.\,\,\,\left( {F1\,.\,F2} \right) \to F5$$ in terms of Normalization, this table is in

$$1NF$$

$$2NF$$

$$3NF$$

None of these

PREVIOUS NEXT

GATE CSE Subjects

Discrete Mathematics

Mathematical Logic Probability Set Theory & Algebra Combinatorics Linear Algebra Graph Theory Calculus

Programming Languages

Basic of Programming Language Function and Recursion Pointer and Structure in C

Theory of Computation

Finite Automata and Regular Language Push Down Automata and Context Free Language Recursively Enumerable Language and Turing Machine Undecidability

Operating Systems

Process Concepts and Cpu Scheduling Synchronization and Concurrency Deadlocks Memory Management File System IO and Protection

Digital Logic

Number Systems Boolean Algebra K Maps Combinational Circuits Sequential Circuits

Computer Organization

Computer Arithmetic Memory Interfacing Pipelining Machine Instructions and Addressing Modes Alu Data Path and Control Unit IO Interface Secondary Memory

Database Management System

Structured Query Language Transactions and Concurrency Functional Dependencies and Normalization Relational Algebra File Structures and Indexing Er Diagrams

Data Structures

Trees Hashing Arrays Linked List Graphs Stacks and Queues

Computer Networks

Network Security Data Link Layer and Switching Application Layer Protocol Network Layer Routing Algorithm Concepts of Layering Lan Technologies and Wi-Fi TCP UDP Sockets and Congestion Control

Algorithms

Complexity Analysis and Asymptotic Notations Searching and Sorting Divide and Conquer Method Greedy Method P and NP Concepts Dynamic Programming

Compiler Design

Lexical Analysis Parsing Syntax Directed Translation Code Generation and Optimization

Software Engineering

Web Technologies

General Aptitude

Verbal Ability Numerical Ability