1.

When a particular transaction consistently waits or restarted and never gets a chance to proceed
further; this refers to………..
A. isolation B. deadlock C. starvation D. dirty read
2. ………. is a complete description of the database structure and constraints stored in the catalog.
A. DBMS B. Database Application C. Meta-data D. Database
3. ……Problem occurs when a transaction reads the same item twice and the item is changed between
the two reads.
A. dirty read B. Incorrect Summery C. lost update D. fuzzy read
4. Transaction …………means transaction shouldn’t make its updates visible to other transactions
until it is committed.
A. consistency B. isolation C. atomicity D. durability
5. A transaction that already holds a read lock on item X is allowed under certain conditions to convert
the read lock to write lock; this is referred to as………….
A. lock shrinking B. lock downgrade C. Lock upgrade D. lock expanding
6. A schedule can be tested against conflict serializability by constructing ………..
A. Histogram B. wait-for-graph C. Gantt chart D. Precedence graph
7. ……….is one of the DBMS functions, which allows shared access of the database.
A. concurrency control B. integrity C. recovery D. query processing
8. Confidentiality is one of the……….
A. Security pillars B. access controls C. rules D. technical controls
9. ………… system prevents unauthorized users accessing the database.
A. Integrity B. Security C. Concurrency control D. Recovery
10. The schedule S: r2(x), w1 (x), r2(x), w1(x), C1, C2 causes ……….. problem
A. fuzzy read B. lost update C. Incorrect Summery D. dirty read
11. The schedule S: S: r1(x), w1(x), r2 (x), w2(x), A1, C2 causes ……….. problem
A. fuzzy read B. lost update C. Incorrect Summery D. dirty read
12. In the access matrix model, the rows of a matrix may represent……..
A. read operation B. record C. users D. privilege
13. …………….. means transaction is an atomic unit of processing.
A. correct B. isolation C. atomicity D. defined
14. A transaction completes its execution is said to be ………………..
A. aborted B. loaded C. committed D. rolled back
15. When transaction Ti requests a data item currently held by Tj , Ti is allowed to wait only if it has a
timestamp smaller than that of Tj (Ti is older than Tj ). Otherwise, Ti is rolled back. This is ………
A. Wait B. Wait-Die C. Wound-Wait D. Wait-wound
16. Two modes of locking a data item, are termed as 'shared' and……………….
A. Composite B. Compatible C. Exclusive D. Linear
17. In ……, a transaction locks all data items it refers to before it begins execution.
A. two-phase locking B. deadlock prevention C. deadlock detection D. starvation
18. If a transaction T is rolled back, and transaction S reads the value of item X written by T, then ……..
A. T holds a lock on X B. T will be rolled back
C. T waits until S unlocked the item X D. S will be rolled back
19. Which statement represents the query “find all staff names with a salary greater than 5000”?
A. SELECT name WHERE salary > 5000;
B. SELECT name FROM staff WHERE salary > 5000;
C. SELECT salary > 5000 FROM staff;
D. SELECT * FROM staff;
20. In the access matrix model, the columns of a matrix may represent…….
A. program B. account C. update operation D. views

Question 2: State true or false and correct the wrong statement (10 Marks)
1. A schedule S is serializable if it contains transactions executed one by one. (F) is equivalent to some serial
schedule.
2. In RBAC: Roles May exist before users do. (T)
3. Properties of transactions (ACID) refer to Automated, Correct, Integrated, Defined. (F) atomicity,
consistency, isolation, durability
4. The graph which used to detect the dead lock is called the Precedence graph. (F) Wait for graph
5. A shared lock allows update operations of transactions to occur. (F) Read
Question 3: (20 Marks)
A. What is the difference between Authentication and Authorization in database security?
Authentication Authorization
refers to the process of identifying a user. refers to the process of determining what a user can do.
authentication occurs during both initial login and each authorization occurs every time a user attempts to
time a user attempts to use a database for the first perform any operation within a database.
time during a session.

B. Discuss the limitations of the file based approach.

C. What is meant by deadlock problem Deadlock occurs when each transaction T in a set of two or more
transactions is waiting for some item that is locked by some other transaction T in the set
D. What is the difference between strict and rigorous two phase locking?
strict rigorous
holds write-locks until it commits. holds all locks (read and write).