GATE CSE 2026 Set 1 | Functional Dependencies and Normalization Question 3 | Database Management System

PREVIOUS NEXT

GATE CSE 2026 Set 1

MCQ (More than One Correct Answer)

-0

In the context of relational database normalization, which of the following statements is/ are true?

It is always possible to obtain a dependency-preserving 3NF decomposition of a relation

It is always possible to obtain a dependency-preserving 1NF decomposition of a relation

It is not always possible to obtain a dependency-preserving BCNF decomposition of a relation

It is not always possible to obtain a dependency-preserving 2NF decomposition of a relation

GATE CSE 2024 Set 1

MCQ (More than One Correct Answer)

-0

Which of the following statements about a relation $R$ in first normal form (1NF) is/are TRUE?

$R$ can have a multi-attribute key

$R$ cannot have a foreign key

$R$ cannot have a composite attribute

$R$ cannot have more than one candidate key

GATE CSE 2022

MCQ (Single Correct Answer)

-0.33

In a relational data model, which one of the following statements is TRUE?

A relation with only two attributes is always in BCNF.

If all attributes of a relation are prime attributes, then the relation is in BCNF.

Every relation has at least one non-prime attribute.

BCNF decompositions preserve functional dependencies.

GATE CSE 2022

Numerical

-0

Consider a relation R(A, B, C, D, E) with the following three functional dependencies.

AB $$\to$$ C ; BC $$\to$$ D ; C $$\to$$ E;

The number of superkeys in the relation R is _________.

Your input ____

PREVIOUS NEXT

GATE CSE Subjects

Browse all chapters by subject

Theory of Computation

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

Operating Systems

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

Algorithms

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

Digital Logic

Sequential Circuits Boolean Algebra K Maps Combinational Circuits Number Systems

Database Management System

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

Data Structures

Arrays Stacks and Queues Linked List Trees Graphs Hashing

Computer Networks

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

Software Engineering

Compiler Design

Syntax Directed Translation Parsing Lexical Analysis Code Generation and Optimization

Web Technologies

General Aptitude

Verbal Ability Logical Reasoning Numerical Ability

Discrete Mathematics

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

Programming Languages

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

Computer Organization

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