Department of Computer Science and Engineering

Year : 2022-23

UNIT II DATABASE DESIGN

Sem : EVEN

Subject Code : CS3492 Branch : CSE A & B

Subject Name : Database Management Systems Year/Sem. : II / IV

UNIT - II DATABASE DESIGN

Entity-Relationship model – E-R Diagrams – Enhanced-ER Model – ER-to-Relational Mapping –
Functional Dependencies – Non-loss Decomposition – First, Second, Third Normal Forms,
Dependency Preservation – Boyce/Codd Normal Form – Multi-valued Dependencies and Fourth
Normal Form – Join Dependencies and Fifth Normal Form
PART - A
1. What is an derived attribute ? Give example. (K1) (A/M’2023)
2. Define join dependency (K1) (A/M’2022)
3. State the types of attributes in E-R model. (K1) (A/M’2021 A/M 2022)
4. What is E-R diagram ? (K1) (A/M’2021)
5. Differentiate between static and dynamic SQL. (K4) (N/D’2020)
6. Write the characteristics that distinguish the Database approach with the file based approach(K1)
(N/D’2020)
7. Define functional dependency. (K1) (N/D’2020 A/M 2023)
8. What is data definition language ? (K1) . (N/D’2020)
9. What is data modeling? Who popularized the E-R model? (K1)
10. Who is the father of ER Model? (Or) Who invented ER diagram? (K1)
11. How do you estimate the cost of Hash function?How do you differ from hybrid Hash function? (K1)
(N/D’19)
12. What is E-R diagram ? (K1) (A/M’21)
13. Give the properties of decomposition. (A/M’19) (OR) What is meant by lossless-join decomposition?
(A/M’11) (OR) Define non-loss decomposition. (K2) (N/D’16)
14. Define the terms Entity set and Relationship set. (A/M’19) (OR) What is an entity? (K1) (M/J’14)
15. What is weak entity? Give example. (K1) (A/M 2018)
16. Define a foreign key. Give example. (K1) (A/M 2018/ 2023)
17. Explain entity relationship model. (K4) (M/J’16)
18. State the anomalies of 1NF. (K1) (N/D’15).
19. Is it possible for several attributes to have the same domain? Illustrate your answer with suitable
examples. (K3) (N/D’15).

CS8492 – Database Management Systems 1

Department of Computer Science and Engineering

20. Define functional dependency. (or) Write a note on functional dependencies. (K1) (A/M’15)
(A/M’10)(N/D’13)(A/M’21)
21. Why 4NF in Normal Form is more desirable than BCNF? (K1) (N/D’14)
22. Define trivial functional dependency. (K1) (N/D’13)
23. Define Boyce-Codd normal form. (K1) (M/J’13) (M/J’15)-R 2008
24. Define normalization. What is the need for normalization? (K1) (M/J’13) (M/J’15) (A/M’10)
25. Give example for one to one and one-to-many relationship. (K2) (M/J’13)
26. What is join dependency, full functional dependency and partial functional dependency? (K1)
27. How good is BCNF? (K1) (N/D’16)
28. Write short notes on Aggregate functions. Give examples. (K1) (N / D ’19)
29. Can a view be defines with other view? Explain with an example. (K4) (N / D ’19)
30. Define trivial functional dependency. (K1) (N/D’13)
31. Define multi valued dependency. (K1) (N/D’12)
32. Show that, if a relational database is in BCNF, then it is also in 3 NF. (K2) (N/D’12)
33. Give an example of a relation schema R and a set of dependencies such that R is in BCNF, but not in
4 NF. (K2) (A/M’12)
34. Why are certain functional dependencies called as trivial functional dependencies? (K1) (A/M’12)
35. A relation {A, B, C, D} has FD’s F= {AB->C, C-> D, D -> A}. Is R is in 3NF? (K1) (A/M’11)
36. Consider the following relation R (A, B, C, D, E). The primary key of the relation is AB. The
following functional dependencies hold: A -> C, B -> D, AB -> E. Is the above relation in second
normal form? (K2) (N/D’11)
37. Consider the following relation R (A, B, C, D). The primary key of a relation is A. the following
functional dependencies hold: {{A -> B, C}, {B -> D}} Is the above relation in third normal form?
(K2) (N/D’11)
38. With an example explain what a derived attribute is? (K2) (N/D’11)
39. Define irreducible sets of dependencies. (K1) (N/D’10)
40. Define the third normal form. (K1) (N/D’10)
41. Define normal forms. Explain the types. (K1)
PART - B
1. A Company is organized into departments. Each department has employees working in it. The
attributes of department include department name. The attribute of employee include employee
number, employee name, date of birth, gender, date of joining, designation and basic pay. Each
department has a manger managing it. There are also supervisiors in each department who supervise a
set of employees. Each Department controls a number of projects. The attributes of project include
project code and project name. A project is controlled only by one department. An employee can

CS8492 – Database Management Systems 2

Department of Computer Science and Engineering

