ExamSIDE (Powered by ExamGOAL)
Questions
PREVIOUS NEXT
1
GATE CSE 2012
MCQ (Single Correct Answer)
+1
-0.3
Which of the following is TRUE?
A
Every relation in $$3NF$$ is also in $$BCNF$$
B
A relation $$R$$ is in $$3NF$$ if every non-prime attribute of $$R$$ is fully functionally dependent on every key of $$R$$
C
Every relation in $$BCNF$$ is also in $$3NF$$
D
No relation can be in both $$BCNF$$ and $$3NF$$
2
GATE CSE 2005
MCQ (Single Correct Answer)
+1
-0.3
Which one of the following statements about normal forms is FALSE?
A
$$BCNF$$ is stricter than $$3NF$$
B
Lossless, dependency $$-$$ preserving decomposition into $$3NF$$ is always possible
C
Lossless, dependency - preserving decomposition into $$BCNF$$ is always possible
D
Any relation with two attributes is in $$BCNF$$
3
GATE CSE 2005
MCQ (Single Correct Answer)
+1
-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
A
$$1NF$$
B
$$2NF$$
C
$$3NF$$
D
None of these
4
GATE CSE 2002
MCQ (Single Correct Answer)
+1
-0.3
Relation $$R$$ with an associated set of functional dependencies, $$F,$$ is decomposed into $$BCNF.$$ The redundancy (arising out of functional dependencies) in the resulting set of relations is
A
Zero
B
More than zero but less than that of an equivalent $$3NF$$ decomposition
C
Proportional to the size of $${F^ + }$$
D
Indeterminate
PREVIOUS NEXT
GATE CSE Subjects
Theory of Computation
Undecidability Finite Automata and Regular Language Push Down Automata and Context Free Language Recursively Enumerable Language and Turing Machine
Operating Systems
Process Concepts and Cpu Scheduling Synchronization and Concurrency File System IO and Protection Deadlocks Memory Management
Algorithms
Complexity Analysis and Asymptotic Notations Searching and Sorting Divide and Conquer Method Greedy Method Dynamic Programming P and NP Concepts
Digital Logic
Number Systems Boolean Algebra K Maps Combinational Circuits Sequential Circuits
Database Management System
Structured Query Language Transactions and Concurrency Functional Dependencies and Normalization Relational Algebra File Structures and Indexing Er Diagrams
Data Structures
Arrays Stacks and Queues Linked List Trees Graphs Hashing
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
Software Engineering
Software Engineering
Compiler Design
Lexical Analysis Parsing Syntax Directed Translation Code Generation and Optimization
Web Technologies
Web Technologies
General Aptitude
Verbal Ability Numerical Ability
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
Computer Organization
Computer Arithmetic Memory Interfacing Pipelining Machine Instructions and Addressing Modes Alu Data Path and Control Unit IO Interface Secondary Memory
EXAM MAP
Joint Entrance Examination
JEE MainJEE AdvancedWB JEEBITSATMHT CETKCETCOMEDKVITEEE
Medical
NEET
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
CBSE
Class 12