Database Management System | Nagpur university | Summer-19

akt-sum-19


B.E. (Information Technology) Sixth Semester (C.B.S.)

Database Management Systems


NRT/KS/19/3497
Time : Three Hours
Max. Marks : 80
_____________________________________________________________________
Notes : 1. All questions carry marks as indicated.
2. Solve Question 1 OR Questions No. 2.
3. Solve Question 3 OR Questions No. 4.
4. Solve Question 5 OR Questions No. 6.
5. Solve Question 7 OR Questions No. 8.
6. Solve Question 9 OR Questions No. 10.
7. Solve Question 11 OR Questions No. 12.
8. Assume suitable data whenever necessary.
9. Illustrate your answers whenever necessary with the help of neat sketches.


1. a) What do you mean by data abstraction? Explain three levels of data abstraction and also three level architecture of database system with reference to above levels.  [07 M]

b) Explain four relational algebra operation in detail with example. .  [06 M]

OR

2. a) Let R = (A, B, C) and let r1 and r2 both be relations on schema R give an expression in domain relational calculus that is equivalent to.  [06 M]

i) πA (r1)
ii) σB=17(r1)
iii) r1 ∪ r2
iv) r1-r2

b) Differentiate between file processing system and DBMS.  .  [07 M]


3. a) List various file organization methods & explain different ways of organizing records in a file. .  [07 M]

b) Differentiate between the following  .  [06 M]
i) B and B+ tree
ii) Sparse index and Dense index

OR

4. a) Construct B+ tree for the following set of key values – (2, 3, 5, 7, 11, 17, 19, 23, 29, 31). Assume that the tree is initially empty and the number of pointers that will fit in one mode is        .  [08 M]
i) n = 4
ii) n = 6
iii) n = 8

b) What are bitmap indices? What is its use? Explain with example.  .  [05 M]

5. a) What are strong entities and weak entities? Draw an ER diagram illustrating the use of strong entity, weak entity, composite attribute, multivalued attribute and derived attributes.  .  [08 M]

b) Explain E. F. Codd’s relational database rules.  .  [06 M]

OR


6. a) Consider the relation schema R(A, B, C, D, E) and set F of functional dependency   
F = {AB → CE,
         E  → AB,
          C → D}
What is the highest normal form of this relation? Explain.
Also find its prime, non prime attributes along with several candidate keys.  [07 M]

b) What is data dictionary? Explain its use with example.  [03 M]

c) Explain BCNF with example.  [04 M]


7. a) What are different equivalence rules present in transformation of relational expression?  [06 M]

b) What are materialized views? Explain in details.  [07 M]

OR

8. a) What is query processing? Explain each steps involved in query processing with proper diagram.  [07 M]

b) How an expression can be evaluated with help of materialization and pipeline approach. Explain in detail.  [06 M]


9. a) Explain transaction with neat sketch diagram. Explain ACID properties in brief.  [07 M]

b) What is serializability? Discuss various types of serializability.  [07 M]

OR

10. a) What are deadlocks? How is deadlock detection and prevention achieved in DBMS.  [07 M]

b) Explain different concurrency problems and give solutions for it. [06 M]


11. a) Explain various types of JOIN expressions with example.  [07 M]

b) What is nested sub query? Explain with the help of example.  [07 M]

OR

12. a) Consider the relation customer (Id, name, age, address, salary). Write a PL/SQL function that will return total number of customers in customer table.  [04 M]

b) Enlist and explain with example, various DDL commands.  [06 M]

c) Explain dynamic SQL and embedded SQL.  [04 M]


 

Scroll to Top
error: Alert: Content is protected !!