worked, in time and out time has to be kept track. The company also keeps track of the dependents
include dependent name, date of birth , gender and relationship with the employee.
(i)Model entity Relationship diagram for the above scenario.
(ii)Map the entity Relationship diagram you have modeled to relation. (K1) (A/M 23)
2. Consider a relational schema R = (A,B,C,D,E)
F = (A->BC,CD->E,B->D,E->A).Show the decomposition of R in to ABC and ADE is lossless join
and dependency preserving if the above set F of functional dependencies holds. (K2) (A/M’2022)
3. Explain the fourth normal form with an example. (K4) (A/M’2022)
4. Consider the following relation schema LOTS which describe parcels of lands for sale n various
countries of a state. Suppose that there are two candidates keys : Property id and
{country_name,lot#} that is , lot numbers only within countries , but property id numbers are unique
across countries for the entire state.
LOTS (Property id# , country-name ,Lots,area ,price,,tax-rate ) Based on the given primary key ,is the
relation in 1NF,2NF,3NF and BCNF ,4NDF? Why and why not?How would you successfully
normalize it completely? (K2)
(ii)Why 3NF is preferable than ? (K1) (A/M’2022)
5. (i) Consider the following relation: R(U, V, W, X, Y, Z) All the attributes of relation R are atomic. The
primary key of relation R is combination of U and V. The following functional dependencies hold: UV
→ W U → X V → Y Y → Z Is relation R normalized? If yes, justify the relation is normalized. If no, state
reasons and normalize the same. (10) (K2)
(ii) Consider the following relation: STUDENT (ROLLNUMBER, NAME, DOB, GENDER, BRANCH_CODE,
BRANCH_NAME) The primary key of the relation is ROLLNUMBER. The following functional
dependencies hold: ROLLNUMBER → NAME, DOB, GENDER, BRANCH_CODE BRANCH CODE →
BRANCH_NAME Is relation STUDENT normalized? If yes, justify the relation is normalized. If no, state
reasons and normalize the same. (5) (K2) (N/D’2021)
6. (i) Outline the factors used to evaluate indexing and hashing techniques. (5) (ii) What is an index
record? Outline dense index and sparse index with an example. (8) (K2) (N/D’2021)
7. (i) A university registrar’s office maintains data about the following entities: (1) courses, including
number, title, credits, syllabus, and prerequisites; (2) course offerings, including course number,
year, semester. section number, instructor, timings, and classroom; (3) students, including student-
id, name, and program; and (4) instructors, including identification number, name, department, and
title. Further, the enrollment of students in courses and grades awarded to students in each course
they are enrolled for must be appropriately modeled. Model an entity relationship diagram for the
registrar’s office. (9) (ii) Model an E-R diagram for a car-insurance company whose customers own

CS8492 – Database Management Systems 3

Department of Computer Science and Engineering

one or more cars each. Each car has associated with it zero to any number of recorded accidents.
State any assumptions you make. (4) (K1) (N/D’2021)
8. (i) State the Armstrong axioms. (6) (ii) Define BCNF and justify a relation R with two attributes is in
BCNF. (7) (K1) (N/D’2021)
9. Outline equi-join, left outer join, right outer join and full outer join operations in relational algebra
with an example. (13) (K2) (N/D’2021)
10. i) Write an algorithm to find closure of functional dependents. (5) ii) Compute the closure of the
following set F of functional dependencies for relation schema R = (A, B, C, D, E) (10) A → BC CD → E
B → D E → A List the candidate keys for R. (K1) (A/M’2021)
11. Consider the following relation CAR-SALE (Car #, Data-Sold, Salesman #, Commission %, Discount-
amount) Assume that a car may be sold by multiple salesmen, and hence (Car #, Salesman #) is the
primary key. Additional dependencies are Date-Sold → Discount-amt and Salesman # → Commission
% Based on the given primary key, is this relation in 1 NF, 2 NF, or 3 NF ? Why or why not ? How
would you successively normalise it completely ? (16) (K2) (N/D’2020)
12. Explain first normal form, second normal form, third normal form and BCNF with an example.
(K4) (N / D ’20 A/M 23)
13. What is meant by semantic query optimization ? How does it differ from other query optimization
technique ? Give example. (K1) (N / D ’20)
14. Explain the principles of i) Loss less join decomposition. (5) ii) Join dependencies. (5) iii) Fifth
normal form. (6) (K2) (N / D ’20)
15. (i) Discuss in detail the steps involved in the ER-to-Relational mapping in the process of relational
database design. (K2) (7)(N / D ’19)
(ii) Explain the multi-value dependency and fourth normal form 4NF. (K2) (6) (N / D ’19)
16. (i) Explain with suitable example, the constraints of specialization and generalization in ER data
modeling, (7) (K2) (N / D ’19)
(ii) Explain the join dependency and fifth normal form 5NF. (6) (K2) (N / D ’19)
17. Prove the statement “When the column of a view is directly derived from a column of the base table”
by using a suitable example. (K2) (N / D ’19)
18. i) Write an algorithm to find closure of functional dependents. (K1) (5) (A/M’21)
19. ii) Compute the closure of the following set F of functional dependencies for relation schema R = ( A,
B, C, D, E) (K3) (10) (A/M’21)

A BC
CD E
B D
E A
20. List the candidate keys for R. (K1)

CS8492 – Database Management Systems 4

Department of Computer Science and Engineering

21. What is normalization? Explain in detail about all normal forms. (A/M’19) (OR) State the need for
normalization of a database and Explain the various normal forms (1 st, 2nd, 3rd, BCNF,4th 5th and
Domain-Key) with suitable examples.(A/M’15) (or) What are Normal Forms? Explain the types of
Normal form with an example. (16) (K1) (N/D’14) (A/M’12)(A/M’11) (A/M’10)(M/J’14) (N/D’16)
22. Briefly discuss about the functional dependency concepts. (A/M’19) (OR) Explain in detail about all
functional dependencies based normal forms with suitable examples. (K2) (N/D’12)
23. What is database normalization? Explain first normal form, second normal form and third normal
form with an example. (K1) (A/M 2018)
24. Explain the following terms briefly : attribute, domain, entity relationship, entity set, relationship set,
one-to-many relationship, many-to-many relationship, participation constraint, overlap constraint,
covering constraint, weak entity set, aggregation and role indicator. (K2) (A/M’21)
25. Draw E-R diagram for the “Restaurant Menu Ordering System”, which will facilitate the food items
ordering and services within a restaurant. The entire restaurant scenario is detailed as follows. The
Customer is able to view the food items menu, call the waiter, place orders and obtain the final bill
through the computer kept in their table. The waiters through their wireless tablet PC are able to
initialize a table for customers, control the table functions to assist customers, orders, send orders to
food preparation staff (chef), 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. (K2) (A/M’15)
26. Write short notes on:
a. Data model and its types (8)
b. E-R Diagram for Banking System (8) (K1) (N/D’14)
27. Draw an E-R diagram corresponding to customers and loans. (K5) (M/J’14)
28. Explain Boyce Codd Normal Form & Fourth Normal Form with example. (K2) (M/J’14 A/M 23)
29. Describe about the multi-valued dependencies and fourth normal form with suitable example. (K1)
(A/M’12)
30. Explain the: (i) Six basic operations in relational algebra. (ii) Triggers. (K2) (N/D’16)
31. Discuss about: (i) Aggregate function and outer join. (ii) Distributed databases and client server
databases. (K2) (N/D’16)
32. What is redundant data? What are the problems caused by redundant data? (K1) (6) (N/D’13)
33. Explain the process of normalization from 1NF to BCNF stage with example. (K2) (10) (N/D’13)
(M/J’15)-R2008
34. Consider the following relation:
CAR-SALE (Car no, Data-Sold, Salesman no, Commission %, Discount-amount)

CS8492 – Database Management Systems 5

Department of Computer Science and Engineering

