Roll No.

DEPARTMENT OF INFORMATIONSCIENCE AND TECHNOLOGY, ANNA UNIVERSITY. CHEAMA,

INTERNAL ASSESSMENT TEST I

IIl Semester - B.TECH. INFORMATION TECHNOLOGY (R2019)

AUGUST - NOVEMBER 2022
IT 5351 Database Management Systems
Course Instructors: Dr. S.Swamynathan and Ms.B.Siva shankari

Time: 90 minutes Max. Marks: 50

13-10-2022

CO 1
lo learn the fundamentals of data models, conceptualize and depict a database system
using ER diagram.
CO 2 lo study the principles to be followed to create an effective relational database and
write
SQL queries to store/retrieve data tolfrom database systems.
CO3 To know the fundamental concepts of transaction processing, concurrency control
techniques and recovery procedure.
CO 4 To learn about the internal storage
structures using different file and indexing techniques and
the basics of query processingand optimization.
CO 5 To study the basics of
distributed databases, semi-structured and un-structured data
models.

BL - Bloom's Taxonomy Levels

(L1 - Remembering. L2 -
Understanding, L3 - Applying, L4 - Analysing, L5 -Evaluating, L6 - Creating)
Answer all the questions
Q. No Part A(7X2 =14)
Marks CO BL
List the advantages of using DBMS over file
system. 2 L2
What does theterns "physical and Logical Data
refers to in RDBMS?
Independence
L2
3 Çonsider a relational schema DEVELOPER (|D, Nane.
DatcOfloining. ContactDetails. ProjectlD. LanguageSkills).
ldentify Simple. Composite. Single valued. Muli valued and
Derived attributes firom the schema. L3
 What is referential integrity? Mention its impact in weak entity. 2 2 L2
Convert the following ER diagram into relational tables.
at 82
b2

2 2 L3
B

6
Let R=(P,Q,R,S,T,U) be arelation
schema with the
dependencies R-> U, T>P. TR > Sand P->Q.Find the key
for
R
2 2 L4
What are Armstrong axioms? List the
inference rules associated
with it.
2 L2
Part B (2 X 12 =24)
8 (A) (i) Acustomer wants a
database application to be
medium scale industry requirement. Suggest a developed for a
and back-end possible front-end
technologies open source and proprietary
for
environment.
(ii) Consider the 2 L1
following tables in Film Database:
ARTIST (Art id, Art Name, Art Gender)
PRODUCER (Prod id, Prod Name, Prod Phone)
FILMS (Film id, Film Title, Film Year,
Film Lang, Prod id)
CASTING (Art id, Film id, Part)
REVIEW (Film id, Stars)
WriteSQL statement for the
following.
Create the CASTING table without a key. (1)
Modify the structure of the CASTING table and
add a key
constraint with a constraint name CAST PK. (2)
10 2 L3
List all the female artist whose
name starts with R". (2)
Find the names of all the Films
whose producer is "KAMAL". (2)
Display all artists who acted in a film between
2000 and 2020.(3)
OR
(B) (i) Describe the three level schema
architecture of RDBMS and
highlight the significance of cach schema. 2 LI

(i) For the Films Database, write SQL queries for the
following.
 Insert a record in the Films table. (1)
10 2 L3
Check if the film ycar is within 1960-2022 during insertion. (2)
" Display the maximum and minimum review star rating. (2)
Find all artist name who played comedy part. (2)
Update the stars of all films whose producer is KAMAL' to 5.(3)
9 (A) Consider a relational table STUDENT RESULT as follows.
Pre Marks Grade
RollNo SName DoB Course Course
No Name Requisite

The FDs associated with the table are RollNo CourseNo ->
Marks, {RollNo , CourseNo}-> Grade, Marks -> Grade, RollNo
-> {StudentName, DoB}, CourseNo -> {CourseName, Pre 2 L4
12
Requisite}
Normalize the relational Table to satisfy the 3 NF.
OR

A Relational table has attributes A1, A2, A3, A4, and AS, with the
B)
following functional dependencies:
12 2 L4
Al->A3, A2->A4,(A1,A2)->A5.
In terms of nggmalization, state whether this table is in INF NEot

