Sri Indu Institute of Engineering & Technology
Sheriguda (V), Ibrahimpatnam (M), R.R.Dist-501 510
Year& Branch:II CSE (A,B,C) DATABASE MANAGEMENT SYSTEMS
ROLL NO: DATE: 23-04-19(FN) NAME:
Fill all the multiple choice questions ,each carry 0.5 marks (10*0.5=5 marks)
1. A _________ consists of a sequence of query and/or update statements. [ ]
A. Transaction B. Commit C. Rollback D. Flashback
2. In order to undo the work of transaction after last commit which one should [ ]
be used ?
A. View B. Commit C. Rollback D. Flashback
3. In order to maintain the consistency during transactions database provides [ ]
A. Commit B. Atomic C. Flashback D. Retain
4. Consider a B+-tree in which the maximum number of keys in a node is 5. [ ]
What is the minimum number of keys in any non-root node?
A. 1 B. 2 C. 3 D. 4
5. A file is organized so that the ordering of data records is the same
as or close to the ordering of data entries in some index. [ ]
Then that index is called
A. Dense B. Sparse C. Clustered D. Unclustered
6. Which of the following is correct? [ ]
A. B-trees are for storing data on disk and B+ trees are for main memory.
B. Range queries are faster on B+ trees.
C. B-trees are for primary indexes and B+ trees are for secondary indexes.
D. The height of a B+ tree is independent of the number of records.
7. Which of the following concurrency control protocols ensure both conflict [ ]
serialzability and freedom from deadlock? I. 2-phase locking II. Time-stamp ordering
A.I only B. II only C. Both I and II D. Neither I nor II
8. Which of the following scenarios may lead to an irrecoverable error in a [ ]
database system ?
A.A transaction writes a data item after it is read by an uncommitted transaction
B.A transaction reads a data item after it is read by an uncommitted transaction
C.A transaction reads a data item after it is written by a committed transaction
D.A transaction reads a data item after it is written by an uncommitted transaction
9. Consider the following four schedules due to three transactions (indicated by the
subscript) using read and write on a data item x, denoted by r(x) and w(x) respectively.
Which one of them is conflict serializable _______________ [ ]
10. Consider a relation scheme R = (A, B, C, D, E, H) on which the following
functional dependencies hold: {A–>B, BC–>D, E–>C, D–>A}. What are the
candidate keys of R? [ ]
A. AE, BE B. AE, BE, DE C. AEH, BEH, BCH D. AEH, BEH, DEH
Fill all blanks with answer ,each carry 0.5 marks . (10*0.5=5 marks)
11. ______ will undo all statements up to commit?
12. Consider the following transaction involving two bank accounts x and y.
read(x); x := x – 50; write(x); read(y); y := y + 50; write(y)
The constraint that the sum of the accounts x and y should remain constant is that of
____________________.
13. ______________ which increases the number of I/O operations needed to write a single
logical block, pays a significant time penalty in terms of write performance.
14. Consider the relation scheme R = {E, F, G, H, I, J, K, L, M, M} and the set of functional
dependencies {{E, F} -> {G}, {F} -> {I, J}, {E, H} -> {K, L}, K -> {M}, L -> {N} on R.
What is the key for R? _____________.
15. The relation scheme Student Performance (name, courseNo, rollNo, grade) has the
following functional dependencies:
name, courseNo → grade
rollNo, courseNo → grade
name → rollNo
rollNo → name
The highest normal form of this relation scheme is____________________.
16. The physical location of a record determined by a formula that transforms a file key into
a record location is_________________.
17. In RDBMS, different classes of relations are created using __________ technique to
prevent modification anomalies.
18. In __________ allocation method for disk block allocation in a file system, insertion and
deletion of blocks in a file is easy.
19. The directory can be viewed as ________ that translates filenames into their directory
entries.
20. In a Hierachical database, a hashing function is used to locate the ________.
