GATE CSE 2020 | Er Diagrams Question 4 | Database Management System

GATE CSE 2020

MCQ (Single Correct Answer)

-0.33

Which one of the following is used to represent the supporting many-one relationships of a weak entity set in an entity-relationship diagram?

Rectangles with double/bold border

Diamonds with double/bold border

Ovals that contain underlined identifiers

Ovals with double/bold border

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 14 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.

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

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

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

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 Lan Technologies and Wi-Fi Data Link Layer and Switching Network Layer Routing Algorithm TCP UDP Sockets and Congestion Control Application Layer Protocol Network Security

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

Numerical Ability Logical Reasoning Verbal Ability