Part C (1X 12 = 12)

10 Consider a Bank Management System. A Bank has various
branches across the country. Every Bank has a Name, code and
address of the main office. Branches are identified by a Branch
number, name and address. A customer can have one or more
accounts in a branch. Every Customer is identified by the ID, phone
number and address. Every Account has a number,
account type and 12 1,2 L3,
balance. Every Customer can avail loans. Every Loan is
identified L4
by LoanlD, Loan type (Personal,
Education, Vehicle) and amount.
Draw the ER diagram for the Bank
Management System. Realize
the relational tables and identify the
primary and foreign keys for
each table.
 Roll No.
ANNA UNIVERSITY (UNIVERSITY DEPARTMENTS)
DEPARTMENT OF INFORMATION SCIENCE AND TECHNOLOGY
B.Tech |T INTERNAL ASSESSMENT TEST II
III Semester
IT5351 & Database Management Systems
(Regulation 2019)
COURSE INSTRUCTORS: Dr.S.Sawmynathan &Ms.B.Siva Shankari
Date: 07.12.2022
Time: 90 Minutes Max.Marks: 50
CO1 Model an application's data requirements using conceptual modeling and design
database schemas based on the conceptual model.
CO 2 Formulate solutions to a broad range of query problems using relational
algebralSQL.
CO3 Demonstrate an understanding of normalization theory and apply such knowledge to
the normalization of a database.
CO 4 Run transactions and estimate the procedures for controlling the consequences of
concurrent data access.
CO 5 Explain basic database storage structures, access techniques and query processing.
CO6 Describe distributed, semi-structured and unstructured database systems.
BL Bloom's Taxonomy Levels
(L1-Remembering, L2- Understanding. L3 -Applying. L4 -Analysing, L5- Evaluating. LÕ -Creating)
PART- A (7 x 2 = 14 Marks)
(Answer all Questions)
Questions Marks CO BL
Q. No
1 Describe the transaction states in a DBMS 2 C04 L2

2 Describe the different possible lock granularities in DBMS 2 C04 L2

and comment about itsimplication.
3 Consider the following transaction involving two bank
accounts x and y.
read(x); x:-x-50; write(x); read(y): y:=y+ 50; write(y)
The constraint that the sum of the accounts x and v should
remain constant is that of Atomicity / Consistency /Isolation / 2 C04 L3
Durability. Justify.
4 Consider the directed graph associated with a transaction
dependency as given below. State whether the schedule is
conflict serializable? If so, summarize the order of the
execution of the schedule. Justify.

2 CO4 L3

What are the deadlock prevention strategies used in DBMS?

2 C04 L2
Compare B-Tree with B+ Tree. 2 CO5 L2

7 Differentiate dense andsparse index with illustration. 2 COS L2

 PART- B (2 x 12= 24 Marks)
Marks CO BL
Q. No Questions transactions
the common concurrency problems in DBMS 6 CO4 L3
8 (a) (i) List out
and briefly describe each problem.
used in DBMS? List
Explain the lock based concurrency protocols 6 CO4 L2
(ii) based protocols
out the variations in lock OR
W1(A), W2(A), commit T2,
8 (b) () Consider aSchedule with R1(A), problem is associated with
commitT1. What kind of concurrency 6 CO4 L3
this schedule S?
concurrency control protocols used in
(ii) Explain Timestamp based 6 CO4 L2
DBMS.
crash recovery
9 (a) () Describe the working principles of ARIES CO4 L2
algorithm. and the schedules S1
(ii) Consider the transactions T1. T2. and T3
and S2 given below.
T1: r1(X):; r1(2); w1(X); w1(Z)
T2: r2(Y): r2(2); w2(Z)
T3: r3(Y); r3(X); w3(Y)
r1(Z), w1()X); w1(Z)
S1: r1(X); r3(Y); r3(X); r2(Y); r2(Z), w3(Y); w2(Z),
6 CO4 L4
Check if S1 is conflict-serializable.
OR
with
9 (b) () Discuss the deadlock avoidance strategies asSociated 6 CO4 L2
DBMS.
T3:
(1) Consider the following schedule for transactions T1,T2 and
TI T2
Read (X)
Read ( Y)
Read ( Y)
Wite (Y)
Write (X )
Write(X)
Read ( X )
Write (X )

