SPPU Information Technology (Semester 5)
Database Management Systems
December 2016
Total marks: --
Total time: --
INSTRUCTIONS
(1) Assume appropriate data and state your reasons
(2) Marks are given to the right of every question
(3) Draw neat diagrams wherever necessary


Solve any one question.Q1(a,b,c) &Q2(a,b)
1(a) Compare DBMS and file processing system with following points.
1) Redundancy
2) Access Control
3) Data Integrity.
3 M
1(b) Consider the following relations:
BRANCH(bno,
street,
area,
city,
pcode,
telno) STAFF(Sno,
Frame,
Lname,
address,
position,
salary,
bno) Express the following queries in SQL:
1) List the staff who work inthe branch at 'Main Street'
2) Find staff whose salary is large than the salary of every member of staff of branch 'S1'
3 M
1(c) For given functional dependenciesF,find primary key?
A⇒BCD
AE⇒F,
E⇒G.
D⇒H,
FE⇒I.
4 M

2(a) Following information is maintained for online bookstore.
i) books(JSBN,
title,
price,
year)
ii) author (name,
address,
URL)
iii) Publisher(name,
address,
phone,
URL) iv) customer (name,
address,
email,
phone) (name is discriminating atribute)
v) Shopping basket(basketID) Construct an ER diagram with following constraint Each book shoud have an author and a publisher. Book may have more than one author. Each Customer have a dedicated shopping basket. Books can further be catagorized as books,music cassette, or compact disks.
6 M
2(b) Write an algoritham to find cycle in a precedence graph.
4 M

Solve any one question.Q3(a,b) &Q4(a,b)
3(a) List down all the possible crash recovery methods? Explain any one with proper example?
5 M
3(b) Consider the following relations.PLAYER(PID#,Name) MATCH (MID#,
PID#,
Match_date,
opponent)
i) Write simple inner join query using SQL to display information about the player and match played by the player.
ii) Show intermidate steps of inner join with proper example(assume suitable data)
5 M

4(a) Discuss the MongoDB aggregation framework with suitable example?
6 M
4(b) What do you mean by cascadeless shedule? Explain with suitable example
4 M

Solve any one question.Q5(a,b,c) &Q6(a,b)
5(a) For each of the three partitioning techniques, namely round rubin, hash, range partitioning given an example of a query for which that partitioning wolud provide the faster response.
6 M
5(b) Compare
i) Speedup and scaleup
ii) Horizontal and Vertical Fragmentation.
6 M
5(c) Why it is necessary to have a client sever architecture for database management system.
6 M

6(a) Write short note on (any two):
i) Transaction Server Process Sturcture
ii) Data frangmentation in distributed databases..
iii) interoperation parallelism
12 M
6(b) Discuss the relative advantages of centralized and distributed databases.
6 M

Solve any one question.Q7(a,b,c) &Q8(a,b,c)
7(a) Give the DTD for an XML representation of the following nested relational schema
Emp=(ename,
Childeren Set setof(Children),
SkillSet Setof(Skills))
Children=(name,
Birthday)
Birthday=(day,
Month,
Year) Skills=(type,
Examset set of,
(Exams))
Exam=(year,
city) Use the DTD and write the following queries in Xqueries format. Find the names of all employees who have a child who has a birthsay in "March".
7 M
7(b) Discuss the with examples JSON data types.
4 M
7(c) What is HDFS? Role of it in Hadoop system?
5 M

8(a) What is XML Schema? Advantages of XML Schema over DTD? Give simple example of XML Schema?
7 M
8(b) What is Hbase? Discuss various Hbase Data Model and applications.
5 M
8(c) Compare JSON and XML with example.
4 M

Solve any one question.Q9(a,b) &Q10(a,b)
9(a) What is OLTP and OLAP? How datawarehouse is prepared to support OLAP system?
8 M
9(b) Explain knowledge discovery process in detail.
8 M

10(a) Write short note on:
i) Hadoop MaReduce br> Schemas Dataware house
8 M
Solve any one question.Q2(a,b) &Q2(a,b)
10(b) Why there is need for Mobile database? Draw and explain the architecture of moblie database.
8 M



More question papers from Database Management Systems
SPONSORED ADVERTISEMENTS