Professional Documents
Culture Documents
Which of the following relational algebra operations do not require the participating
tables to be union-compatible?
(A) Union
(B) Intersection
(C) Difference
(D) Join
Ans: (D)
Q.2
Q.3
Ans: (C )
Q.4
Ans: (A)
Q.5
Q.6
The language that requires a user to specify the data to be retrieved without specifying
exactly how to get it is
(A) Procedural DML.
(B) Non-Procedural DML.
(C) Procedural DDL.
(D) Non-Procedural DDL.
Ans: (B)
Q.7
AC14/AT11
Ans: (A)
Q.8
The rule that a value of a foreign key must appear as a value of some specific table is
called a
(A) Referential constraint.
(B) Index.
(C) Integrity constraint.
(D) Functional dependency.
Ans: (A) The rule that a value of a foreign key must appear as a value of some specific
table is called a referential constraint. (Referential integrity constraint is concerned with
foreign key)
Q.9
The clause in SQL that specifies that the query result should be sorted in ascending or
descending order based on the values of one or more columns is
(A) View
(B) Order by
(C) Group by
(D) Having
Ans: (B) The clause in SQL that specifies that the query result should be sorted in
ascending or descending order based on the values of one or more columns is ORDER
BY. (ORDER BY clause is used to arrange the result of the SELECT statement)
Q.10
Q.11
According to the levels of abstraction, the schema at the intermediate level is called
(A) Logical schema.
(B)
Physical schema.
(C) Subschema.
(D)
Super schema.
Ans: According to the levels of abstraction, the schema at the intermediate level is called
conceptual schema.
(Note: All the options given in the question are wrong.)
Q.12
AC14/AT11
Q.13
Q.14
Q.15
Q.16
Q.17
Q.18
Q.19
AC14/AT11
Q.20
Q.21
Q.22
Q.23
As per equivalence rules for query transformation, selection operation distributes over
(A) Union.
(B) Intersection.
(C) Set difference.
(D) All of the above.
Ans: (D)
Q.24
Ans: (C)
Q.25
Q.26
Q.27
Ans: (A)
AC14/AT11
Q.28
Q.29
Ans: (C)
Q.30
(B) no undo
(D) neither redo nor undo
Ans: (A)
Q.31
If the closure of an attribute set is the entire relation then the attribute set is a
(A) superkey
(B) candidate key
(C) primary key
(D) not a key
Ans: (A)
Q.32
Ans: (C)
Q.33
If two relations R and S are joined, then the non matching tuples of both R and S are
ignored in
(A) left outer join
(B) right outer join
(C) full outer join
(D) inner join
Ans: (D)
Q.34
The keyword to eliminate duplicate rows from the query result in SQL is
(A) DISTINCT
(B) NO DUPLICATE
(C) UNIQUE
(D) None of the above
Ans: (C)
Q.35
In 2NF
(A) No functional dependencies (FDs) exist.
(B) No multivalued dependencies (MVDs) exist.
(C) No partial FDs exist.
(D) No partial MVDs exist.
5
AC14/AT11
Ans: (C)
Q.36
Ans: (D)
Q.37
In an E-R, Y is the dominant entity and X is a subordinate entity. Then which of the
following is incorrect :
(A) Operationally, if Y is deleted, so is X
(B) existence is dependent on Y.
(C) Operationally, if X is deleted, so is Y.
(D) Operationally, if X is deleted, & remains the same.
Ans: (C)
Q.38
Relational Algebra is
(A) Data Definition Language .
(B) Meta Language
(C) Procedural query Language
(D) None of the above
Ans: (C)
Q.39
Which of the following aggregate functions does not ignore nulls in its results?.
(A) COUNT .
(B) COUNT (*)
(C) MAX
(D) MIN
Ans: (B)
Q.40
R (A,B,C,D) is a relation. Which of the following does not have a lossless join
dependency preserving BCNF decomposition
(A) AB, BCD
(B) AB, BC, CD
.
(C) ABC, CAD
(D) ABCD
Ans: (D)
Q.41
Consider the join of relation R with a relation S. If R has m tuples and S has n
tuples, then the maximum and minimum size of the join respectively are
(A) m+n and 0
(B) m+n and |m-n|
(C) mn and 0
(D) mn and m+n
Ans: (C)
AC14/AT11
Q.42
Ans: (D)
Q.43
Ans: (A)
Q.44
Ans: (D)
Q.45
Ans: (D)
Q.46
Ans: (D)
Q.47
If an entity can belong to only one lower level entity then the constraint is
(A) disjoint
(B) partial
(C) overlapping
(D) single
Ans: (B)
Q.48
outer join
AC14/AT11
Ans: (C )
Q.49
Ans: (D)
Q.50
Use of UNIQUE while defining an attribute of a table in SQL means that the attribute
values are
(A) distinct values
(B) cannot have NULL
(C) both (A) & (B)
(D) same as primary key
Ans: (C)
Q.51
The cost of reading and writing temporary files while evaluating a query can be reduced
by
(A) building indices
(B) pipelining
(C) join ordering
(D) none of the above
Ans: (B)
Q.52
A transaction is in __________ state after the final statement has been executed.
(A) partially committed
(B) active
(C) committed
(D) none of the above
Ans: (C)
Q.53
Ans: (B)
Q.54
The statement that is executed automatically by the system as a side effect of the
modification of the database is
(A) backup
(B) assertion
(C) recovery
(D) trigger
Ans: (D)
Q.55
Ans: (A)
Q.56
AC14/AT11
(A)
(C)
(B)
(D)
yx
xy
Ans: (A)
Q.57
Ans: (B)
Q.58
Ans: (D)
Q.59
Ans: (B)
Q.60
Assume transaction A holds a shared lock R. If transaction B also requests for a shared
lock on R.
(A)
(B)
(C)
(D)
Ans: (C)
Q.61
Ans: (A)
Q.62
The FD A B , DB C implies
(A) DA C
(C) B A
(B) A C
(D) DB A
Ans: (A)
Q.63
AC14/AT11
Ans: (C)
Q.64
Union operator is a :
(A) Unary Operator
(C) Binary Operator
Ans: (C)
Q.65
Ans: (A)
Q.66
Ans: (A)
Q.67
Ans: (A)
Q.68
Ans: (C )
Q.69
A list consists of last names, first names, addresses and pin codes. If all people in the
list have the same last name and same pin code a useful key would be
(A) the pin code
(B) the last name
(C) the compound key first name and last name
(D) Tr from next page
Ans: (C )
Q.70
In b-tree the number of keys in each node is ____ than the number of its children.
(A) one less
(B) same
(C) one more
(D) half
10
AC14/AT11
Ans: (A)
Q.71
Ans: (D)
Q.72
Which normal form is considered adequate for normal relational database design?
(A) 2NF
(B) 5NF
(C) 4NF
(D) 3NF
Ans: (D)
Q.73
Which of the following addressing modes permits relocation without any change over
in the code?
(A) Indirect addressing
(B) Indexed addressing
(C) PC relative addressing
(D) Base register addressing
Ans: (B)
Q.74
In a multi-user database, if two users wish to update the same record at the same time,
they are prevented from doing so by
(A) jamming
(B) password
(C) documentation
(D) record lock
Ans: (D)
Q.75
Ans: (C)
Q.76
Which of the following relational algebraic operations is not from set theory?
(A) Union
(B) Intersection
(C) Cartesian Product
(D) Select
Ans: (D)
Q.77
Ans: (A)
Q.78
If both the functional dependencies : XY and YX hold for two attributes X and Y
then the relationship between X and Y is
11
AC14/AT11
(A) M:N
(C) 1:1
Ans: (C)
Q.79
What will be the number of columns and rows respectively obtained for the operation, AB, if A B are Base union compatible and all the rows of a are common to B? Assume A
has 4 columns and 10 rows; and B has 4 columns and 15 rows
(A) 4,0
(B) 0,0
(C) 4,5
(D) 8,5
Ans: (A)
Q.80
For correct behaviour during recovery, undo and redo operation must be
(A) Commutative
(B) Associative
(C) idempotent
(D) distributive
Ans: (C)
Q.81
Ans: (D)
Q.82
Ans: (A)
Q.83
The part of a database management system which ensures that the data remains in a
consistent state is
(A) authorization and integrity manager
(B) buffer manager
(C) transaction manager
(D) file manager
Ans: (C)
Q.84
Ans: (A)
Q.85
AC14/AT11
Ans: (D)
Q.86
(B)
(D) None of the above
Ans: (A)
Q.87
Ans: (D)
Q. 88
Ans: (D)
Q.89
(B) 1 E1^2 E2
(C) E1 1 2E2
Ans: (A)
Q.90
Ans: (D)
Q. 91
Ans: (D)
Q.92
Whenever two independent one-to-many relationships are mixed in the same relation, a
_______ arises.
(A) Functional dependency
(B) Multi-valued dependency
(C) Transitive dependency
(D) Partial dependency
13
AC14/AT11
Ans:(B)
Q.93
Ans: (D)
Q.94
Ans: (A)
Q.95
Which is the best file organization when data is frequently added or deleted from a file?
(A) Sequential
(B) Direct
(C) Index sequential
(D) None of the above
Ans: (B)
Q.96
Which of the following constitutes a basic set of operations for manipulating relational
data?
(A) Predicate calculus
(B) Relational calculus
(C) Relational algebra
(D) SQL
Ans: (C)
Q.97
An advantage of views is
(A) Data security
(C) Hiding of complex queries
Ans: (A)
Q.98
Ans: (C)
Q.99
Ans: (C)
Q.100
_______ operator is used to compare a value to a list of literals values that have been
specified.
(A) Like
(C) BETWEEN
Ans: (A)
(B) COMPARE
(D) IN
14