2016 IT601 DBMS Old

GOVERNMENT COLLEGE OF ENGINEERING & CERAMIC TECHNOLOGY
AN AUTONOMOUS INSTITUTE
AFFILIATED TO MAKAUT (FORMELY KNOWN AS WBUT)
Theory / B. Tech / IT / SEM - VI / Code – IT 601 / 2015-16
Paper Name: Database Management System (Old Syllabus)
Full Marks: 75 Time Allotted: 3 hours
The figures in the margin indicate full marks. Candidates are required to give their answers in their own words as far as practicable.
GROUP – A
[MCQ Type Questions][Compulsory]
1. Choose the correct alternative of the following questions. Answer all questions. 10 x 1 = 10
i) Deferred database modification technique uses

(A) Both undo and redo (B) Undo but no redo
(C) Redo but no undo (D) Neither undo nor redo
ii) Cartesian product in relational algebra is
(A) a Unary operator (B) a Binary operator.
(C) a Ternary operator (D) not defined.
iii) Which of the following is not a property of transactions?
(A) Atomicity (B) Concurrency
(C) Isolation (D) Durability
iv) Relational Algebra does not have
(A) Selection operator (B) Projection operator
(C) Aggregation operators (D) Division operator
v) ‘AS’ clause is used in SQL for
(A) Selection operation (B) Rename operation.
(C) Join operation (D) Projection operation.
vi) Precedence graphs help to find a
(A) Serializable schedule (B) Recoverable schedule
(C) Deadlock free schedule (D) Cascade less schedule
vii) The clause alter table in SQL can be used to
(A) add an attribute (B) delete an attribute
(C) alter the default values of an attribute (D) all of the above
viii) In B-tree the number of keys in each node is ____ than the number of its children.
(A) one less (B) same
(C) one more (D) half
ix) It is an abstraction through which relationships are treated as higher level entities
(A) Generalization (B) Specialization
(C) Aggregation (D) Inheritance
x) In case of entity integrity, the primary key may be
(A) not Null (B) Null
(C) both Null & not Null (D) any value
GROUP – B
[Short Answer Type Questions]
Answer any four of the following
Answer any four of the following
4 x 5 = 20
2. a) Define primary Key.
b) Describe how BCNF differs from 3NF? 2+3
3. a) Differentiate between Strong entity set and weak entity set.
b) What is the difference between conflict equivalence and view equivalence? 2+3
4. Explain two phase locking protocol. 5
5. a) Compare Database Management System and File Management System.
b) Explain Aggregation. 3+2
6. Explain the following terms with examples
i) Natural Join ii) Aggregate functions 2.5 + 2.5
7. a) “Primary Key is one type of integrity constraint” – Explain.
b) Write all possible sequences of states of Transactions (using diagram). 2+3
Group – C
[Long Answer Type Questions]
Answer any three of the following
3 x
15 = 45
8. a) Draw the E-R diagram for a Hospital Management System.
b) Consider the following relations with primary keys underlined.
Salesperson (SNo, Sname, Designation)
Area (ANo, Aname, ManagerNo)
Product (PNo, Pname, Cost)
SAP (SNo, ANo, PNo)
(I) Define the schema in SQL specify the attributes, and keys assuming that ManagerNo is a
foreign key.Specify the constraint that the cost of a product cannot be greater than Rs.10000/-.
(II) Answer using SQL
(i) Get the names of all the products that are sold.
(ii) Get the product numbers which are marketed by at least two sales persons.
(iii) Get the names of all salespersons who are not Managers. 7 + (2+6)
9. a) Given below are two sets of FDs for a relation R (A, B, C, D, E). Are they equivalent?
i) A → B, AB → C, D → AC, D → E
ii) A → BC, D → AE
b) Define the following operations of relational algebra and give an example each
(i) Rename (ii) Natural Join
c) What is functional dependency?
d) Suppose we are given relation R with attributes A, B, C, D, E, F, and the FDs,
A → BC, E → CF, B → E ,CD → EF
Compute the closure {A,C}+ under this set of FDs. 6 + (2 + 2) + 2 + 3
10. a) Explain in detail about implementation of Atomicity and Isolation.

b) Give the algorithm to construct a wait-for-graph from a given schedule of transactions?
How can deadlock be detected from wait-for-graph?
c) Explain any one Log-based recovery scheme. 6 + (3 + 2) + 4
11. a) Describe the different deadlock prevention schemes.

b) What is lost update problem?
b) What is lost update problem?
c) Consider three transactions : T1, T2 and T3. Draw the precedence graph for the
following schedule consisting of these three transactions and determine whether it is
serializable. If so, give its serial order(s). 6+3+6
Time T1 T2 T3
t1 : read(Y)
t2 : read(Z)
t3 : read(X)
t4 : write(X)
t5 : write(Y)
t6 : write(Z)
t7 : read(Z)
t8 : read(Y)
t9 : write(Y)
t10 : read(Y)
t11 : write(Y)
t12 : read(X)
t13 : write(X)
12. a) Insert the keys below in the order stated into an initially empty B-tree of order 3.
Show all intermediate steps
1, 7, 6, 2, 11, 4, 8, 13, 10, 5, 19, 12, 18
b) Describe different modes of locks and Lock conversion.

c) Explain Shadow paging with examples. 7+4+4
13. a) Explain Referential Integrity.

b) Discuss the “updation anomalies’’ and “deletion anomalies” with respect to normal forms
with suitable example and suggest a method to overcome them.
c) Given the following relations:
Vehicle (reg_no, make, colour)
Person (eno, name, address)
Owner (eno, reg_no)
Write expressions in relational algebra to answer the following queries:
(i) List the names of persons who do not own any car.
(ii) List the names of
---------------------------------X-------------------------------------X---------------------------------------------------
IT 601 DBMS(Old) IT SEM VI AGE 3 OF 3
P

2016 IT601 DBMS Old

Uploaded by

Copyright:

Available Formats

2016 IT601 DBMS Old

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

2016 IT601 DBMS Old

Uploaded by

Copyright:

Available Formats

GOVERNMENT COLLEGE OF ENGINEERING & CERAMIC TECHNOLOGY

i) Deferred database modification technique uses

10. a) Explain in detail about implementation of Atomicity and Isolation.

11. a) Describe the different deadlock prevention schemes.

b) Describe different modes of locks and Lock conversion.

13. a) Explain Referential Integrity.

You might also like