Identify the correct sequence of transactions of the above 6 CO4 L4

schedule.

PART- C(1x12=12 Marks)

(Q.No.10 is compulsory)

Q. No Questions Marks CO BL
10. (0) Create B-Tree of order 5 from the following list of data items:

20, 30, 35, 85, 10, 55, 60, 25 6 CO5 L5

(Ö) Insert the key values 6, 16,26, 36, 46 onaB+ tree with order =3. 6 CO5 L5
 Roll No, 22 s|32
ANNAUNIVERSITY (UNIVERSITY DEPARTMENTS)
EXAMINATIONS, DEC 202
RE/B. Tech/ B. Arch (Full Time) : END SEMESTER
ROLLEROF INFORMATION TECHNOLOGY
Semester 3
AU
CHENNAI
IT5351 &Database Management Systems
6 00
02 5

(Regulation 2019)
Max. Marks: 100
Time: 3hrs

CO 1
KOIa
Model an application's data requirements using conceptual
schemas based on conceptual model.
modeling and design database
algebra/ SQL.
CO 2 Formulate solutionstoa broad range of query problems using relationalknowledge to the
CO 3 Demonstrate an understanding of normalization theory and apply such
normalization of a database.
CO 4 Run transactions and estimate the procedures for controlling the consequences of
concurrent data access.
CO 5 Explain basic database storage structures, access techniques, and query processing.
Describe distributed, semi-structured and unstructured database systems.
BL- Bloom's Taxonomy Levels
Creating)
(L1 -Remembering, L2-Understanding, L3- Applying, L4 - Analysing, L5 - Evaluating, L6 -

PART- A(10 x 2 = 20 Marks)

(Answer all Questions)
Marks CO BL
Q. No Questions
Describe the three level Architecture diagram ofa Database
2 L2
Management System and highlight the significance of each level. CO1

2 Consider a relational schema BUYER (ID, PRODUCT NAME,

QUANTITY, UNIT PRICE, TOTAL AMOUNT). List the various
aggregate functions and highlight its uses in the BUYER schema. 2 CO2 L3

What is Dependency Preservation? Justify its need in Relational

2 CO3 L2
Database Management System.
4 Consider a relation R with attributes (Candidate, Subject,
Instructor) and Functional Dependencies
{(Candidate, Instructor) -> Subject,
(Candidate, Subject) -> Instructor and
Instructor > Subject }. CO3 L4
2
Check if the above relation R satisfies BCNF.
5 Define ACID property in transaction management. Highlight the
significance of ACID property. CO4 L2
6 List the granularity of locks that can be applied on resources
which are involvedin an execution of the concurrent transactions. CO4 L2
7 Highlight the difference between dense and sparse index. 2 CO4 L2
8 Highlight the significance of RAID technology levels. 2 CO4 L2
What are the advantages of using Database Applications in a
Cloud based environment? Highlight any four features and justify. 2 CO5 L2
10 Highlight the significance of CAP theorem in Distributed Database
Environment. 2 CO5 L2
 PART- B(5 x13 = 65 Marks)
(Restrict to a maximum of 2 subdivisions)
Q. No Marks CO BL
Questlons
11 (a) () Consider the following relational schema: -
Customer (CID, CName, Address, City, PostalCode)
Suppliers (SID, SName, Address, City, PostalCode)
Write SQL queries for the following naturallanguage querles.
(1) List all customers from the "Customers" table, sorted
2
DESCENDING by the "City". 2
(2) List the number of customers in each city. CO2 L6
(3) List the Customer names and the city who are from the same
city in the order of city. 2
(4) LIst the cities (only distinct values) from both the "ustomers"
2
and the "Suppliers" table:
() Consider an employee schema as follows:
EMPLOYEE (EMP ID, NAME, AGE, ADDRESS, SALARY)
5 L6
Create a trigger to show the salary difference for every UPDATE CO2
operations performed on the EMPLOYEES table.
OR
11 (b) () Consider the following schema:
Agents (AGENT CODE, AGENT NAME, WORKING AREA)
Orders(ÖRD NUM, ORD AMOUNT, ORD_DATE,
CUST CODE, AGENT CODE)
Write SQL queries for the following:
(1) To display all the order amount in the range 50000 to 75000. CO2 L6
(2) Todisplay the distinct workingarea. 2
(3) List the order number, order amount, order date, customer
code and agent code from the table 'orders' where the working Co
ONAL bLLER
area of the aget is 'Bangalore'. 2 YNIW
(4) Todisplay all the agent names whose order amount is >8000. 2

(i)Consider the following relational schema:

NO

Employees (employee_ id, name, hire date, job_ id, salary)

Jobs (JOB ID, JOB TITLE, MIN SALARY, MAX SALARY)
Job history (Dept_ ID, Job_ ID)
Retrieve the unique job id and their average salary from the L6
CO2
employees table where unique job_ id have a salary smaller than 5
the maximum of averages of min salary of each unique job id
from the jobs table which job ids are in the list picking from the
job history table which is within the department id 50 and 100.
12(a) () Let R= A, B, C, D, E, F) be a relation scheme with the following
dependencies
C’F, E ’A, EC’D, A B
Findthe key for R. Also, determine the total number of
keys and super keys. candidate 7 CO3 L4
 () What are the possible
