Gujarat Technological University MCA 2nd Sem-Database Management System-II previous y

Will you please give me the Gujarat Technological University MCA 2nd Sem-Database Management System-II previous years question papers?

As you want to get the Gujarat Technological University MCA 2nd Sem-Database Management System-II previous years question papers so here is the information of the same for you:

Some content of the file has been given here:

Q.1 (a) Define transaction. Explain Atomicity and Durability property of
transaction giving an example and show implementation of this property
using shadow paging method.
07
(b) Discuss why there is a need of Query Processing and Query optimization
for processing SQL. Also write down steps for Query processing.
07
Q.2 (a) Discuss why there is a need for database security. Differentiate between
Discretionary Access Control and Mandatory Access Control method.
07
(b) Define Deadlock. Discuss deadlock prevention and detection method. 07
OR
(b) Discuss concept of Timestamp, Timestamp Ordering Protocol and Thomas
Write Rule for concurrency control method.
07
Q.3 (a) Discuss why there is a need for recovery in transaction. List out various
recovery methods and explain in detail Log based recovery method.
07
(b) Define Lock. Show lock compatibility matrix and explain Two Phase
Locking protocol
07
OR
Q.3 (a) Explain Concurrency control method showing serial and concurrent
transaction. Discuss the concept of conflict serializability.
07
(b) What is transaction log? Discuss the concept of checkpoint showing
transaction log.
07
Q.4 (a) Discuss various cost components of Query optimization and explain cost
function for Select.
07
(b) Explain in brief the concept of Object Oriented databases. 07
OR
Q.4 (a) Explain in brief the concept of Distributed Databases. 07
(b) Discuss concept of Heuristic query optimization by drawing query tree. 07
Q.5 (a) Explain in brief Query Decomposition method in query processing
technique.
07
(b) Describe briefly Relational Algebra. Explain various Relational algebra
operators giving example.
07
OR
Q.5 (a) Discuss various transformation rules for query optimization and show how
these rules can be implemented in query optimization technique.
07
2
(b) Write down Relational Algebra for the given schema.
SOFTWARE(sid,software_name,develop_in,selling_cost ,
development_cost)
PROGRAMMER(pid, pname, date_join, dept_name, sid,
Salary, gender)
i. Find out the selling cost average for packages developed in
Oracle.
ii. List details of programmer whose salary is greater than Rs.
10,000.
iii. Display details of Software develop by “Mr. Ram”.
iv. How many software has highest development cost.
v. List details of programmer who join in the current month.
vi. Retrieve name of programmer who do not involve in any
software development.
vii. Retrieve all male programmers working in ‘MCA’ department.



Q.1 (a) (i) Explain the properties of transaction with example.
(ii) Draw and explain state transition diagram for transaction execution.
07
(b) Explain grant and revoke privileges with example for discretionary access
control.
07
Q.2 (a) State whether the following statements are true or false. Justify. No
Justification, no marks.
(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.
07
(b) Consider the following relations:
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.
07
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
with your own suitable example
07
2
Q.3 (a) Explain shadow paging as a technique for Database recovery. List the
advantages and disadvantages of shadow paging.
07
(b) Differentiate between deferred update and immediate update with suitable
example.
07
OR
Q.3 (a) Differentiate between UNDO and REDO types of transaction recovery with
suitable example.
07
(b) Explain optimistic methods of concurrency control with its advantages and
disadvantages.
07
Q.4 (a) Differentiate between parallel and distributed databases. List advantages and
disadvantages of Parallel Databases.
07
(b) Explain in brief the cost components in query execution. 07
OR
Q.4 (a) Explain heuristic rules for query optimization with your own suitable
example.
07
(b) Explain features, advantages and disadvantages of OODBMS. 07
Q.5 (a) Explain the problem called ‘Dirty read’ of Concurrency control with suitable
example.
07
(b) (i) Write a short note on permutable actions.
(ii) Explain 2PL.
07
OR
Q.5 (a) (i) Explain the concept of deadlock with example.
(ii) Discuss different ways for deadlock prevention and detection.
07
(b) (i) Explain the concept of timestamp with its properties.
(ii) Explain the concept of granule timestamps.
(iii) Differentiate between authorization and authentication.
07



Contact Details:
Gujarat Technological University
Sabarmati,
Koba Highway,
Near VISAT Three Road,
Nr. Vishwakarma Government Engineering College,
Chandkheda,
Ahmedabad,
Gujarat 382424 ‎
079 2630 0499
India

Map Location: