Gujarat Technological University 2010 M.C.A Database Management Systems – II - Question Paper
Seat No. Enrolment No.
GUJARAT TECHNOLOGICAL UNIVERSITY
MCA. Sem-II Examination July 2010
Subject code: 620006 Subject Name: Database Management System II Date: 08 / 07 /2010 Time: 11.00 am - 01.30 pm
Total Marks: 70
2. Make suitable assumptions wherever necessary.
3. Figures to the right indicate full marks.
Q.1 (a) (i) Explain the properties of transaction with example. 07
(ii) Draw and explain state transition diagram for transaction execution.
(b) Explain grant and revoke privileges with example for discretionary access 07 control.
State whether the following statements are true or false. Justify. No 07 Justification, no marks.
Q.2 (a)
(1) A firewall is a system designed to prevent unauthorized access to or from a public network.
(2) A check point is a point of synchronization between the database and the transaction log file.
(3) The assignment and management of memory blocks is called the buffer management.
(4) Level 1 transaction is the minimum consistency requirement that allows a transaction to be recovered in the event of system failure.
(5) There is no deadlock in the timestamp method of concurrency control.
(6) A candidate key is an attribute which can uniquely identify a row in a table.
(7) Heuristic rules are used as an optimization technique to modify the internal representation of a query.
Consider the following relations: 07
(b)
Suppliers (Sid, S_name, Address)
Parts (Pid, P_name, Colour)
Catalogue(Sid, Pid, Cost)
The key fields are underlined. Write the following queries in relational algebra.
1) Find the names of suppliers who supply some red parts.
2) Find the Pid of parts supplied by every supplier at less than INR 500.
3) Find the Pid of parts that are supplied by at least two different suppliers.
4) Find the Sid of suppliers who supply every part or green part.
5) Find the Sid of suppliers who supply every part.
6) Find the Sid of suppliers who supply some red or green part.
7) Find the Sid of suppliers who supply some red and some green parts.
OR
(b) Explain union, difference and intersection operation in relational algebra 07 with your own suitable example
(a) Explain shadow paging as a technique for Database recovery. List the advantages and disadvantages of shadow paging.
(b) Differentiate between deferred update and immediate update with suitable example.
OR
(a) Differentiate between UNDO and REDO types of transaction recovery with suitable example.
(b) Explain optimistic methods of concurrency control with its advantages and disadvantages.
(a) Differentiate between parallel and distributed databases. List advantages and disadvantages of Parallel Databases.
(b) Explain in brief the cost components in query execution.
OR
(a) Explain heuristic rules for query optimization with your own suitable example.
(b) Explain features, advantages and disadvantages of OODBMS.
(a) Explain the problem called Dirty read of Concurrency control with suitable example.
(b) (i) Write a short note on permutable actions.
(ii) Explain 2PL.
OR
(a) (i) Explain the concept of deadlock with example.
(ii) Discuss different ways for deadlock prevention and detection.
(b) (i) Explain the concept of timestamp with its properties.
(ii) Explain the concept of granule timestamps.
(iii) Differentiate between authorization and authentication.
*************
|
Attachment: |
| Earning: Approval pending. |