Assume that a car may be sold by multiple salesmen and hence (Car no, Salesman no) is the primary key.
Additional dependencies are Date-Sold -> Discount-amount and Salesman no -> Commission % Based
on the given primary key, is this relation in 1 NF, 2 NF or 3 NF? Why or why not? How would you
successively normalize it completely? (K2) (M/J’13)
35. Explain the purpose of database system. (K2) (M/J’13)
36. Explain the principles of: (K2) (M/J’13)
a. Loss less join decomposition
b. Join dependencies
c. Fifth normal form
37. Draw an E-R diagram for a banking enterprise with almost all components and explain. (K2)
(A/M’12) (M/J’15)-R 2008
38. Consider the following relation R(A,B,C,D,E) with functional dependencies.
a. {A🡪BC, CD🡪E, B🡪 D, E🡪A}, Identify super keys. Find Fc, F+.(K2) (M/J’15)-R2008
39. Construct an ER model for the car rental company database. (K5) (N/D’15)
40. i. Explain select, project & Cartesian product operations in relational algebra with an example.
(K2) (6)
ii. Construct an ER diagram for a car insurance company whose customers own one or more cars
each. Each car associated with it zero to any number of recorded accidents. Each insurance
policy covers one or more cars, and has one or more premium payments associated with it.
Each payment is for a particular period of time, and has an associated due date and the date
when the payment was received. (K2) (N/D’16)(7)
iii. Discuss the correspondence between the ER model construct and the relational model
constructs. Show how each ER model construct can be mapped to the relational model.
Discuss the option for mapping EER model construct. (K2) (A/M’17)

CS8492 – Database Management Systems 6

Department of Computer Science and Engineering

Year : 2022-
23
UNIT III TRANSACTIONS
Sem. : EVEN

Subject Code : CS3492 Branch : CSE A & B

Subject Name : Database Management Systems Year/Sem. : II / IV

UNIT – III
Transaction Concepts – ACID Properties – Schedules – Serializability – Transaction support in SQL – Need for Concurrency – Concurrency control –Two
Phase Locking- Timestamp – Multiversion – Validation and Snapshot isolation– Multiple Granularity locking – Deadlock Handling – Recovery Concepts –
Recovery based on deferred and immediate update – Shadow paging – ARIES Algorithm

PART - A
1. Define serializability. (K1) ( A/M’2023)
2. List out the timestamp based deadlock prevention schemes. (K1) (A/M’2022)
3. what is the use of save points in recovery. (K1) (A/M’2022)
4. What are serializable schedules? (K1) (N/D’2021)
5. What are the four conditions for deadlock. (K1) (N/D’2021)
6. List the ACID properties and its usefulness. (K1) (A/M’2021)
7. What benefit does strict two-phase locking provide ? What are the disadvantages of it ? (K1)
(A/M’2021)
8. What is serializable schedule ? (K1) (N/D’2020)
9. What type of locking needed for insert and delete operations ? (K1) ( N/D’2020)
10. Name the first transaction processing system and write the difference between SABRE and OLTP.
(K1)
11. Brief about consistency in transaction. (K2)
12. What is a livelock? (K1)
13. Define durability. (K1)
14. What are the different transaction states? (Or) What are the states of transaction? (K1) (A/M’19)
15. What is meant by log-based recovery? (K1) (A/M’19)
16. When was the first transaction processing software developed and by which company? (K1)
17. State the difference between a shared lock and an exclusive lock. (K1) (A/M 2018)
18. Define the properties of Transaction (Or) List ACID properties. (K1) (M/J’13, A/M’11, N/D’10,
A/M’10, A/M’15). (N/D’14, M/J’16)(OR) List the ACID properties and its usefulness. (K1)
(A/M’21)
19. What is Serializability? How it is tested? (K1) (N/D’14) (M/J’14) (N/D’16) (A/M 2018)

CS8492 – Database Management Systems 7

Department of Computer Science and Engineering

20. Define Deadlock. (K1) (M/J’14)

21. Define about cascading rollback. (K1) (N/D’13)
22. What is a rigorous two phase locking protocol? (K1) (N/D’13)
23. Define two phase locking. (K1) (M/J’13)
24. State the write-ahead log rule. Why is the rule necessary? (K1) (N/D’12)
25. Differentiate strict two phase locking protocol and rigorous two phase locking protocol. (K4)
(M/J’16)
26. What benefit does strict two-phase locking provide? What disadvantages result? (K1)
(A/M’12)(A/M’21)
27. List the two commonly used concurrency Control techniques. (K1) (N/D’11)
28. List the SQL statements used for transaction control. (K1) (N/D’11)
29. What are two pitfalls (problems) of lock-based protocols? (K1) (A/M’11)
30. What are the three kinds of intent locks? (K1) (N/D’10)
31. What do you mean by a transaction? (K1) (A/M’10)
32. What is meant by conflict serializable schedule? (Or) What is a serializable schedule? (K1) (A/M’17)
33. What is deadlock prevention? (K1)
34. What is meant by concurrency control? (K1) (N/D’15)
35. Give an example of two phase commit protocol. (K4) (N/D’15)
36. List the four conditions for deadlock. (K1) (N/D’16 A/M’2023 )
37. What type of locking needed for inserts and delete operations? (K1) (A/M’17)
PART-B
1. (a)(i)What is transaction ? List and ACID properties with an example (K1)
(ii)outline the two phase locking protocol with an example. (K2)
(b)What is recovery ? Outline the steps in the Algorithm for recovery and Isolation exploiting
semantics (ARIES) Algorithm with an example. (K1) (A/M’2023)
2. Explain the two phase locking protocol for concurrency control. (K1) (A/M’2022)
3. Consider the following two transaction(K2)
T1:read(A);read(B);if A=0 then B=B+2; write (B)
T1:read(B);read(A);if B=0 then A=a+2; write (A)
4. Add lock and unlock instructions to the transaction T1 and T2 so that they observe two phase locking
protocols.can the execution of these transactions result in deadlock? (K2).(A/M’2022)
5. (i) What is a transaction? Draw the state diagram corresponding to a transaction and present an outline
of the same. (K1) (8) (ii) Outline the properties that must be satisfied by a transaction. (K2) (5)
(N/D’2021)
6. State and explain the transaction isolation level. (K1) (A/M’2021)

CS8492 – Database Management Systems 8

Department of Computer Science and Engineering

