PART B

1. Explain the system structure of a database system with neat block diagram. (R) (DEC 2007),
(MAY 2010) (MAY 2012)

2. What is a data model? Explain various data model for describing the design of a database at the
logical level. (U) (APRIL 2008), (MAY 2010)

3. Explain the different between physical and logical data independence with an example. (U)(APRIL 2008)

4. Explain the characteristics of database approach. (U)(APRIL 2008)

5. Describe the three-schema architecture. Why do we need mapping between schema Levels? How
do different schema definition languages support this architecture? (R) (DEC 2008)
6. What is the notation used in E-R diagram? Explain the E-R model structure
with Example.(U)(NOV 2014)
7. Explain the role and functions of the database administrator. (R)

8. Explain the following (R) (APRIL 2008) (NOV 2014)

i. Data Definition Language.

ii. Data Manipulation Language.

iii. Data control Language.

iv. Views

10 .Develop an Entity Relationship model for a library management system. Clearly State the
problem Definition, Description, Business Rule and any assumption you make. (AP)
(MAY 2009) (NOV 2014)

10.What is Embedded SQL? Give example(R)(NOV 2016)

11.State and explain the Architecture of DBMS.Draw the ER Diagram for banking Systems. (Home loan
applications)(Nov/Dec-2017)
12. Discuss about Tuple Relational Calculus and Domain Relational Calculus. (R) (DEC

2008) (MAY 2012)

13. What are aggregate functions? Explain five built-in aggregate functions. (U) (MAY 2008)
 14. Consider the following relations for a company database Application.(AP)(MAY 2009)

Employee (Eno, Name, Sex, DOB, Doj, Designation, Basic_Pay, Dept_No)

Department (DeptNo,Name)

Project (ProjNo, Name, Dept_No)

Works for (Eno,ProjNo,Date, Hours)

The attributes specified for each relation is self-explanatory. However the business rules are
stated as follows. A department can control a project. An employee can work on any
number of projects on a day. However an employee cannot work more than once on a
project he/she worked on that day. The primary key are underlined.
(i). Identify the forging keys, Develop DDL to implement the above schema.

(ii) Develop an SQL query to list the department number and

the number of Employee in each department.

(iii) Develop a View that will keep track of the department number, the number of
employees in the department, and the total basic pay expenditure for each
department.

(iv) Develop an SQL query to list the details of employees who have worked in more
than three projects on a day.

15. Explain how dangling tuple may arise and also explain problems that they Cause. (U)
(MAY 2008)
16. Briefly present a survey on Integrity and Security. (U) (MAY 2012)
17. Create an EMPLOYEE table and write the steps for various functions in an SQL Like
add, update, delete, save and join the various attributes of an EMPLOYEE Table.
(C)(MAY 2007)

18. Explain the use of trigger with your own example. (U) (MAY 2010)

19. What is a view? How can it be created? Explain with an example. (R) (MAY 2010)
20. Briefly present a survey on Integrity and Security. (U) (MAY 2012)
21. Consider a student registration database comprising of the given
below table schema.(AP)(Nov/Dec2015)
Student File

Student number Student name Address Telephone

Course File

Course Number Description Hours Professor Number

Professor File
Professor Number Name Office

Registration File

Student Number Course Number Date

Consider a suitable example of tuples/records for the above mentioned tables and
write DML statements (SQL) to answer for the queries listed below:

a. Which courses does a specific professor

teach? (ii)What courses are taught by two
specific professors?
(iii) What teaches a specific course and where is his/her office?
(iv) For a specific student number, in which courses is the student registered and what is
his/her name?

(v) Who are he professors for a specific student?

(vi) Who are he students registered in a specific course?

22. Let relations r1(A,B,C)and r2(C,D,E) have the following properties r1 has 20000
tuples r2 has 45000 tupes ,25 tuples of r1, fit on one block and 30 tuples of r2 fit on one block
.Estimate the number of block transfers and seeks required,using each of the following join
strategies for r1∞r2:
a. Nested loop join
b. Block Nested loop join

