DATA BASE MANAGEMENT SYSTEMS Oct-Nov 2019
DATA BASE MANAGEMENT SYSTEMS Oct-Nov 2019
DATA BASE MANAGEMENT SYSTEMS Oct-Nov 2019
4. a) Explain the basic structure of SQL query and write the queries to illustrate union [7M]
and intersect operations.
b) Discuss about Triggers and active Database in SQL with examples. Write the [7M]
differences between constraints and triggers in SQL.
5. a) Explain the concepts of Functional dependency with suitable example and its [7M]
operations like closure and minimal cover.
b) Describe an algorithm for computing the minimal cover of a set of Functional [7M]
Dependency and illustrate its application in 3NF with an example.
6. a) Define the concept of schedule for a set of concurrent transaction. Give a suitable [7M]
example.
b) Explain read-only, write-only & read-before-write protocols in serializability. [7M]
|''|''|||''|'''|||'|
Code No: R1631054 R16 SET - 4
III B. Tech I Semester Regular/Supplementary Examinations, October/November - 2019
DATA BASE MANAGEMENT SYSTEMS
(Common to Computer Science and Engineering, Information Technology)
Time: 3 hours Max. Marks: 70
Note: 1. Question Paper consists of two parts (Part-A and Part-B)
2. Answer ALL the question in Part-A
3. Answer any FOUR Questions from Part-B
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
PART –A (14 Marks)
1. a) Write a short note on relational databases with example. [2M]
b) Discuss the importance of relational calculus. Give some examples. [2M]
c) Write the structure of triggers. [3M]
d) Explain the role of normalization. [2M]
e) Write short note on commit, rollback and save point. [3M]
f) Differentiate primary and secondary indexes. [2M]
PART –B (56 Marks)
2. a) What is the importance of data independence? Explain with suitable examples. [7M]
b) Explain different managers in DBMS model and their functionalities. [7M]
3. a) How to print Date and Time? Write queries to perform Numeric, String conversion. [7M]
Write some tuple relational calculus queries.
b) Construct an ER diagram for Car Insurance company Database. Identify entities, [7M]
attributes for each entity, relationship among entities. Represent necessary
constraints in this database design process in detail.
4. a) How to specify the conditions in SQL? Explain various operators used in it. [7M]
b) Describe the usage of null values? Compare various SQL operations with and with- [7M]
out null values.
5. a) Explain BCNF. How does BCNF differ from 3NF? Explain with an example. [7M]
b) Consider the relation R(A,B,C,D,E,F) and the FDs ABC→DE, ABC→D, [7M]
DE→ABCE, E→C. Decompose the relation by considering the given set of FDs
into BCNF relation. Is the decomposition lossless and dependency preserving?
7. a) Construct a B+−tree for set of key values: (2, 3, 5, 7, 11, 17, 19, 23, 29, 31). [7M]
Assume that the tree is initially empty and values are added in ascending order.
Construct B+tree for the cases where the number of pointers that will fit in one
node is 4, 6 and 8.
b) Perform insertion and deletion operations directory of buckets in extendible [7M]
hashing with an example.
*****
|''|''|||''|'''|||'|