anomalies in relational modols? Explain its CO3 L2
impact in database dosign.
OR
12 (6) (0) Consider relation R (A, B, C, D) and functional dependency
(AB > C, C- D, D> A}, Relation Ris decomposed into
R1( A, B, C) and R2(C, D). Check whether decomposition is CO3 L4
dependency preserving or not.
process of
(ii) Justify the need for BCNF over 3 NF in the 6 CO3
normalization. Highlight the significance of 4 NF.
T1,T2, and T3 and the schedules S1
13 (a) () |Consider the transactions
and S2 given below.
T1:r1(); r1(); w1 (X); w1(Z)
T2: r2(); r2(); w2(Z CO4
T3: r3); r3(0); w3M 7
(Z); w1 (); w1(Z)
S1:r1(); r3(M; r3X); r2(); r2(Z); w3(:; w2(Z); r1();
w3(); w1 w2(Z); w1(Z)
S2: r1(); r3; r2(); r3(); rt(Z);r2);
serializable.
Check whether S1 and S2are conflict
locking protocols used for handling
(0) Explain the 2-phaseRelational 6 L3
concurrency corntrol in Database Systems. CO4
OR
schedule S is conflict serializable or
13(b) () Check whether the given possibBe serialized
not. If yes, then determine all the AU
schedules. CHENNAI
600 025
0
T2 T3 T4 SNO
T1
R(A)
R(A)
R(A) 7
CO4 L4
W(B)
W(A)
R(B)
W(B)

Relational
(0)Explain ARIES crash recovery aigorithm used in 6 CO4 L3
Database Management System.
steps involved in the
14 (a) () |What is query processing? Explain the 6 CO5 L2
execution of a SQL query in a relational database system.
(ü) Consider a B+-tree node which can hold up to 4 pointers.
7 COS L5
B+ Tree.
Insert 31, 33,35, 37, 39, 32, 34. 36; 38, 100 in to the
OR
14 (b) ()What is cost estimation in a query processing of a relational 6 CO5 L2
database system? Explain.
(0)Create a Binary Tree of order 5 for the following data tems.
7 CO5
A, G, F, B, K, D, H,.M, J, E, S, I,R, X, G, L, N, T, U, P
 company which are located in a different
15 (a) ) Consider an Insurance Highlight the features of a Distributed 6
parts of the country. CO5 2
Database System in this Context. customer. can
Consider an order prOcessing system where a ID, order ID
consists of a customer
place an order. Each order unit price.
with date and also one or more items with quantity andprocessing
7 CO5 L5
Create a XML file with three records to fulfill this order
system.
OR
are located indifferent parts of
15 (b) () |For an Insurance company which fragmentations in the 6 CO5
the country, list the possible types of
L2

