1
GATE CSE 2000
MCQ (Single Correct Answer)
+2
-0.6
Given relations r( w, x ) and s( y, z ), the result of

select distinct w,x
from r, s;
is guaranteed to be same as r, provided
A
r has no duplicates and s is non-empty
B
r and s have no duplicates
C
s has no duplicates and r is non-empty
D
r and s have the same number of tuples
2
GATE CSE 2000
MCQ (Single Correct Answer)
+2
-0.6
In SQL, relations can contain null values, and comparisons with null values are treated as unknown. Suppose all comparisons with a null value are treated as false. Which of the following pairs is not equivalent?
A
x = 5        not (not (x = 5)
B
x = 5        x > 4 and x < 6,
where x is an integer
C
x ≠ 5        not (x = 5)
D
None of the above
3
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
4
GATE CSE 2000
MCQ (Single Correct Answer)
+1
-0.3
B+-trees are preferred to binary trees in databases because
A
Disk capacities are greater than memory capacities
B
Disk access is much slower than memory access
C
Disk data transfer rates are much less than memory data transfer rates
D
Disks are more reliable than memory
EXAM MAP
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