7. What are the two approaches of deadlock prevention ? Explain in detail with suitable example. (K1)
(A/M’2021)
8. Define Transaction.Represent the transaction states and Explain the various desirable properties of the
transactions. (K1) (A/M’2021)
9. Explain the Two-phase commit and Three-phase commit protocols. (K2) (N/D’2020)
10. b) Consider the following schedules. The actions are listed in the order they are scheduled and
prefixed with the transaction name. 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
schedules, answer the following questions : i) What is the precedence graph for the schedule ? (4) ii)
Is the schedule conflict-serializable ? If so, what are all the conflict equivalent serial schedules ? (4)
iii) Is the schedule view-serializable ? If so, what are all the view equivalent serial schedules ? (5)
(K2) (N/D’2020)
11. (i) Narrate the actions that are considered for deadlock detection and the recovery from deadlock.(9)
(ii) Discuss the properties of a transaction that ensure integrity of data in the database system. (4) (N /
D ’19) (K2)
12. Elaborate on the following (i) Two phase locking protocol. (7) (ii) Graph based protocol (6) (N / D
’19)(N/D’2020) (K3)
13. Explain concurrency control and deadlock in relation to databases with examples. (K2) (N/D ’19)
14. What is concurrency control? How it is implemented in DBMS? Briefly elaborate with suitable
diagrams and examples. (K1) (A/M’19)
15. Explain in detail about the ACID properties of a transaction. (K2) (A/M’19)(N/D’2020)
16. Discuss in detail about the testing of serializability. (K2) (A/M’19) (OR) Explain conflict
serializability and view serializability. (A/M’18) (OR) Explain the concepts of serializability. (8)
(K2) (A/M’11, A/M’10)
17. Explain deferred and immediate modification versions of the log based recovery scheme. (A/M’19)
(OR)Explain about immediate update and deferred update recovery techniques. (K2) (8) (A/M’11)
18. (i)During execution, a transaction passes through several states, until it finally commits or aborts. List
all possible sequences of states through which a transaction may pass. Explain why each state
transaction may occur? (K2) (A/M’18)
(ii)Explain with an example the properties that must be satisfied by a transaction.(K2) (A/M’18)
19. What is concurrency control? Explain the two phase locking protocol with an example. (K1)
(A/M’18)
20. Explain the Two-phase Commit and Three-Phase Commit Protocols(K2) (A/M’15)
21. Consider the following schedules. The actions are listed in the order they are scheduled, and prefixed
with the transaction name:
S1: T1:R(X) T2:R(X), T1:W(Y) T2:W(Y), T1:R(Y) T2:R(Y)

CS8492 – Database Management Systems 9

Department of Computer Science and Engineering

S2: T3:W(X, T1:R(X), T1:W(Y), T2:R(Z) , T2:W(Z), T3:R(Z) (K2) (A/M’15)

For each of the schedules, answer the following questions:
(i) What is the precedence graph for the schedules? (K1) (2)
(ii) Is the schedule conflict - Serializable? If so, what are all the conflict equivalent serial schedules?
(K1) (7)
(iii) Is the schedule view-serializable? If so, what are all the view equivalent serial schedules?
(K1) (7)
22. What is concurrency? Explain it in terms of locking mechanism and two phase commit protocol. (K2)
(N/D’14)
23. Write short notes on: (K1) (N/D’14)
(i) Transaction concept
(ii) Deadlock
24. Discuss the ACID properties of a transaction. Give relevant example.(8) (K2) (N/D’11, M/J’14) (or)
Briefly explain ACID property with an example. (K2) (4) (N/D’13)
25. With a neat sketch discuss the states a transaction. (Or) Brief the states of a transaction with a neat
diagram. (K2) (N /D’19)(M/J’14)
26. State and explain the transaction isolation level. (K1) (A/M’21)
27. Discuss two phase locking protocol. Give relevant example.(Or) Discuss elaborately the two=phase
locking protocol that ensures serializability. (K2) (N /D ’19) (N/D’11, A/M’11, M/J’14)
28. Explain about locking protocols. (K2) (16) (M/J’16)
29. Illustrate dead lock and conflict serializability with suitable example. (K3) (M/J’13)(M/J’15)
30. Explain two phase commit protocol. (10) (K2) (M/J’13)(M/J’15)(M/J’16)
31. Explain different locking mechanism used in lock based concurrency control. (K2) (10) (N/D’13)
32. Explain validation based protocol with an example. (K2) (6)(N/D’13)
33. What is the difference between conflict serializability and view serializability? Explain in detail with
an example. (K1) (12) (N/D’13) (N/D’15)
34. Discuss in detail about transaction concepts and two phase commit protocol. (K2) (N/D’12)
35. Write down in detail about intent locking and isolation levels. (K2) (N/D’12)
36. Discuss in detail about transaction recovery, system recovery and media recovery. (K2) (A/M’12)
37. Write down in detail about deadlock and serializability. (K1) (A/M’12)
38. Define a transaction. Then discuss the following with relevant examples: (K1) (8)
a. A read only transaction b. A read write transaction c. An aborted transaction. (N/D’11)
39. Explain the distinction between the terms serial schedule and serializable schedule. Give relevant
example. (4) (K2) (N/D’11)
40. Describe about the deadlock prevention schemes. (8) (K2) (A/M’11)

CS8492 – Database Management Systems 10

Department of Computer Science and Engineering

41. What are the two approaches of deadlock prevention ? Explain in detail with suitable example. (K2)
(A/M’21)
42. State the two-phase commit protocol. Discuss the implications of a failure of the coordinator and
some participants. (K1) (10) (N/D’10)
43. Briefly explain transaction recovery with primitive operations. (6) (K2) (N/D’10)
44. State and explain the three concurrency problems. (K1) (9) (N/D’10)
45. What is meant by isolation level and define the five different isolation levels. (K1) (7)(N/D’10)
46. How can you implement atomicity in transactions? Explain. (K1) (8) (A/M’10)
47. How concurrency is performed? Explain the protocol that is used to maintain the concurrency
concept(K1).(A/M’10) (N/D’15)
48. Explain multiple update problem and uncommitted dependency problems. Give examples for each.
(K2)
49. What is deadlock? How does it occur? How transactions be written to: (K1)
i) Avoid deadlock
ii) Guarantee correct execution (N/D’15) (8)
50. (i) Illustrate two phase locking protocol with an example. (K3) (6)
(ii) Outline deadlock handling mechanisms. (K2) (7) (N/D’16)
33. Consider the following extension to the tree-locking protocol, which allows both shared and exclusive
locks:
a. A transaction can be either a read-only transaction, in which case it can request only shared-locks,
or an update transaction, in which case it can request only exclusive locks.
b. Each transaction must follow the rules of the tree protocol. Read-only transactions may lock any
data item first, whereas update transactions must lock the root first.
Show that the protocol ensures serializability and deadlock freedom. (K2) (N/D’16)(7)
34. Consider the following two transactions:

