GATE CSE 2016 Set 1 | Er Diagrams Question 4 | Database Management System

GATE CSE 2016 Set 1

MCQ (Single Correct Answer)

-0.3

Which of the following is NOT a superkey in a relational schema with attributes $$V, W, X, Y, Z$$ and primary key $$V Y?$$

$$VXYZ$$

$$VWXZ$$

$$VWXY$$

$$VWXYZ$$

GATE CSE 2014 Set 2

Numerical

-0

Given an instance of the STUDENTS relation as shown below: GATE CSE 2014 Set 2 Database Management System - Er Diagrams Question 12 English

For (StudentName, StudentAge) to be a key for this instance, the value $$X$$ should NOT be equal to ________.

Your input ____

GATE CSE 2013

MCQ (Single Correct Answer)

-0.3

An index is clustered, if

It is on a set of fields that form a candidate key.

It is on a set of fields that include the primary key.

The data records of the file are organized in the same order as the data entries of the index.

The data records of the file are organized not in the same order as the data entries of the index.

GATE CSE 2012

MCQ (Single Correct Answer)

-0.3

Given the basic $$ER$$ and relational models, which of the following is INCORRECT?

An attribute of an entity can have more than one value

An attribute of an entity can be composite

In a row of a relational table, an attribute can have more than one value

In a row of a relational table, an attribute can have exactly one value or a NULL value

PREVIOUS NEXT

GATE CSE Subjects

Discrete Mathematics

Graph Theory Set Theory & Algebra Combinatorics Mathematical Logic Probability Linear Algebra 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

K Maps Boolean Algebra Combinational Circuits Number Systems 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

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

Algorithms

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

Compiler Design

Lexical Analysis Parsing Syntax Directed Translation Code Generation and Optimization

Software Engineering

Web Technologies

General Aptitude

Numerical Ability Verbal Ability