DBD_Set 3
QN=55 The normal form that is not necessarily dependency preserving is
aa. 2NF
QN=66 Manager salary details are hidden from the employee .This is
aa. Conceptual level data hiding
QN=62 The FD A ? B , DB ? C implies
aa. DA ? C
QN=65 Relations produced from an E-R model will always be
aa. First normal form
QN=67 Which of the following is true for network structure?
aa. It is a physical representation of the data
QN=43 Which one is true statement?
aa. With finer degree of granularity of locking a high degree of concurrency is possible
QN=61 In E-R Diagram total participation is represented by
aa. double line
QN=30 Shadow paging has
aa. no redo
QN=31 If the closure of an attribute set is the entire relation then the attribute set is a
aa. superkey
QN=56 A functional dependency of the form x ? y is trivial if
aa. y ? x
QN=39 Which of the following aggregate functions does not ignore nulls in its results?.
bb. COUNT (*)
QN=57 The normalization was first proposed by
bb. Codd
QN=53 In multiple granularity of locks SIX lock is compatible with
bb. IS
QN=51 The cost of reading and writing temporary files while evaluating a query can be reduced by
bb. Pipelining
QN=59 Which of the following is not a characteristic of a relational database model?
bb. Tree like structure
QN=47 If an entity can belong to only one lower level entity then the constraint is
bb. partial
QN=64 Union operator is a :
cc. Binary Operator
QN=52 A transaction is in state after the final statement has been executed.
cc. Committed
QN=32 DROP is a statement in SQL
cc. DDL
QN=68 Which two files are used during operation of the DBMS?
cc. Data dictionary and transaction log
QN=60 Assume transaction A holds a shared lock R. If transaction B also requests for a shared lock on R
cc. It will immediately be granted
QN=35 In 2NF
cc. No partial FDs exist
QN=37 In an E-R, Y is the dominant entity and X is a subordinate entity. Then which of the following is incorrect
cc. Operationally, if X is deleted, so is Y
QN=38 Relational Algebra is
cc. Procedural query Language
QN=63 The graphical representation of a query is
cc. Query Tree
QN=34 The keyword to eliminate duplicate rows from the query result in SQL is
cc. UNIQUE
QN=50 Use of UNIQUE while defining an attribute of a table in SQL means that the attribute values are
cc. both (A) & (B)
QN=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
cc. mn and 0
QN=48 The common column is eliminated in
cc. natural join
QN=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
cc. the compound key first name and last name
QN=36 Which one is correct statement? Logical data independence provides following without changing application programs: (i) Changes in access methods. (ii) Adding new entities in database (iii) Splitting an existing record into two or more records (iv) Changing storage medium
dd. (ii) and (iii)
QN=40 R (A,B,C,D) is a relation. Which of the following does not have a lossless join dependency preserving BCNF decomposition
dd. A?BCD
QN=46 Which of the following is a reason to model data?
dd. All of the above
QN=49 In SQL, testing whether a subquery is empty is done using
dd. EXISTS
QN=42 Maximum height of a B+ tree of order m with n key values is
dd. None of these
QN=45 Which of the following concurrency control schemes is not based on the serializability property?
dd. None of these
QN=44 Which of the following statement on the view concept in SQL is invalid?
dd. The definition of a view should not have GROUP BY clause in it
QN=54 The statement that is executed automatically by the system as a side effect of the modification of the database is
dd. Trigger
QN=33 If two relations R and S are joined, then the non matching tuples of both R and S are ignored in
dd. inner join
QN=58 The division operator divides a dividend A of degree m+n by a divisor relation B of degree n and produces a result of degree
dd. m