Add lock and unlock instructions to transactions T1 and T2 , so that they observe the two-phase
locking protocol. Can the execution of these transactions result in a deadlock? (K2) (N/D’16)(6)
35. Discuss about locking and concurrency problem. Also write a note on concurrency protocols. (K2)
(N/D’16)
36. Discuss the violations caused by each of the following: dirty read, non repeatable read and phantoms
with suitable example. (K2) (A/M’17)

CS8492 – Database Management Systems 11

Department of Computer Science and Engineering

37. Explain why timestamp-based concurrency control allows schedules that are not recoverable.
Describe how it can be modified through buffering to disallow such schedules. (K2) (A/M’17)

Year : 2022-
23
UNIT IV IMPLEMENTATION TECHNIQUES
Sem. : EVEN

CS8492 – Database Management Systems 12

Department of Computer Science and Engineering

Subject Code : CS3492 Branch : CSE A & B

Subject Name : Database Management Systems Year/Sem. : II / IV

UNIT IV IMPLEMENTATION TECHNIQUES

RAID – File Organization – Organization of Records in Files – Data dictionary Storage – Column Oriented Storage– Indexing and Hashing –Ordered Indices
– B+ tree Index Files – B tree Index Files – Static Hashing – Dynamic Hashing – Query Processing Overview – Algorithms for Selection, Sorting and join op -
erations – Query optimization using Heuristics - Cost Estimation.

PART - A
1. Outline the need for indexing. (K2) (A/M’2023)
2. What is a hash function? Give example. (K1) (A/M’2023)
3. When it is preferable to use a dense index rather than a sparse index. (K1) (A/M’2022)
4. What are the steps involved in query processing. (K1) (A/M’2022)
5. What are the factors needed to evaluate the technique of ordered indexing and hashing ? (K1)
(A/M’2021)
6. What are the two basic kinds of indices. (K1) (N/D’2021)
7. Differentiate static and dynamic hashing. (K4) (N/D ’2020)
8. Give an example of a join that is not a simple equi-join for which partitioned parallelism
can be used. (K2) (N/D ’2020)
9. Compare and Contrast Range Partitioning and Hash Partitioning. (K4) (N/D ’19)
10. Who invented SQL? Write the needs. (K1)
11. Who invented the concept of RAID? (K1)
12. Define dense index. (A/M’19) (K1)
13. Write all the operations of files. (K1) (A/M’19)
14. What is a hash function? Give example. (K1) (A/M 2018)
15. Outline the steps involved in query processing. (K2) (A/M 2018)
16. State the need for Query Optimization. (K1) (A/M’15)
17. Define query. (K1) (N/D’13)
18. State the storage device hierarchy. (K1) (A/M’21)
19. What are the factors needed to evaluate the technique of ordered indexing and hashing ? (K1)
(A/M’21)
20. What is Query Optimization? Write down the basic steps. (K1) (A/M’15) (M/J’16)
21. Define: Hash join, Merge join, Nested-loop join. (K1)
22. Why does SQL allow duplicate tuples in a table or in a query result? (K1) (N/D’15)
23. Write about the four types (Star, Snowflake, Galaxy and Fast constellation) of data warehouse
schemas. (K1) (A/M’15)
24. Differentiate between Static and Dynamic Hashing. (K4) (N/D’14,A/M’15,N/D’15)

CS8492 – Database Management Systems 13

Department of Computer Science and Engineering

25. Define Data Mining and Data Warehousing. (K1) (N/D’14)

26. What are ordered indices? (K1) (N/D’11, M/J’14, M/J’15)
27. What is slotted page sheet? Draw the diagram. (K1) (N/D’13) (M/J’15)
28. What is the content of update log record? (K1) (N/D’13) (M/J’15)
29. What is the need for RAID? (K1) (M/J’13)
30. What is the basic difference between static hashing and dynamic hashing? (K1) (M/J’13)
31. What can be done to reduce the occurrence of bucket overflows in a hash file organization? (K1)
(N/D’12)
32. Write the different hashing techniques. (K1) (A/M’12)
33. When is it preferable to use a dense index rather than a sparse index? Explain your answer. (K2)
(A/M’12)
34. Distinguish between sparse index and dense index. (K4) (N/D’11)
35. What are the advantages and disadvantages of indexed sequential file? (K1) (A/M’11)
36. Which are the factors to be considered for the evaluation of indexing and hashing techniques? (K1)
(N/D’10)
37. What are the advantages of distributed database? (K1) (N/D’04, A/M’08)
38. What is called bit - level and block – level striping? (K1)
39. What are the two main goals of parallelism? (K1)
40. Distinguish between fixed length records and variable length records. (K4)
41. What is known as heap file organization? (K1)
42. What is known as clustering file organization? (K1)
43. What is known as a search key? (K1)
44. What is B-Tree? (K1)
45. Define mobile and web database. (K1)
46. Write a note on multidimensional and parallel databases. (K1)
47. What do you mean by data mart? State the function of data marts. (K1) (A/M’17)
48. Define mobile database with an example. (K1)
49. What are the applications of spatial data? (K1)
50. Define spatial database. (K1)
51. What is an intra query parallelism? (K1)
52. What is mean by garbage collection? (K1) (M/J’16)
53. Define software and hardware RAID systems? (K1) (M/J’16)
54. List out the mechanisms to avoid collision during hashing. (K1) (N/D’16)
55. What are the disadvantages of B-Tree over B+ Tree? (K1) (N/D’16)
56. Define replication transparency. (K1) (A/M’17)

CS8492 – Database Management Systems 14

Department of Computer Science and Engineering

57. How might the type of index available influence the choice of a query processing strategy? (K1)
(N/D’12)
58. What is a query execution plan? (K1) (A/M’17)
59. Which cost components are used most often as the basis for cost function? (K1) (A/M’17)

