ExamSIDE (Powered by ExamGOAL)
Questions
PREVIOUS NEXT
1
GATE CSE 2000
MCQ (Single Correct Answer)
+1
-0.3

Given the relations

employee (name, salary, deptno), and
department (deptno, deptname, address)

Which of the following queries cannot be expressed using the basic relational algebra operations $$\left(\sigma, \pi,\times ,\Join, \cup, \cap,-\right)$$?
A
Department address of every employee
B
Employees whose name is the same as their department name
C
The sum of all employee’s salaries
D
All employees of a given department
2
GATE CSE 1999
MCQ (Single Correct Answer)
+1
-0.3
Consider the join of a relation R with a relation S. If R has m tuples and S has n tuples then the maximum and minimum sizes of the join respectively are
A
m + n and 0
B
mn and 0
C
m + n and |m – n|
D
mn and m + n
3
GATE CSE 1999
MCQ (Single Correct Answer)
+1
-0.3

The relational algebra expression equivalent to the following tuple calculus expression:

$$\left\{ {t|t \in r \wedge \left( {t\left[ A \right] = 10 \wedge t\left[ B \right] = 20} \right)} \right\}$$ is:
A
$${\sigma _{\left( {A = 10 \vee B = 20} \right)}}\left( r \right)$$
B
$${\sigma _{\left( {A = 10} \right)}}\left( r \right) \cup {\sigma _{\left( {B = 20} \right)}}\left( r \right)$$
C
$${\sigma _{\left( {A = 10} \right)}}\left( r \right) \cap {\sigma _{\left( {B = 20} \right)}}\left( r \right)$$
D
$${\sigma _{\left( {A = 10} \right)}}\left( r \right) - {\sigma _{\left( {B = 20} \right)}}\left( r \right)$$
4
GATE CSE 1994
True or False
+1
-0
An instance of a relational scheme R(A, B, C) has distinct values for attribute A. Can you conclude that A is a candidate key for R?
A
TRUE
B
FALSE
PREVIOUS NEXT
GATE CSE Subjects
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 File System IO and Protection Deadlocks Memory Management
Algorithms
Complexity Analysis and Asymptotic Notations Searching and Sorting Divide and Conquer Method Greedy Method P and NP Concepts Dynamic Programming
Digital Logic
Number Systems Boolean Algebra K Maps Combinational Circuits Sequential Circuits
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
Software Engineering
Software Engineering
Compiler Design
Lexical Analysis Parsing Syntax Directed Translation Code Generation and Optimization
Web Technologies
Web Technologies
General Aptitude
Numerical Ability Logical Reasoning Verbal 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 Machine Instructions and Addressing Modes IO Interface Pipelining Alu Data Path and Control Unit Secondary Memory
EXAM MAP
Joint Entrance Examination
JEE MainJEE AdvancedWB JEEBITSATMHT CETKCETCOMEDKVITEEEAP EAPCET
Medical
NEETAIIMS
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
Civil Services
UPSC Civil Service
Defence
NDA
Staff Selection Commission
SSC CGL Tier I
CBSE
Class 12