c. Merge join

d. Hash join (AP) (NOV 2016)

23. Consider the relation schema given in fig1.Design and draw an ER diagram
that capture the information of this schema.(5)(Apr/May-2017)
Employee(empno,name,office,age)
Books(isbn,title,authors,publisher)
Loan (empno, isbn,date)
Write the following queries in relational algebra and SQL.

a. Find the names of employees who have borrowed a book published by McGraw-
 PAR Explain the E-R model structure with
T
1. What is the
notation used in (U)(NOV 2014)
E-R diagram? 2. Develop an Entity Relationship model for a library management system. Clearly
State the problem
Definition, Description, Business Rule and any assumption you make. (AP)
(MAY 2009) (NOV 2014)
3. Develop an Entity Relationship model preparation staff (chef) and
finalize the customer‗s bill. The Food preparation staffs (Chefs), with their
touch-display interfaces to the system, are able to view orders sent to the kitchen
by waiters. During preparation, they are able to let the waiter know the status of
each item, and can send notifications when items are completed. The system
should have full accountability and logging facilities, and should support
Supervisor actions to account for exceptional circumstances, such as a meal
being refunded or walked out on. (AP) (Dec2015)
4. Distinguish between lossless-join decomposition and dependency preserving
decomposition(7)
5. State and explain the architecture of DBMS.Draw the ER diagram for banking
systems.(Home loan Application)(13)(Nov/Dec-2017)
 PART – B

1. Why is Recovery needed? Discuss any two Recovery Techniques.(U)

(MAY2009) (MAY
2012)
2. Write a relevant example discuss two phase Looking. (U)(MAY 2009)

3. What is Deadlock? List and discuss the four conditions for Deadlock. (R)

(MAY 2009)(MAY 2012) (NOV 2014) (NOV2016)

4. Give an example of a Scenario where two Phase Locking leads

to Deadlock.(AN)(MAY 2009)

5. Explain testing for serializability with respect to concurrency control

schemes. How will you determine, whether a schedule is serializble or
not. (U)(MAY 2008)

6. Explain the following protocols for concurrency control :(R)(MAY 2008)

a. Look based protocols.
b. Time stamp based protocols.

7. Describe the three most common concurrent transaction execution

problems.(R)(MAY 2007)
8. Explain how concurrency control can be used to avoid such problems?(U)
(MAY 2007)(NOV 2014)

9. Write a note on the following :

 a. Two-phase locking protocol (2PL).(U)(NOV 2016)
b. Lock based protocol.(U)
10. Explain the deferred and immediate-modification version of the log based
Recovery scheme.
(U)(MAY 2007)
11. Write short notes on shadow paging.(R)( DEC 2007)
12. Describe about the testing of serializability. (U)( DEC 2007) (MAY 2012)
13. What is concurrency control? How is it implemented in DBMS? Explain. (R)(DEC
2007)
14. Explain various recovery techniques during transaction in detail. (R)(MAY 2007)
15. Explain the two-phase commit and three-phase commit protocols.(R)(Dec2015)
16. Consider the following schedules. The actions are listed in the
order they are scheduled, and prefixed with the transaction name.
(AN) (Dec2015)
S1:T1:R(X),T2:R(X),T1:W(Y),T2:W(Y),T1:R(Y),T2:R(Y)
S2:T3:W(X),T1:R(X),T1:W(Y),T2:R(Z),T2:W(Z),T3:R(Z)
For each of the schedule, answer the following questions:
(i) what is the precedence graph for the schedule?(2)
(ii) is the schedule conflict –serializable?if so,what are all the conflict
equivalent serial schedules?(7) (iii)is the schedule view-serializable?if so,
what are all the view equivalent serial schedules?(7)

17. Consider the

following
two
transactions:
T1:read(A)
Read(B);
I
f

A
=
0

t
h
e
n
B
:
=
B
+
1
;