PART - B
1. (a)(i)Outline B tree index and B+ tree index with an example. (K2)
(ii)Explain static hashing with an example. (K2) (A/M’2023)
(b)What is query processing? Elaborate about the steps in query processing with a diagram(K2)
(A/M’2023)
2. i)Explain the RAID levels with the nature of applications supported by each level(8). (K2)
ii) Explain how B+ trees structures are used for indexing files.(5) (K2) (A/M’2022)
3. Let relations r1(A,B,C) AND R2(C,D,E) have the following properties :r1 has 20,000 tuples,r2 has
45,000 tuples, 25 tuples of r1 fit in to one block and 40 tuples of r2 fit on one block.explain the
number of blocks accesses required,using each of the following r1 l><l r2:
i)Nested loop join . (4)
ii)block nested loop join.(4)
iii)Merge join.(5) (K2) (A/M’2022)

4. Construct a 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 values are added in ascending order. Construct B+ trees for the
cases where the number of pointers that will fit in one node is as follows : a) Four b) Six c) Eight.
(K5) (A/M’2021)
5. Describe the procedure for index update for single level indices with example. (K1) (A/M’2021)
6. Explain dynamic hashing with example. (K2) (A/M’2021)
7. Explain about distributed databases and their characteristics, functions and advantages and
disadvantages. (K2) (N/D’2020)
8. i) What is RAID ? List the different levels in RAID technology and explain its features. (K1) (8)
ii) Illustrate indexing and hashing techniques with suitable examples. (K3) (5)(N/D’2020)
9. What is RAID ? Briefly explain different levels of RAID. Discuss the factors to be considered in
choosing a RAID level(K2).(N/D’2020)
10. Explain types of database security and database security issues. (K2) (N/D’2020)
11. Why data dictionary storage is important? (K1) (N/D’19)
12. (i) With simple algorithms explain the computing of Nested-loop join and
Block Nested-loop join. (10)
(ii) Sketch and concise the basic steps in Query Processing. (3) (K3) (N/D’19)

CS8492 – Database Management Systems 15

Department of Computer Science and Engineering

13. What is RAID? Briefly discuss about RAID. (A/M’19) (OR) Explain in detail about RAID
technology. (or) Explain the concept of RAID. (K2) (N/D’16)(6) (N/D’19)
14. Describe the structure of B+ tree and give the algorithm for search in the B+ tree with example (K2)
(A/M’19)
15. Discuss about the join order optimization and heuristic optimization algorithms. (K2) (A/M’15)
16. Give a detailed description about Query Processing and Optimization. Explain the cost estimation of
Query Optimization(K2).(N/D’14)
17. With a help of a neat diagram, explain the basic steps involved in processing a query. (M/J’03,
N/D’04, N/D’07, M/J’08, M/J’15-R2008, M/J’16) (or) What are the steps involved in query
processing? How would you estimate the cost of the query? (K1) (N/D’05, M/J’07)
18. Write algorithms to compute the following joins:
(a) Nested-loop join
(b) Block nested – loop join
(c) Indexed nested – loop join
(d) Merge join
(e) Hash join (K1) (M/J’05) (N/D’07)
19. Explain how the query is optimized. (M/J’05) (or) What are the steps involved in query processing?
How is the execution of a query optimized? (K2) (M/J’06)
20. Explain the Heuristic and cost estimation query optimization techniques in detail. (K2) (N/D’16)
21. What is a join? Explain the types of join. Give one example of each join operation. (K1)
22. Let relations r1(A,B,C) and r2(C,D,E) have the following properties:

r1 has 20,000 tuples, r2 has 45,000 tuples, 25 tuples of r1 fit on one block and 30 tuples of r2 fit on one block.

(K2) (N/D’16)
(i) Nested loop join
(ii) Block nested loop join
(iii) Merge join
(iv) Hash join
23. What is meant by semantic query optimization? How does it differ from other query optimization
technique? Give example. (K1) (A/M’17)
24. What is hashing? Explain static hashing and dynamic hashing with an example. (K2) (April/May
2018)
25. What is query optimization? Outline the steps in query optimization. (K2) (April/May 2018)

CS8492 – Database Management Systems 16

Department of Computer Science and Engineering

26. Write suitable diagrams, discuss about the RAID Levels (Level 0,Level 1,Level 0+1, Level 3, Level 4
and Level 5) (K1) (A/M’15)(N/D’15) (or) Briefly explain about RAID and RAID levels. (K2) (16)
(M/J’16)
27. Explain the architectural components of a Data Warehouse and write about Data marts. (K2)
(A/M’15)
28. Write short notes on Spatial and Mobile Databases. (K2) (N/D’14)
29. Explain in detail about: (K2)
(i) B+ tree index.
(ii) B tree index files. (N/D’14)
30. Briefly explain about B+ tree index file with example.(16) (K2) (M/J’16)
31. Explain Magnetic Disk and Tertiary Storage. (8) (K2) (M/J’14)(M/J’15)
32. Write a note on hashing. (8) (K1) (M/J’14) (M/J’15)
33. Describe in detail about RAID and tertiary storage. (K1) (N/D’12, A/M’11, A/M’10, N/D’13)
34. Explain the structure of B+ tree and how to process queries in B+ tree. (K2) (10)(N/D’13)
35. What is the need for building distributed database? Explain important issues in building distributed
database with an example. Explain how distributed database is used in client/server environment. (8)
(K1) (N/D’13)
36. Construct B+ tree to insert the following (order of the tree is 3). (K5) (M/J’13)
26, 27, 28, 3, 4, 7, 9, 46, 48, 51, 2, 6.
37. Write down detailed notes on ordered indices and B+ tree index files. (K1) (N/D’12)
38. Construct a B+ tree to insert the following key elements (order of the tree is 3). (K5) (A/M’12)
5, 3, 4, 9, 7, 15, 14, 21, 22, 23.
39. Describe in detail about how records are represented in a file and how to organize them in a file. (K2)
(A/M’12)
40. When is it preferable to use a dense index rather than a sparse index? Explain your answer. (4) (K1)
(N/D’11)
41. Explain the distinction between closed and open hashing. Discuss the relative merits of each
technique in database applications. (K2) (6) (N/D’11)
42. Describe the different methods of implementing variable length records. (K2) (4)(A/M’11)
43. Explain the various indexing schemes used in database environment. (K2) (12)(A/M’11)
44. Discuss the improvement of reliability and performance of RAID. (K2) (8) (N/D’10)
45. Explain the structure of B+ tree. (K2) (8)(N/D’10)
46. Explain the complex selection predicates with example. (K2) (N/D’10)
47. What are the purpose of indexing. How this can be done by B+ tree? Explain.( (K1)A/M’10)
48. Illustrate indexing and hashing techniques with suitable examples. (K3) (N/D’15)(8)
49. Explain the architecture of a distributed database system. (K2) (N/D’16)(7)

