Relational Data Model: Concept of relations, Schema-instance distinction, Keys, referential

integrity and foreign keys, Relational algebra operators, Tuple relation calculus, Domain
relational calculus. Physical and logical hierarchy: Concept of index, B-trees, hash index,
function index, bitmap index. Concepts of Functional dependency, Normalization (1NF, 2NF,
3NF, BCNF, etc).

Sr. Question Options Answer

No.
1. a. Subset of a b. Subset of a
A Relation is a Cartesian product Cartesian product
of a list of of a list of
attributes domains
b. Subset of a
Cartesian product
of a list of domains
c. Subset of a
Cartesian product
of a list of tuple
d. Subset of a
Cartesian product
of a list of relations
2. In mathematical term Table a. Relation a. relation
is referred as b. Attribute
c. Table
d. domain
3. In mathematical term Row is a. Relation c. tuple
referred as b. Attribute
c. Tuple
d. domain
4. _______ allow us to identify a. Superkey a. Superkey
uniquely a tuple in the b. Domain
relation. c. Attribute
d. Schema
5. Minimal Superkeys are a. Schema keys b. Candidate keys
called b. Candidate keys
c. Domain keys
d. Attribute keys
6. Who proposed the relational a. Bill Gates b. E.F. Codd
model? b. E.F. Codd
c. Herman Hollerith
d. Charles Babbage
7. Which of the following in a. Every primary-key c. Every foreign-key
true regarding Referential value must match a value must match
Integrity? primary-key value a primary-key
 in an associated value in an
table associated table
b. Every primary-key
value must match a
foreign-key value
in an associated
table
c. Every foreign-key
value must match a
primary-key value
in an associated
table
d. Every foreign-key
value must match a
foreign-key value
in an associated
table
8. How many types of keys in a. Candidate key d. All of these
Database Design? b. Primary key
c. Foreign key
d. All of these
9. Domain constraints, a. Foreign key c. Assertion
functional dependency and b. Primary key
referential integrity are c. Assertion
special forms of _________. d. Referential
constraint
10. Which one of the following a. Secondary Key b. Primary key
uniquely identifies the b. Primary key
elements in the relation? c. Composite key
d. Foreign key
11. A _____ is a property of the a. Rows b. rows
entire relation, rather than of b. Key
the individual tuples in which c. Attribute
each tuple is unique. d. Fields
12. Which one of the following a. Name c. Id
attribute can be taken as a b. Street
primary key ? c. Id
d. Department
13. A relation is considered a: a. Column c. two-dimensional table
b. one-dimensional
table
c. two-dimensional
table
d. three-dimensional
table
14. A key: a. must always be c. identifies a row.
composed of two
or more columns.
b. can only be one
column.
c. identifies a row.
d. identifies a
column.
15. In the relational models, a. Number of tuples a. Number of tuples
cardinality is termed as: b. Number of
attributes
c. Number of table
d. Number of
constraints
16. Key to represent relationship a. Primary key c. Foreign Key
between tables is called b. Secondary Key
c. Foreign Key
d. None of these
17. Which of the following is a. Reflexivity rule c. Pseudotransitivity rule
not Armstrong’s Axiom? c. Transitivity rule
c. Pseudotransitivity rule
d. Augmentation rule
18. Inst_dept (ID, name, salary, This comes under d) Both Lossy and Lossy-
dept name, building, budget) a) Lossy-join join decomposition
is decomposed into decomposition
b) Lossy decomposition
instructor (ID, name, dept c) Lossless-join
decomposition
name, salary)
d) Both Lossy and Lossy-
department (dept name, join decomposition
building, budget)

19. There are two functional This can be combined as a) A->BC

dependencies with the same a) A->BC
set of attributes on the left b) A->B
side of the arrow: c) B->C
A->BC d) None of the mentioned
A->B

20. Consider a relation The number of superkeys c) 10

R(A,B,C,D,E) with the of R is:
following functional a) 2
dependencies: b) 7
c) 10
ABC -> DE and d) 12
 D -> AB

21. Suppose we wish to find the Which, if any, of the two a) Both I and II
ID’s of the employees that queries above will
are managed by people who correctly (in SQL2) get the
are managed by the desired set of employee
employee with ID 123. Here ID’s?
are two possible queries: a) Both I and II
b) I only
I.SELECT ee.empID c) II only
d) Neither I nor I
FROM Emps ee, Emps ff
WHERE ee.mgrID =
ff.empID AND ff.mgrID =
123;
II.SELECT empID
FROM Emps
WHERE mgrID IN
(SELECT empID FROM
Emps WHERE mgrID =
123);

22. Suppose relation Which of the following is c) B, C

R(A,B,C,D,E) has the not a key?
following functional a) A
dependencies: b) E
c) B, C
A -> B d) D
B -> C
BC -> A
A -> D
E -> A
D -> E

23. Which of the following is

not a valid SQL type? a. FLOAT c. DECIMAL
b. NUMERIC
c. DECIMAL
 d. CHARACTER

24. Which of the following are

TCL commands? a. COMMIT and a. COMMIT and
ROLLBACK ROLLBACK
b. UPDATE and
TRUNCATE
c. SELECT and
INSERT
d. GRANT and
REVOKE

25. How many Primary keys can

have in a table? a. Only 1 a. Only 1
b. Only 2
c. Depends on no of
Columns
d. Depends on DBA

26. Which of the following is

not a valid aggregate a. COUNT b. COMPUTE
function? b. COMPUTE
c. SUM
d. MAX

27. Which operator is used to

compare a value to a a. ANY d. IN
specified list of values? b. BETWEEN
c. ALL
d. IN
28. What operator tests column
for absence of data a. NOT Operator c. IS NULL Operator
b. Exists Operator
c. IS NULL Operator
d. None of the above

29. If we have not specified

ASC or DESC after a SQL a. DESC b. ASC
ORDER BY clause, the b. ASC
following is used by default
c. There is no default
value
d. None of the
mentioned

30. Which of the following is

also called an INNER JOIN? a. SELF JOIN b. EQUI JOIN
b. EQUI JOIN
c. NON-EQUI JOIN
d. None of the above

31. The tree structure diagram in

which the pointers of data are a. Tree b. B+ tree
stored at the leaf nodes of b. B+ tree
diagram is classified as c. B2 tree
d. B. tree

32. Which of the following is a

fundamental operation in a) Set intersection b) Natural join
relational algebra? b) Natural join
c) Assignment
d) None of the mentioned
33. The ___________ operation,
denoted by −, allows us to a) Union b) Set-difference
find tuples that are in one b) Set-difference
relation but are not in
another.
 c) Difference
d) Intersection
34. The relational algebra query A. Analytical B. Procedural
language is ___. B. Procedural
C. Symmetrical
D. Instrumental

35. How many types of relational A. 6 B. 7

operations are there? B. 7
C. 8
D. 9

36. Select operation is denoted A. σ A. Σ

by - B. R
C. P
D. S

37. What is Project Operation A. P D.∏

denoted by – B. R
C. O
D. ∏

38. In ___ products, the rows in A. Cross C. Both A and B

one table are combined with B. Cartesian
the rows in another table. C. Both A and B
D. None of the above