W
r
i
t
e
(
B
)
.
T2:read(B);
Read (A);
If B=0 then A:=A+1;
Write (A).
Add lock and unlock instruction to transactions T1 and T2,so that they
observe the two phase locking protocol. Can the execution of these
transactions result in a deadlock?(AP)
(NOV 2016)
 PART B

1. Explain the security features provided in commercial query languages.(U) (MAY

2007)

2. What are the steps involved in query processing? How would you estimate
the cost of the query? (U) (MAY 2007)

3. Explain the different properties of indexes in detail.(U)

4. Explain various hashing techniques.(R)
5. Explain the four important properties of transaction that a DBMS
must ensure to maintain database.(U)(MAY 2007)
6. What is RAID? List the different level in RAID technology and explain its
Features.(R)(MAY 2007), (MAY 2010) (NOV 2014)(NOV 2016)

7. What is concurrency control? How is it implemented in DBMS?

Explain.(U)(MAY 2007)

8. Explain various recovery techniques during transaction in detail.(U) (MAY 2007)

9. Eplain how the RAID systems improve performance and reliability. (U)(DEC
2007)

10. Describe the structure of B+ tree and list the characteristics of a B+tree.(U)

(DEC 2008), (MAY 2012) (MAY 2010)

(NOV 2014)

11. Explain the steps involved in processing a query.(R)(DEC 2008)

12. Describe static hashing and dynamic hashing.(U)(DEC 2008). (NOV
2014)

13. Describe in detail about how records are

represented in a file and how to organize them
in a file. (AP)(MAY 2012).

14. Explain about spatial and mobile database (U)(NOV 2014)(NOV

2016)

15. With suitable digrams,discuss about

the Raid Levels(Level0,Level1,Level
0+1,level3,Level and Level5).(U)
(Dec2015)

16. Explain the Architectural

components of a data ware
house and write bout data marts.
(R)(Dec2015)

17. Explain the architecture distributed database system (U)(Nov 2016)

18.Describe the benefits and drawbacks

of a source driven architecture for
gathering of data datawarehouse , as
compared to a destination driven
architecture (U)(NOV 2016)

PART B

1. Explain in detail Data Classification in DBMS.(R)

2. Discuss in detail Access Control mechanism. (NOV 2014) (U)

3. Explain about Distributed Databases. (NOV 2014) (U)

4. Discuss about Data warehousing and Data Mining. (U)

5. Explain in detail Information retrieval and Relevance Ranking. (U)

6. Describe about OODBMS and XML Database. (R)

7. Explain in detail Threats and risks in Database Management System.

(R)

8. Neatly write the K-means algorithm and

show the intermediate results in clustering the
below given points into two clusters using K-
means algorithm. P10,0),P21,10),P3:
(2,20),P4:(1,15),P5:(1000,2000),P6:
(1500,1500),P7:(1 000,1250). (U) (Dec2015)

9. Discuss About The Access Control

Mechanisms And Cryptography
Methods To Secure the Databases.
(Dec2015) (U)

10. What is Association rule mining?(R)(NOV 2016)

11.Suppose that you have been hired as a

consultant to choose a database system for your
client‗s application .For each of the following
applications, state what type of database system
(relational,persistent programming language based
OODB,object relational;do not specify a
commercial product)you whould
recommend.Justify your recommendation

i) A computer aided design system for manufacturer of

airplanes

ii)A system to track contributions made to candiates for public

office.

iii)an information system to support the making of movies.

(AN)(Nov 2016)

12.Trace the results of using the Apriori algorithm on

grocery store example to support threshold s=33.34%
and confidence threshold c=60%.Show the candidate
and frequent itemsets foreach database
scan.Enumerate all the final frequent itemsets.Also
indicate the association rules that are generated and
highlight the strong ones,sort them by confidence.

Transaction Id Items

T1 HotDogs,Buns,Ketchup

T2 HotDogs,Buns

T3 HotDogs,Coke,Chips

T4 Chips,Coke

T5 Chips,Ketchup

T6 HotDogs,Coke,Chips