CS8492 – Database Management Systems 17

Department of Computer Science and Engineering

50. Describe benefits and drawbacks of a source-driven architecture for gathering of data at a data
warehouse, as compared to a destination driven architecture. (K2) (N/D’16) (7)
51. (i) Compare and contrast the distributed databases and centralized database systems. (K4) (8)
(ii) Describe the mobile database recovery schemes. (K2) (5) (A/M’17)
52. Explain what a RAID system is. How does it improve performance and reliability? Discuss the
level 3 and level 4 of RAID. (K2) (A/M’17)
53. Describe the procedure for index update for single level indices with example. (K2) (A/M’21)
54. Explain dynamic hashing with example. (K2) (A/M’21)
55. Construct a B+ tree for the following set of key values : (K5) (A/M’21)

(2, 3, 5, 7, 11, 17, 19, 23, 29, 31)

Assume that the tree is initially empty and values are added in ascending order. Construct B+
trees for the cases where the number of pointers that will fit in one node is as follows :
a) Four
b) Six
c) Eight.

Year : 2022-
23
UNIT V ADVANCED TOPICS
Sem. : EVEN

Subject Code : CS3492 Branch : CSE A & B

CS8492 – Database Management Systems 18

Department of Computer Science and Engineering

Subject Name : Database Management Systems Year/Sem. : II / IV

UNIT V ADVANCED TOPICS

Distributed Databases: Architecture, Data Storage, Transaction Processing, Query processing and optimization – NOSQL Databases: Introduction – CAP The-
orem – Document Based systems – Key value Stores – Column Based Systems – Graph Databases. Database Security: Security issues – Access control based
on privileges – Role Based access control – SQL Injection – Statistical Database security – Flow control – Encryption and Public Key infrastructures – Chal -
lenges

PART - A
1. What is a distributed database management system? (K1) (A/M’2023)
2. Define encryption with an example. (K1) (A/M’2023)
3. Give the significance of xquery.( (K2) A/M’2022)
4. Write the types of fragmentation in distributed databases. (K1) (A/M’2022)
5. Outline the motivation of Replication in a distributed database environment. (K2) (N/D’2021)
6. Give the DTD for an XML representation of the following nested-relational schema. Emp = (ename,
ChildrenSet setof (Children), SkillsSet setof(Skills)) Children = (name, Birthday) Birthday = (day,
month, year) Skills = (type, ExamsSet setof (Exams))Exams = (year, city) (K2).(A/M’2021)
7. State the storage device hierarchy. (K1) (A/M’2021)
8. Explain data classification. (K2) (N/D’2020)
9. What are the advantages of data warehouse ? (K1) (N/D’2020)
10. Give two examples of different query languages of Object Relational Databases. (K2) (N/D’19)
11. When was the first database created? (K1)
12. Who is the father of Information Retrieval? (K1)
13. Write two features of multimedia database. (K1) (A/M’19)
14. Compare sequential access devices versus random access devices with an example. (K4) (A/M’19)
15. Define data mining. (K1) (A/M 2018)
16. State the difference between classification and clustering. (K1) (A/M 2018)
17. Define a distributed database management system. (N/D’16) (A/M 2018)
18. How does the concept of an object in the object oriented model differ from the concept of an entity in
the entity relationship model? (K1) (N/D’16)
19. Define/Distinguish threats and risks.(A/M’15) (K1) (A/M’17)
20. What is association rule mining? (K1) (A/M’15)
21. What is crawling and indexing the web? (K1) (N/D’14)
22. What is relevance ranking? (K1) (N/D’14)
23. Give the DTD for an XML representation of the following nested-relational schema. (K2) (A/M’21)
Emp = (ename, ChildrenSet setof (Children), SkillsSet setof(Skills))
Children = (name, Birthday)

CS8492 – Database Management Systems 19

Department of Computer Science and Engineering

Birthday = (day, month, year)

Skills = (type, ExamsSet setof (Exams))
Exams = (year, city)
24. What is the difference between a false positive and false drop ? (K1) (A/M’21)
25. List the markup languages which are suitable for web databases. (K1)
26. Write two examples of multimedia databases and multimedia structure. (K1)
27. Differentiate distributed database and normal database. (K4)
28. How transaction is performed in Object oriented database? (K1)
29. What is versioning in terms of object oriented database? (K1)
30. What are the advantages of Data warehousing? (K1) (M/J’16)
31. How spatial databases are more helpful than active database? (K1)
32. What is deductive database? (K1)
33. Briefly explain about applications of data warehousing. (K2)
34. Write short notes on multimedia query languages. (K1)
35. What is knowledge? What are its types? (K1)
36. Define database security. (K1)
37. Explain data classification. (K2) (M/J’16)
38. Give types of privileges. (K2)
39. Define Cryptography. (K1)
40. What is the difference between XML schema and XML DTD? (K1)
41. List the types of privileges used in database access control. (K1) (N/D’15)
42. Define statistical database. (K1)
43. List the various cryptographic techniques. (K1)
44. Define support and confidence. (K1) (A/M’17)
45. What are the main categories of storage hierarchy? Draw the storage device hierarchy according to
their speed and their cost. (K1)
46. What are called jukebox systems? (K1)
47. What is called remapping of bad sectors? (K1)
48. Define access time, seek time, average seek time and rotational latency time. (K1)
49. What is meant by data-transfer rate? (K1)
50. What is called mirroring? (K1)
51. What is called mean time to repair? (K1)
52. What is the drawback of flash memory? (K1) (N/D’10) (K1)
53. Describe flash memory. (K2) A/M’10)
54. List out the physical storage media(K1).(A/M’10)
PART - B
1. (a)What is a distributed transaction ?Explain distributed query processing with an example. (K2)

CS8492 – Database Management Systems 20

Department of Computer Science and Engineering

(b)(i)What is No SQL ?Outline the features of NoSQL databases. (K2)

(ii)Discuss role based access control with an example. (K2) (A/M’2023)
2. Write a short note on the following :
i)XML Databases.(7)
ii)ODMG Model of ODG and OQL. (K1) (6)(A/M’2022)
3. Present an outline of Document Type Declaration, XML schema, path expressions and XQuery
language. (13) (N/D’2021)
4. (i) Outline the two basic types of fragmentation in a distributed database environment with an
example. (8) (K2) (ii) Compare the features of Object based and Object-relational databases. (K4) (5)
(N/D’2021)
5. What are the reasons for building distributed database ? Discuss the relative advantages of centralized
and distributed databases. Explain the difference between fragmentation, replication and location
transparency. (K1) (A/M’2021)
6. State and explain the persistent programming languages. (K1) (A/M’2021)
7. Write short notes on : i) Spatial and multimedia databases. (7) ii) Mobile and web databases. (K1) (6)
(N/D’2020)
8. Explain about distributed databases and their characteristics, functions and advantages and
disadvantages. ) (K2) (N/D’2020)
9. i) Explain the physical characteristics of magnetic disk. (8) ii) Discuss the techniques to improve the
speed of access to blocks on disks. (8) (K2) (N/D’2020)
10. (i) Explain on Web Databases.(9) (K2)
(ii) Discuss in detail on the recovery techniques that can be applied the common types of database
failure. (K2) (N/D’19)
Explain the following (i) Distributed databases (ii) Information Retrieval. (K2) (N/D’19)
11. (i) Explain in detail about Database Security (8)
(ii) XML Databases. (7) (K2) (N/D’19)
12. (i) Illustrate the usage of OQL, the DMG’s query language.(9) (K3)
(ii) Brief on the methods to store XML documents. (4) (K2) (N/D’19)
13. (i) Illustrate the approaches to store relations in distributed database.(9) (K3)
(ii) How effectiveness of retrieval is measured? Discuss. (K1) (N/D’19)
14. Discuss in detail about the distributed database. (A/M’19) (OR) Explain with diagrammatic
illustration the architecture of a distributed database management system. (A/M 2018) (OR) Explain
about Distributed Databases and their characteristics, functions and advantages and disadvantages.
(16) (K2) (M/J’16)
15. Explain in detail about the Deductive databases. (K2) (A/M’19)
16. Outline the features of the following databases: (K2) (A/M 2018)

CS8492 – Database Management Systems 21

Department of Computer Science and Engineering

(i) Parallel databases

(ii) Multimedia databases
17. Write an overview of database security (K2) (A/M 2018)
18. Explain the necessary characteristics a system must satisfy to be considered as an object oriented
management system. (K2) (A/M 2018)
19. Neatly write the K-means algorithm and show the intermediate results in clustering the below given
points into Two clusters using K-means algorithm. (K1) (A/M’15)
P1: (0,0) P2: (1,10) P3: (2,20) P4: (1,15) P5: (1000,2000) P6: (1500,1500) P7: (1000,1250)
20. Discuss about the access control mechanism and cryptography methods to secure the databases. (K2)
(A/M’15)
21. (i) Write short notes on distributed transactions. (K1)
(ii) Explain about discretionary access control based on Granting and Revoking Privileges. (K2)
(N/D’14)
22. Write short notes on: (i) Classification (ii) Clustering (K1) (N/D’14)

23. What are the reasons for building distributed database ? Discuss the relative advantages of
centralized and distributed databases. Explain the difference between fragmentation, replication
and location transparency. (K1) (A/M’21)

24. State and explain the persistent programming languages. (K1) (A/M’21)
25. Give XML representation of bank management system and also explain about Document Type
Definition and XML schema. (K2)
26. Briefly discuss client/server model with suitable example. (K2)
27. Compare and contrast between mobile databases and internet databases. (K4)
28. Explain how to identify active and deductive databases with an example. (K2)
29. Write detail note on data mining with its various techniques. (K1)
30. Explain the different approaches used for object oriented databases. (K2)
31. Discuss in detail about structure and various operation of object oriented query language. (K2)
32. Explain about the decision trees in the process of data mining. (K2)
33. Explain the object oriented database and its approaches. (K2)
34. Discuss the issues and steps involved in building a data warehouse. How the concept of relational
view is related to data warehouse and data marts? (K2)
35. Write a short note on Data Warehousing. (K1) (N/D’15)(8)
36. Describe the GRANT functions and explain how it relates to security. What types of privileges may
be granted? How rights could be revoked? (K2) (N/D’15) (8)
37. Suppose an object oriented database had an object A, which reference object B, which in turn
references object C. Assume all objects are on disk initially? Suppose a program first dereferences A,
then dereferences B by following the reference from A, and then finally dereferences C. Show the

CS8492 – Database Management Systems 22

Department of Computer Science and Engineering

objects that are represented in memory after each dereference, along with their state. (K3) (N/D’15)
(16)
38. Explain types of databases security and database security issues.(16) (K2) (M/J’16)
39. Discuss Apriori algorithm for mining association rules with an example. (K2) (N/D’16)
23. Give the DTD or XML schema for an XML representation of the following nested relational schema:
Emp=(ename, ChildrenSet setof(Children), SkillsSet setoff(skills))
Children=(name, Birthday)
Birthday=(day,month,year)
Skills=(type, ExamsSet setoff(Exams))
Exams=(year, city) (K2) (N/D’16)
24. 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 would recommend. Justify your recommendation. (K3) (N/D’16)
(i) A computer aided design system for a manufacturer of airplanes.
(ii) A system to track contributions made to candidates for public office.
(iii) An information system to support the making of movies.
25. (i) What are the basic crawling operations? Explain the processing steps in crawling procedure with
example. (K2)
(ii) Explain the process of querying XML data with an example. (K2) (A/M’17)
26. Describe the various components of data warehouse and explain the different data models used to
store data with example. (K2) (A/M’17)
27. Trace the results of using the Apriori algorithm on the grocery store example with support threshold
s=33.34% and confidence threshold c=60%. Show the candidate and frequent itemsets for each
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. (K3)

Transaction
Items
ID
T1 HotDogs, Buns, Ketchup
T2 HotDogs, Buns
T3 HotDogs, Coke, Chips
T4 Chips, Coke
T5 Chips, Ketchup
T6 HotDogs, Coke, Chips

CS8492 – Database Management Systems 23

Department of Computer Science and Engineering

K1-Remember, K2-Understand, K3-Apply, K4-Analyze, K5-Evaluate and K6-Create

Prepared by : Verified by : Approved by

Mrs. A. Manju AP/ CSE

Mr. S .Balaji Dr. U.V ARIVAZHAGU

HOD/CSE Principal

Mrs.K H Gayathri AP/ CSE

CS8492 – Database Management Systems 24