realization of a Distributed Database Systems.

can
(ii) Consider an order processing system where a customer ID
consists of a customer ID, order
place an order. Each order 7
with date and also one or more items with quantity and unit price. COS L5

Create a document oriented database using MongoDB with three

records to futfill this order processing system.

PART- C(1 x 15 =15 Marks)

(Q.No.16iscompulsory)
Questions Marks CO BL
Q. No
16. () | Consider a simple scenario in which a client orders food at a
restaurant. The client can place order for one or more menu
items. Each client's order is served by one attendant. An
attendant can supply many orders of different customers. Design
7 CO2 L4
a database system by drawing an ER diagram. ldentify the
entities and relationships. Also ldentify the cardinalities and
realize the ER diagram intorelation tables with key attributes.
Consider a relation Purchase Details as follows:
(ii)
Cust ID Cust Name Prod Name Price Supplier Supplier
Contact
1001 XXX Computer 55555 HP [email protected],
[email protected]
1002 AC 75000 LG [email protected],
[email protected]

1050 ZZZZ WASHING 50000 SIEME 123456,7654 8

MACHINE NS 32 CO2 L4
AcUstomer can buy many product and each product can be
purchased by many customers. Price is determined by the
product and supplier name. Different products may be supplied
by the same suppliers.
Normalize the relation andensure that the relation satisfies 3 NE.

NOILIO AMA
SNOIS
 Register no:

DEPARTMENT OF INFORMATION SCIENCE AND TECHNOLOGY

CEG CAMPUS, ANNA UNIVERSITY CHENNAI
IT5351 – DATABASE MANAGEMENT SYSTEMS
ASSESSMENT - I
Regulation 2019 (CBCS)
Academic Session : September 2021 – December 2021

Program : B.E / B.Tech Year / SEM: 2/3

Max. Marks : 25 Duration: 60 mins
Date of Exam : 25.10.2021 Faculty names: Dr. S. Swamynathan &
Dr. M. Deivamani
Answer ALL Questions
Q.
Question CO BL Marks
No.
PART - A
1. Define the term logical and physical data independence. CO1 L1 1

2. Consider the entities Flight(FId, Source, Destination) and Pilot(PId,

Pname). Each pilot can operate many flights and a flight is always operated by CO1 L2 2
one pilot. How referential integrity can be enforced on these entities?

3. What is a weak entity? In the context of travel insurance, identify the strong and
CO2 L1 2
weak entities and justify the relationships

4. Consider the following table. Check if it satisfies 2NF.

PLAYER_ID GAME_ID GAME_FEE
1001 101 5000
1002 102 7000 CO3 L2 2
1001 104 8000
1004 103 6000
1004 101 5000
1002 105 4000

5. Consider a table ORDER (OrderID, CutomerID, City, Amount). Create a

cursor to fetch all the customers who belong to "Chennai". Display all the CO2 L2 3
records with a message "Hai .. Special Offer".

PART - B
6. A park provides services such as walking tracks, badminton, volleyball, tennis
courts, open gym, yoga, and martial arts (karate, silambam). For effective
utilization of these services, the management and administrator want to build a
Fitness Information System. All the registered users can select the service(s)
they are interested in and the time slots (1 hour). The coaches associated with CO2 L3 7
each service can train selected number of users. A user can avail one or more
services with different time slots. A maintenance and training fee will be collected
by the administrators based on the games. Draw an ER diagram for realizing this
Information System and to realize the relational schema with key constraints.
 Q.
Question CO BL Marks
No.
Consider CoachList(CoachID, coachName, ExpertiseGameID, emailID,
ManagerID, Experience) as a relational schema. Some of the senior coaches
will be the managers for the other coaches. The senior most coach manages
himself. Write SQL for the following.
1. List the names of coaches which starts with 'S' or 'R'. (1)
2. List all the coaches who have more than 10 years’ experience and has
7. CO2 L3 8
expertise in Hockey. (1)
3. List the total number of coaches game wise and the average experience
for each game. (2)
4. List the coachName with the Manager name. (2)
5. List the unique games for which the average experience of the coach is
more than 5 years. (2)
CO – Course Outcomes.
BL – Bloom’s Taxonomy Levels (L1 – Remembering, L2 – Understanding, L3 – Applying, L4 – Analysing, L5 – Evaluating, L6 – Creating)
 Roll No.
ANNA UNIVERSITY (UNIVERSITY DEPARTMENTS)

B.E. / B. Tech / B. Arch (Full Time) - END SEMESTER EXAMINATIONS, NOV/DEC 2021

NFORMATION TECHNOLOGY
I

Semester 3
1T5351 & Database Management Systems

(Regulation 2019)
Time: 3hrs [t/ax.Marks: 100

co1 tVlodel an application's data requirements using conceptual modeling and design database
schemas based on conceptual model.
co2 Formulate solutions to a broad range of query problems using relational algebra / SQL
co3 Demonstrate an understanding of normalization theory and apply such knowledge to the
normalization of a database.
co4 Run transactions and estimate the procedures for controlling the consequences of
concurrent data access.
co5 Explain basic database storage structures, access techniques, and query processing
Describe d istri buted, sem i-structured and unstructured d atabase systems.
BL - Bloom's Taxonomy Levels
(Ll - Remembering, L2 - Understanding, L3 - Applying, L4 - Analysing, L5 - Evaluating, L6 - Creating)

PART-A(10 x2= 20Marks)

(Answer all Questlons)

Q. No Questions Marks co BL
1 Consider a restaurant table booking database system. ldentify the
schema level implementation details for this database system. 2 co1 L3
2 A department can have several faculty members and faculty
members can work in many departments. Realize these as
relational database schemas with necessary constraints. 2 co1 L3
3 Define lossless and lossy decomposition with an example 2 co3 L3
4 A Project Manager may manage many Programmers, but a
Programmer is managed by only one Project lt/lanager. Represent
this relationship in ER diagram with cardinality. Note that one of 2 co1 L4
the Programmer becomes a Proiect [t/lanager.
5 List the different levels of lock granularity used in concurrency
control. 2 co4 L2
b List the different algorithms used for deadlock avoidance in DBMS
and highlight their features, 2 co4 L2
7 For balance of redundancy, disk drive usage and performance,
suggest a suitable RAID technology. 2 cos L3
8 Discuss the role of hash function in static hashing with an
example. 2 cos L3
9 Justify the need for replication in distributed databases 2 co5 L2
10 Write a XML schema for the following structure.

oRDER_DETAILS(tD, DATE, PRODUCT_DETA|LS(tD,NAME, 2 co5 L3

QUANTITY), DELIVERY_ADDRESS)
 PART- B (5 x 13 = 65 Marks)
(Restrict to a maximum of 2 subdivisions)

Q. No Questions Marks co BL
11 (a) (i) Consider the following relational schema: -

Customer-Detai ls (Cust-l D, Cust-Name, email,

Expenditure_Limit)
Stafflist_Details(S_lD, Name, JoinDate, Supervisor_lD, Salary)
Visito r_Deta ils(Visitor_l D, Vis itor_Name, em a l)
i

Product_Details(P_lD, P_Name, P_Price, P-Category, Discount)

Write SQL queries for the following natural queries.

(1)List the customer name, email and expenditure limit from the
customer_Details table in the ascending order of the customer
name. 2
(2)List the cheapest products lD, Name and Price from the
product_Details table. 2
(3) List the Staff name, JoinDate and their Supervisor name from
the Stafflist_Details Table. 2
(4) List out the names and emails of Customers and Visitors for
whom the new product details need to be emailed. 2 co2 L6

(ii) Consider the schema

Stafflist_Details(S_lD, Name, JoinDate, Supervisor_lD, Salary).
Write a trigger to increase the staff salary by 20% if the
experience is > 10 years. Note that the experience is to be 5 co2 L6
derived based on JoinDate.

OR
11 (b) (i) Consider AnimalType(AnimalTypelD, AnimalType) and
Animal(Animall D, AnimalTypel D, AnimalName, Age)

Write Relational algebra expression for the following: -

(1) To list the Animal lD and Animal name. 2

(2) To list all the Animal name and Animal type based on the
Animal type lD. 2
(3) To select all the tuples from Animal where the AnimalType is
'Bird' and Age is above 1 year. 2
co2 L6
{4) To merge the AnimalType and Animal table. 2
(i i) Consider the schema
Animal(AnimallD, AnimalTypelD, AnimalName, Age) 5 co2 L6
Write an explicit cursor to display all the Animal details.

12 (a) (i) Con sider the relation scheme R (A, B, C, D, E, F, G, H, l, J) and

the set of functional dependencies as given below.

B}*{C}, { B}--{
{A, E, F}, {A, D}---{G, H }, {G }-{ I },
and{H}-{J}
Determine the key for the relation R and the total number of I co3 L4
candidate
(ii) Differentiate 3NF and BCNF with an exam 4 co3 L2
OR
12 (b) (i) Consider the relation table STAFF TA.
Staff lD Staff Name Work Place Staff Department
s001 55 [t/ani Trichy D06
s001 98 Kathir Salem D04
s001 98 Kathir Salem D08
s001 05 Balu lt/ladurai D11
s001 05 Balu Madurai D01
ldentify the anomalies if any and the potential problems
associated with it. co3 L4
8
(i i) Suggest the means of overcoming the anomalies if exists in the
STAFF_DATA relational schema. 5 co3 L4

13 (a) (i) Consider a schedule S1 which involves three transactions T1,T2

and T3.

S1 : 11(x) r3(y) w1(x) w2(y) r3(x) w2(x)

Draw the precedence graph and explain whether 51 is conflict 7 co4 L4

serializable or not.
(ii) List the different categories of protocols used for handling
concurrency control in DBIVIS and highlight their features. 6 co4 L2
OR
13 (b) (i) Let T1 andT2 be two transactions and 51 and 52 be two
schedules associated with T1 andT2.

S1 :R1(X) R1 (Y) R2(X) R2(Y) W2(Y) W1(X)

32: R1(X) R2(X) R2(Y) w2(Y) Rl(Y)w1(x)
7 co4 L4
Which one of the schedule is conflict seriaiizabie? Explain.
(ii) Explain the log based recovery mechanism used in DBMS. Also
explain the mechanism used to address failure during recovery. 6 co4 L2
1a (a) (i) Construct a B+-tree for the following set of values
(22,32, 52,72, 112, 172, 192,232,292, 312) where the number
of pointers that will fit in to a node is 5. 8 co5 L6
(ii) Show the modified tree after deleting 192. 5 co5 L6
OR
14 (b) (i) Consider a B+-tree node which can hold up to 4 pointers and 3
keys.
lnsert 1 1 ,33,55,77 ,99,22,44,66,88,100 and show the tree after
insertion. 8 cos L6
(ii) Explain the cost estimation for executing a selection query which
uses a binary search based on a primary key. 5 co5 L4
15 (a) (i) Describe the architecture of a Distributed Database system and
summarize the types of fragmentations supported in distributed
database applications. 6 co5 L2
(ii) Discuss the different types of NoSQL databases and their uses in
appropriate scenario. 7 co5 L3
OR
15 (b) (i) Create a JSON based NoSQL document database to store two
person's personal details and their hobbies. 7 cos L3
(ii) Highlight the significance of CAP theorem 6 co5 L2
 PART- C (1 x 15 = 15 Marks)
(Q.No.16 is compulsory)

Q. No Questions Marks co BL
16. (i) Co nsi der a n o nl tne Lea rn ing Web site for the h igh school
ch ildren Th e a uth orized chi td ren can regi,ster for SU bject rel ated
I

co-curricular and extra-curricular activities. Different teachers /

experts will handle sessions to support these activities. Based on
the periodical assessments made, marks will be awarded for
each activity and for each child. The parents of the child are
allowed to monitor their child's activities and the awarded marks
and provide n ecessa ty feedb ack. Draw an E R d ia gram to design
th is data base nd mention the association between
VA rious entities cardina co1 L4
7
(ii) Realize the relational schema for the Learning web site and
identify the key constrai ns. Also ensure that the realized relational
schema satisfies at least 2 NF 8 co3 L4