YEAR/SEM: II/IV BRANCH: CSE’A

CS3492
DATABASE MANAGEMENT SYSTEMS LABORATORY
QUESTION BANK
(EVEN Semester 2024-25)

Prepared by

Mrs. YASHEMA N (Asst. Professor)

Department of Computer Science and Engineering,
Kingston Engineering College.

CS3492 – Database Management Systems

1
 Year: 2024-25
UNIT I - RELATIONAL DATABASES
Sem.: EVEN

Subject Code : CS3492 Branch : CSE

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

UNIT – I RELATIONAL DATABASES

Purpose of Database System – Views of data – Data Models – Database System
Architecture – Introduction to relational databases – Relational Model – Keys –
Relational Algebra – SQL fundamentals – Advanced SQL features – Embedded SQL–
Dynamic SQL
Course Outcome 1 (CO1)
PART - A
1. Differentiate File processing system and Database processing system. (K2) (A/M’ 2024)
2. List some relational algebra operations. (K2) (A/M’ 2024)
3. Define foreign key with an example. (K1)(A/M’ 2023)
4. What is data definition language?(K1)(A/M’ 2023)
5. What are the main functions of a database administrator? (K2) (A/M’ 2024)
6. Give few SQL aggregate functions. (K1) (A/M’ 2024)

7. Relate/Define the terms data, database, and database management system. (K1) (N/D’ 2023)
8. What is the difference between logical and physical data independence. (K1) (N/D’ 2023)
9. What are the disadvantages of file processing systems? (K2) (A/M’ 2023)
10. List the applications of DBMS. (K1) (A/M’ 2023)
11. What are the categories of SQL command? (K2) (A/M’ 2023)
12. What is a candidate key and primary key? (K1) (A/M’ 2023)
13. List out the different types of data models. (K1) (A/M’2022)
14. What are the different types of integrity constraints in relational databases? (K2) (A/M’2022)
15. Differentiate primary key and foreign key. (K2) (N/D’2022)
16. List out various types of keys in the database? (K1)
17. Differentiate File processing system and Database processing system. (K2)
18. Define foreign key with an example. (K1)
19. What are relational algebraic operations? Give example. (K2)
20. What is Data manipulation language? (K1) (N/D’2021)
21. State/What the three levels of data abstraction. (K2) (A/M’21) (N/D’2022) (N/D’2021)
22. What is Metadata? (K1) (N/D’2021)
23. Draw the symbols used in an entity relationship diagram for representing an entity set, weak
entity set, attribute and multivalued attribute. (K2) (N/D’2021)
24. For a binary relationship set R between entity sets A and B, list the mapping cardinalities. (K4)
(N/D’2021)
25. What are the various types of keys in the database? (K2) (A/M’21)
26. Define functional dependency. (K1) (A/M’21) (N/D’2020)
27. List four significant differences between a file-processing system and a DBMS. (K2) (N/D’20)
28. What are the different types of Data Models? (K2) (N/D’20)
29. What is primary key constraint? (K1) (N/D’20)
30. Write the characteristics that distinguish the Database approach with the file-based approach.
(K1) (N/D’2020)
31. What is data definition language? (K1) (N/D’2020)
32. Differentiate between static and dynamic SQL. (K2) (N/D’2020)
33. Write the characteristics that distinguish the Database approach with the file-based approach.
(K1) (N/D’2020)
CS3492 – Database Management Systems
2
34. What are the four main characteristics that differentiate the database approach from the file
processing approach? (K2) (N/D’19)
35. Can a view define with other view. Explain with example. (K4) ((N/D’19)
36. Differentiate lossless join decomposition and lossy Join decomposition. (K2) (N/D’19)
37. Write short notes on Aggregate functions. Give examples. (K2) (N / D ’19)
38. What is the purpose of Database Management System? (K1) (N/D’14) (N/D’16)
39. List the disadvantages of file processing systems. (K2) (N/D’14) (N/D’16)
40. Define DBMS. (K1) (N/D’14)
41. Express in relational algebra, the division operation (/) using the project, Cartesian product and
minus operations. Give a simple example. (K2) (N/D’19)
42. List any eight applications of DBMS. (K2) (A/M’ 19)
43. State the three levels of data abstraction. (K2) (A/M’21)
44. What is a data model? What are the different types of data models? (K1, K2) (A/M’ 19)
45. Define relational database. (K1) (M/J’15)
46. What is data definition language? Give example. (K1, K2) (A/M’18) (N/D’16)
47. List four significant differences between a file-processing system and a DBMS. (K1) (M/J’15,
(N/D’16)
48. Write the characteristics that distinguish the Database approach with the file-based approach.
(K1) (A/M’15)
49. What are primary key constraints? (K2) (M/J’13)
50. Mention the six fundamental operations of relational algebra and their symbols. (Or) List the
operations in relational algebra. (K2) (N/D’12)
51. Distinguish the terms primary key and super key. (K2) (N/D’12) (M/J’14) (A/M’17)
52. What are the various types of keys in the database? (K2) (A/M’21)
53. What is the use of assignment operator in relational algebra with an example? (K1) (M/J’15)
54. What is the use of unique statement? (K1) (M/J’15)
55. Give an example of a join that is not a simple equi-join for which partitioned parallelism can be
used. (K3) (N/D’15)
56. In what way database users can be differentiated? (K2) (N/D’16)
57. What are the desirable properties of decomposition? (K2) (A/M’17)
58. Differentiate between Dynamic SQL and Static SQL. (K2) (N/D’14) (A/M’15) (N/D’15) (N/D’16)
59. Give a brief description on DCL command. (K2) (N/D’14)
60. Define: DDL, DML, DCL, and TCL. (K1) (A/M’15)
61. Name the categories of SQL commands. (K1) (M/J’16)
62. List out any two keys. (K2) (N/D’16)
63. Give the difference between ODBC and JDBC. (K2) (N/D’16)
64. What are the major drawbacks of File processing System? (K2) (N/D ’19)
65. What is meant by weak entity set? Explain with an example. (K1) (N/D ’19)
66. Who designed the first integrated DBMS? How it was called? (K1)
67. What is Sequel? (K1)
68. What is the name of the product released by IBM using Codd’s idea? (K1)
69. Who is the Father of Database Management Systems? (K1)
70. Who were the principal designers of original SQL specification? (K1)
71. Define relational algebra. (K1)
72. What do you mean by degree of a relation? (K1)
73. Define attribute. What are the types of attributes? (K1, K2)
74. Define the terms relation, tuple variable and domain. (K1)
75. What is a SELECT and PROJECT operation? (K1)
76. What is SQL? Write down the advantages. (K1)
77. Differentiate between Timestamp & Time Data type. (K1)
78. Write a short note on String operations. (K2)
79. List the various SQL data types. (K2)
80. Who described relational model? When? (K1)

CS3492 – Database Management Systems

3
 PART – B & C
1. What is data model? List its different types. Explain with suitable example. (K1)(A/M’ 2024)
2. Discuss about domain integrity. Give an example. (K2)(A/M’ 2024)
3. Explain the database management system architecture with a neat sketch. (K2)(A/M’ 2023)
4. (i) Outline select and project operations in relational algebra with an example. (K2)(A/M’ 23)
(ii) What is embedded SQL? Explain with an example.
5. Consider the following relations:
The primary key of each relation is underlined. Outline Cartesian product, equi join, left outer join,
right outer join and full outer join operations in relational algebra. Illustrate the above relational
algebra operations with the EMPLOYEE and DEPARTMENT relations. (15) (K3)(A/M’ 23)

6. Consider the following schemas. The primary key for each relation is denoted by the underlined
attribute. (K3)(N/D’ 2023)
LIVES (person-name, street, city)
WORKS (person-name, company-name, salary)
LOCATED-IN (company-name, city)
MANAGES (person-name, manager-name)
Write relational algebra expressions for the following queries:
(i) Find the name of all employees (i.e., persons) who work for the City bank company (which is a
specific company in the database).
(ii) Find the name and city of all employees who work for City Bank.
(iii) Find the name, Street and city of all employees who work for City bank and earn more than
$10,000.
(iv) Find all employees who live in the same city as the company they work for.
(v) Find all persons who do not work for City bank.
(vi) Find the second largest salary earned by the employee. (K3, K4) (N/D’ 2023)
7. Discuss the main categories of data models. What are the basic differences between the relational
model, the object model, and the XML model? (K2) (N/D’ 2023)
8. Describe the three-schema architecture. Why do we need mappings between schema levels? How
do different schema definition languages support this architecture? (K2, K3) (N/D’ 2023)
9. List and explain various DDL, DML and DCL commands in detail with examples. (K2)
(A/M’ 2023)
10. (i) Design a relational database for a university registrar’s office. The office maintains data
about each class, including the instructor, the number of students enrolled, the time and place of
the class meetings. For each student-class pair, a grade is recorded. (6) (K2)
(ii) Draw an ER diagram for the above specified relational database for a university registrar office.
(7) (K2) (A/M’ 2023)
11. (i) Explain the 3-schema architecture of DBMS. Why do we need mappings between different
schema level? (6) (K2)
(ii)Explain the architecture of DBMS. (7) (K2) (A/M’ 2023)
12. (i) Construct an E – R Diagram for a car insurance company whose customers own one or more
cars each. Each car has associated with it zero to any number of recorded accidents. (9)
(ii) Convert the designed E-R in to relational design. (4) (K2) (A/M’2022)
CS3492 – Database Management Systems
4
 13. Consider the schema (K2) (N/D’19) (M/J’15) (A/M’ 2023)
Suppliers (sid:integer, sname: string, address : string)
Parts (pid: integer, pname: string,color :string)
Catlog(sid:integer , pid:integer, cost:real)
The key fields are underlined, and the domain of each field is listed after the field name.
Therefore sid is the key for suppliers, pid is the key for Parts, and sid and pid together form the
key for catlog. The Catlog relation lists the prices charged for parts by Suppliers.
Write the queries in SQL
i. Find the names of suppliers who supply some red part
ii. Find the sids of suppliers who supply some red part and some green part
iii. Find the sids of suppliers who supply every red part or green part.
iv. Fine the sids of suppliers who supply some red part or at 221 packet street.
v. Find the pids of parts supplied by atleast two different suppliers
vi. Fine the sids of suppliers who supply every part.
14. Consider the following Schema: (K2) (A/M’23)
Flights (flno: integer, from: string, to: string, distance: integer, departs: time, arrives: times)
Aircraft (aid: integer, aname: string, cruisingrange: integer)
Certified (eid: integer, aid: integer)
Employees (eid: integer, ename:string, salary: integer)
Write appropriate SQL commands to solve the following queries:
(i) Find the eids of pilots certified for Boeing aircraft.
(ii) Fine the names of pilots certified for some Boeing aircraft.
(iii) Fined the aids of all aircraft that can be used on non-stop flights from Bonn to madras.
(iv) Identify the flights that can be piloted by every piolt whose salary is more than $100,000.
(v) Find the names of pilots who can operate planes with a range greater than 3,000 miles but are
not certified on any Boeing aircraft.
15. Illustrate the database system architecture with a neat diagram. (K2) (A/M’2022)
consider the relational database
employee(empname,street,city)
works(empname,companyname,salary)
company(companyname,city)
manages(empname,managername)
write each of the following queries in relational algebra and sql
16. Write each of the following queries in relational algebra and sql (A/M’2022)
i) Find the names,street addresses and cities of the all employees who work for Indian bank
corporation and earn more than 10 lakhs per annum. (2 + 2)
ii) Insert the tuple (‘siva’.gandhi street,Chennai) in the database.(2 + 1)
iii) Delete all employees who work for Indian Bank Corporation. (2+1)
iv) Give all the managers in this database a 15 % salary raise in the database. (2+1) (K2)
17. With a neat diagram, explain the components of database system architecture. (K2) (N/D’2022)
18. (i) Define relational algebra. Explain the basic operations in relational algebra. (6) (K2)
(ii) Explain the structure and features of relational databases. (7) (K2) (N/D’2022)
19. Present a relational database schema for a “Library Management System”. State the functional
requirements you are considering. (15) (K2) (N/D’2021)
20. What is query processing? Outline the steps involved in processing a query with a diagram. (13)
(K2) (N/D’2021)
21. (i) Outline the isolation levels specified by the SQL standard with an example. (8) (K2)
(ii) Outline the SQL statements used for transaction control. (5) (K2) (N/D’2021)
22. Outline equi-join, left outer join, right outer join and full outer join operations in relational
algebra with an example. (13) (N/D’2021)
23. Consider the following relations: EMPLOYEE (ENO, NAME, DATE_BORN, GENDER, DATE_JOINED,
DESIGNATION, BASIC_PAY, DEPARTMENT_NUMBER) DEPARTMENT (DEPARTMENT NUMBER,
NAME) Write SQL queries to perform the following:

CS3492 – Database Management Systems

5
(i) List the details of employees belonging to department number ‘CSE’. (2)
(ii) List the employee number, employee name, department number and department name of all
employees. (4)
(iii) List the department number and number of employees in each department. (3)
(iv) List the details of employees who earn less than the average basic pay of all employees. (4)
(K2) (A/M’2021)
24. State and explain the architecture of DBMS. Discuss about the people who deals with database.
(K2) (A/M’2021)
25. What are the several parts of SQL query language? What are the basic built in types used during
SQL create statement? State and given example for the basic structure of SQL queries. (K2)
(A/M’2021)
26. 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’2021)
27. Consider the following relations : Sailors (sid:integer, sname:string, rating:integer, age:real)
Boats (bid:integer, bname:string, color:string) Reserves(sid:integer, bid:integer, day:date) Write
the SQL statement for the following queries :
i) Find all sailors with a rating above 7. (3)
ii) Find the sids of sailors who have reserved a red boat. (3)
iii) Find the colors of boats reserved by lubber. (4)
iv) Find the names of sailors who have reserved at least one boat. (3) (K2) (A/M’2021)
28. Sketch the typical component modules of DBMS. Indicate and explain the interactions between
those modules of the system. (N/D’19) With suitable neat diagram, explain the database system
architecture. (N/D’16) (M/J’14) (or) Write about the structure of database system architecture
with block diagram. (M/J’16) (M/J’13) (M/J’15) (A/M’11) (A/M’10) (N/D’15) (A/M’17) (or)
29. State and explain the architecture of DBMS. Discuss about the people who deals with database.
(K2) (A/M’21)
30. Explain in detail about Relational Algebra, Domain Relational Calculus and Tuple Relational
Calculus with suitable examples. (K2) (N/D’2020)
31. Write the DDL, DML, DCL commands for the students database. Which contains student details:
name, id, DOB, branch, DOJ. Course details: Course name, Course id, Stud. id, Faculty name, id,
marks. (15) (K2) (N/D’2020)
32. Justify the need of embedded SQL. Consider the relation student (Reg. No., Name, mark and
grade). Write embedded dynamic SQL program in C language to retrieve all the student’s records
whose mark is more than 90. (K2) (N/D’2020)
33. i) Explain select, project and Cartesian product operations in relational algebra with an example.
ii) Construct an E-R diagram for a car insurance company whose customers own one or more cars
each. Each car has 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 data when the
payment was received. (10) (K2) (N/D’2020)
34. i) Write a note on SQL facilities. (8)
ii) With a neat sketch explain the states of a transaction. (8) (K2) (N/D’2020)
35. Explain the three-schema architecture with a neat diagram. (N/D’19) Briefly explain about views
of data. (16) (M/J’16)
36. Write short notes on Embedded SQL. Give example. (N/D’16) (or) Describe about the static and
dynamic SQL in detail. (K2) (A/M’2019)
37. Explain three different groups of data models with suitable examples. (A/M’ 19). Compare and
contrast various data models. (N/D’16) (or) Explain in detail about the different data models with
neat diagram. (K2) (N/D’12)
38. Consider the following scenario: (K2) (A/M 2018)
A university registrar’s office maintains data about the following entities:

CS3492 – Database Management Systems

6
(a) Courses, including number, title, credits, syllabus and prerequisites
(b) Course offerings, including course number, year semester section number, instructor, timing
and classroom
(c) Students, including student-id, name and program
(d) 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.
(i) Model an entity relationship diagram for the above scenario
(ii) Map the entity relationship diagram you have modeled to relations
39. Explain the select, project, Cartesian product and join operations in relational algebra with an
example. (K2) (A/M 2018)
40. Explain the aggregate function in SQL with an example. (K2) (A/M 2018)
41. What are the functions of database administrator? (6) (M/J’14) (or) Mention any four major
responsibilities of DBA. (4) (K2) (A/M’11)
42. (i) Write a note on database languages. (8) (K2) (M/J’14)(ii) Explain the distinctions among the
terms primary key, candidate key and super key. Give relevant examples. (5) (N/D’11)
43. (i) What is referential integrity? Give relevant example. (4) (K1) (N/D’11)
(ii) With relevant examples discuss the various operations in relational algebra. (K2) (N/D’11)
(M/J’14) (A/M’17)
44. (i) Discuss in detail about the major disadvantages of file-processing system. (6) (K2) (N/D’12)
(ii) A university registrar’s office maintains data about the following entities:
Courses, including number, title, credits, syllabus and prerequisites;
Course offerings, including course number, year, semester, section number, instructor, timings
and classroom;
Students, including student-id, name and program; and Instructors, including identification
number, name, department and title. Further, the enrollment of students in course and grades
awarded to students in each course they are enrolled for must be appropriately modeled.
Construct an E-R diagram for the registrar’s office. Document all assumptions that you make
about the mapping constraints. (10) (K2) (N/D’12)
45. Explain the advantages and disadvantages of DBMS. (8) (K2)
46. Explain E.F.Codd rules.(Or) Explain in detail on the Codd’s rule on relational database.(5) (K2)
(N /D ’19)
47. (i) Give a note on any 10 database terminologies. (K2)
(ii) Write the following queries in relational algebra and SQL.
(a) Find the names of employees who have borrowed a book published by McGraw-Hill. (5)
(b) Find the names of employees who have borrowed all books published by McGraw-Hill. (5) (K3)
(A/M’17)
48. Consider a student registration database comprising of the below given table schema. (K3)
(A/M’15)
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 sample of tuples/records for the above-mentioned tables and write DML
statements (SQL) to answer for the queries listed below:
(i) Which courses does a specific professor teach?
(ii) What courses are taught by two specific professors?
(iii) Who teaches a specific course and where is his/her office?

CS3492 – Database Management Systems

7
(iv) For a specific student number, in which courses is the student registered and what is his/her
name?
(v) Who are the professors for a specific student?
(vi) Who are the students registered in a specific course?
49. (i) Write different SQL facilities for recovery. (8) (K2) (M/J’15)
(ii) Explain about SQL Fundamentals. (8) (K2) (M/J’16) (or) Briefly explain about fundamental,
additional operations in SQL with example.
50. (i) Explain about Data Definition Language (DDL). (8) (K2) (M/J’16)
(ii) What are the several parts of SQL query language? What is the basic build in types used during
SQL crate statement? State and given example for the basic structure of SQL queries. (K1, K2)
(A/M’21)
51. Explain the following with examples:
(i)DDL
(ii)DML
(iii) Embedded SQL. (K2) (N/D’14)
52. (i) Write short notes on Advanced SQL features. (5) (K2)
(ii) Describe the six clauses in the syntax of an SQL query, and show what type of constraints can be
specified in each of the six clauses. Which of the six clauses are required and which are optional?
(8) (K2) (N/D’15)
53. Assume the following table: (K2) (N/D’15)
Degree (degcode, name, subject)
Candidate (seatno, degcode, name, semester, month, year, result)
Marks (seatno,degcode, semester ,month,year,papcode,marks)
Degcode-degree code, Name-name of the degree (M.Sc, M.Com)
Subject –subject of the course Eg. Phy, Pap code- paper code eg.A1.
Solve the following queries using SQL.
i) Write a SELECT statement to display all the degree codes which are there in the candidate table
but not present in degree table in the order of degree code. (4)
ii) Write a SELECT statement to display the name of all the candidate who have got less than 40
marks in exactly 2 subjects.(4)
iii) Write a SELECT statement to display the name, subject and number of candidate for all degree in
which there are less than 5 candidates. (4)
iv) Write a SELECT statement to display the name of all the candidate who have got highest total
marks in M.Sc. (4)
54. (i) Discuss about various SQL data types. (8) (K2)
(ii) Explain briefly about the database objects in detail with an example. (8) (K2)
55. Justify the need of Embedded SQL. Consider the relation student (Reg No, name, mark and
grade). Write embedded dynamic SQL program in C language to retrieve all the student’s record
whose mark is more than 90. (K2) (A/M’17)
56. Consider the following relations : (K2) (A/M’21)
Sailors (sid:integer, sname:string, rating:integer, age:real)
Boats (bid:integer, bname:string, color:string)
Reserves(sid:integer, bid:integer, day:date)
Write the SQL statement for the following queries:
i) Find all sailors with a rating above 7. (3)
ii) Find the sids of sailors who have reserved a red boat. (3)
iii) Find the colors of boats reserved by lubber. (4)
iv) Find the names of sailors who have reserved at least one boat. (3)

CS3492 – Database Management Systems

8
 Year: 2024-25
UNIT II - DATABASE DESIGN
Sem: EVEN

Subject Code : CS3492 Branch : CSE

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
Course Outcome 2 (CO2)
Normal Form – Join Dependencies and Fifth Normal Form

Course Outcome 2 (CO2)

PART - A
1. Define Entity, Relationship and attributes in ER model. (A/M’ 2024)
2. Why BCNF is preferred over 3NF? (A/M’ 2024)
3. What is an derived attribute? Give example. (A/M’ 2023)
4. What is functional dependency? Give example. (A/M’ 2023)

5. What is lossless decomposition? Give examples. (K1) (A/M’ 2024)

6. Give an example for a week and a strong entity. (K2) (A/M’ 2024)
7. Define functional dependency. (K1) (N/D’2020) (N/D’ 2023)
8. What is the maximum number of super keys for the relation schema R (E, F, G, H) with E as the
key attribute? Write all such possible super keys. (K1, K4) (N/D’ 2023)
9. Transform the following ER diagram into a relational schema diagram. (K4) (N/D’ 2023)

10. List the desirable properties of decomposition. (K2) (A/M’ 2023)

11. What is meant by normalization of data? (K1) (A/M’ 2023)
12. Define join dependency. (K1) (A/M’2022)
13. What are the various types of attributes in ER model? (K2) (N/D’2022)
14. Name the types of locks. (K2) (N/D’2022)
15. State the types of attributes in E-R model. (K2) (A/M’2021)
16. What is E-R diagram? (K1) (A/M’2021)
17. How do you estimate the cost of Hash function? How do you differ from hybrid Hash function?
(K2) (N/D’19)
18. Give the properties of decomposition. (K1) (A/M’19) (OR) What is meant by lossless-join
decomposition? (A/M’11) (OR) Define non-loss decomposition. (N/D’16)
19. Define the terms Entity set and Relationship set. (A/M’19) (OR) What is an entity? (K1) (M/J’14)
20. What is weak entity? Give example. (K1) (A/M 2018)
21. Define a foreign key. Give example. (K1) (A/M 2018)

CS3492 – Database Management Systems

9
22. Explain entity relationship model. (K2) (M/J’16)
23. State the anomalies of 1NF. (K2) (N/D’15).
24. Is it possible for several attributes to have the same domain? Illustrate your answer with suitable
examples. (K3) (N/D’15).
25. Define functional dependency. (or) Write a note on functional dependencies. (K1) (A/M’15)
(A/M’10) (N/D’13) (A/M’21)
26. Why 4NF in Normal Form is more desirable than BCNF? (K4) (N/D’14)
27. Define trivial functional dependency. (K1) (N/D’13)
28. Define Boyce-Codd normal form. (K1) (M/J’13) (M/J’15)-R 2008
29. Define normalization. What is the need for normalization? (K1, K2) (M/J’13) (M/J’15) (A/M’10)
30. Give example for one to one and one-to-many relationship. (K2) (M/J’13)
31. How good is BCNF? (K2) (N/D’16)
32. Define trivial functional dependency. (K1) (N/D’13)
33. Define multi valued dependency. (K1) (N/D’12)
34. Show that, if a relational database is in BCNF, then it is also in 3 NF. (K4) (N/D’12)
35. 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)
36. Why are certain functional dependencies called as trivial functional dependencies? (K2) (A/M’12)
37. A relation {A, B, C, D} has FD’s F= {AB->C, C-> D, D -> A}. Is R is in 3NF? (K3) (A/M’11)
38. 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? (K3) (N/D’11)
39. 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? (K3, K5) (N/D’11)
40. With an example explain what a derived attribute is? (K2) (N/D’11)
41. Define irreducible sets of dependencies. (K1) (N/D’10)
42. Define the third normal form. (K1) (N/D’10)
43. What is data modeling? Who popularized the E-R model? (K1, K2)
44. Who is the father of ER Model? (Or) Who invented ER diagram? (K1)
45. Define normal forms. Explain the types. (K1, K2)
46. What is join dependency, full functional dependency and partial functional dependency? (K1)

PART – B & C
1. What is normalizations? List its benefits and explain briefly about 3NF, 4NF and BCNF with
suitable example. (K1)(A/M’ 2024)
2. (i)Illustrate functional dependency with an example.(7) (K2)(A/M’ 2024)
(ii) Discuss about dependency preservation.(6) (K2)(A/M’ 2024)
3. Consider the following relational schemes for a library database: (K3)(A/M’ 2024)
Book (Title, Author, Catalog_no, Publisher, Year, Price)
Collection (Title, Author, Catalog_no) the following are functional dependencies:
(i) Title Author Catalog_no
(ii) Catalog_no Title Author Publisher Year
(iii) Publisher Title Year → Price
(iv)Assume (Author Title) is the key for both schemes. Apply the appropriate normal form for Book
and Cancellation?
4. Elaborate on first normal form, second normal form and third normal form with examples.
(K2)(A/M’ 2023)
5. Explain Boyce Codd normal form, fourth normal form and fifth normal form with examples.
(K2)(A/M’ 2023)
6. A Company is organized into departments. Each department has employees working in it. The
attributes of department include department number and department name.

CS3492 – Database Management Systems

10
 The attributes of employee include employee number, employee name, date of birth, gender,
date of joining, designation and basic pay. Each department has a manager managing it. There
are also supervisors 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 work in any number of distinct
projects on a day. The date an employee worked, in time and out time has to be kept track. The
company also keeps track of the dependents of each employee. The attributes of dependent
include dependent name, date of birth, gender and relationship with the employee.
(i) Model an Entity Relationship diagram for the above scenario.(7)
(ii) Map the Entity Relationship diagram you have modeled to relations.(8) (K3)(A/M’ 2023)

7. Consider the relation for car dealership given below.

Dealership (Unique_id, Customer-name, Purchase, Address, Newsfeed, Supplier, Price)
Normalize the table so that all resulting tables are in 3NF stating the definitions of various normal
forms. (K3) (N/D’ 2023)
8. Construct an E-R diagram for university database with the following information:
Professors have an SSN (Social Security Number), a name, an age, a rank, and a research
specialty. Projects have a project number, a sponsor name, a starting date, an ending date and a
budget. Graduate students have an SSN, a name, an age, and a degree program. Example: M.S
or Ph.D. Each project is managed by one professor. Each project is worked by one or more
professors, Professors can manage and/or work on multiple projects. Each project is worked by
one and more graduate students (known as the project research Assistants).
Design/Draw an ER diagram that captures the full information about the university. Use only the
basic ER model, here, that is, entities, relationships, and attributes. Be sure to indicate any key
and participation constraints, with underlines and arrows. (K2, K3) (N/D’ 2023)
9. Explain in brief about Subqueries and Correlated queries. (K2) (A/M’ 2023)
10. Explain various normal forms in database management systems which are required for
fulfilling normalization requirements of an organization. (K2) (A/M’ 2023)
11. Explain in detail, the Closure of set of Functional dependency and Closure of Attribute sets.
12. (i) 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. (8) (K3) (A/M’2022)
13. Explain the fourth normal form with an example. (5) (K2) (A/M’2022)
14. 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?
15. Why 3NF is preferable than? (K3) (A/M’2022)
16. Explain the concept of Functional Dependency with suitable example. (6) (K2)
17. Write a brief note on extended ER features. (7) (K2) (N/D’2022)
18. Give suitable example for Multivalues dependencies and join dependencies. (6) (K2, K3)
19. Compare and contrast 1NF, 2NF and 3NF with suitable example. (7) (K2) (N/D’2022)
20. What are the building blocks of an ER diagram? Draw the ER diagram for Railway Reservation
System. (K2) (N/D’2022)
21. Consider the following database schema.
Book (B_id, B_name, B_author, B_publisher)
Student (S_id, S_name, S_dept, S_gender)
Borrow (B_id, S_id, date)
Justify whether the given database schema is in normalized structure. (5)
22. Solve the following using both Relational Algebra and SQL. (10)
Print the name of the ‘female’ student who borrowed DBMS book.
CS3492 – Database Management Systems
11
 Print the name of the student who got books on 04.03.2022.
Print the name of the book which was borrowed by both male and female student.
How many students have taken books on 12.03.2022.
Print the name of the authors and no. of books they have written. (K3, K4, K5) (N/D’2022)
23. 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) (K3)
24. 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) (K4) (N/D’2021)
25. 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) (K3, K4)
26. Model an E-R diagram for a car-insurance company whose customers own one or more cars
each. Each car has associated with it zero to any number of recorded accidents. State any
assumptions you make. (4) (K3) (N/D’2021)
27. State the Armstrong axioms. (6) (K2)
28. Define BCNF and justify a relation R with two attributes is in BCNF. (7) (K1, K2) (N/D’2021)
29. 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. (K2, K4) (A/M’2021)
30. 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 normalize it completely? (16) (K3, K4)
(N/D’2020)
31. Explain first normal form, second normal form, third normal form and BCNF with an example.
(K2) (N / D ’20)
32. What is meant by semantic query optimization? How does it differ from other query
optimization technique? Give example. (K1, K2) (N / D ’20)
33. Explain the principles of (i) Loss less join decomposition. (5)
(ii)Join dependencies. (5) (iii) Fifth normal form. (6) (K2) (N / D ’20)
34. Discuss in detail the steps involved in the ER-to-Relational mapping in the process of relational
database design. (7) (K2) (N / D ’19)
35. Exemplify the multi-value dependency and fourth normal form 4NF. (6) (K2) (N / D ’19)
36. Explain with suitable example, the constraints of specialization and generalization in ER data
modeling, (7) (K2) (N / D ’19)
37. Exemplify the join dependency and fifth normal form 5NF. (6) (K2) (N / D ’19)
38. Prove the statement “When the column of a view is directly derived from a column of the base
table” by using suitable example. (K3) (N / D ’19)
39. i) Write an algorithm to find closure of functional dependents. (5) (K1) (A/M’21)
ii) Compute the closure of the following set F of functional dependencies for relation schema
R = (A, B, C, D, E) (10) (K3, K4) (A/M’21)
A → BC, CD → E, B → D, E → A List the candidate keys for R.

CS3492 – Database Management Systems

12
40. 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 (1st, 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, K2) (N/D’14) (A/M’12) (A/M’11) (A/M’10)
(M/J’14) (N/D’16)
41. 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)
42. What is database normalization? Explain first normal form, second normal form and third normal
form with an example. (K1, K2) (A/M 2018)
43. 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)
44. 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. (K3, K4) (A/M’15)
45. Write short notes on:
(i)Data model and its types (8)
(ii)E-R Diagram for Banking System (8) (K2) (N/D’14)
46. Draw an E-R diagram corresponding to customers and loans. (K3) (M/J’14)
47. Explain Boyce Codd Normal Form & Fourth Normal Form with example. (K2) (M/J’14)
48. Describe about multi-valued dependencies and fourth normal form with suitable example. (K2)
49. What is redundant data? What are the problems caused by redundant data? (6) (K1, K2)
50. Explain the process of normalization from 1NF to BCNF stage with example. (10) (K2) (N/D’13)
(M/J’15)-R2008
51. Consider the following relation:
CAR-SALE (Car no, Data-Sold, Salesman no, Commission %, Discount-amount)
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? (K3) (M/J’13)
52. Explain the purpose of database system. (K2) (M/J’13)
53. Explain the principles of: (K2) (M/J’13)
a. Loss less join decomposition b. Join dependencies c. Fifth normal form
54. Draw an E-R diagram for a banking enterprise with almost all components and explain. (K3)
(A/M’12) (M/J’15)
55. Consider the following relation R(A,B,C,D,E) with functional dependencies.
{ABC, CDE, BD, EA}, Identify super keys. Find Fc, F+. (K4) (M/J’15)
56. Construct an ER model for the car rental company database. (K2) (N/D’15)
57. Explain select, project & Cartesian product operations in relational algebra with an example. (6
58. 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) (7) (N/D’16)

CS3492 – Database Management Systems

13
 59. 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)
60. Explain briefly about the various types of Attributes. (K2)
61. Explain briefly about the types of Functional Dependency. (K2)
62. Explain about the properties / Inference Rules applied on FD. (K2)

Year: 2024-25
UNIT III - TRANSACTIONS
Sem.: EVEN

Subject Code : CS3492 Branch : CSE

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

UNIT – III TRANSACTIONS

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.

Course Outcome 3 (CO3)

PART - A
1. List the properties of transactions. (K1)(A/M’24)
2. How will you handle deadlock during two transactions in database? (K3)(A/M’24)
3. Define serializability. (K1)(A/M’23)
4. Name the four conditions for deadlock. (K1)(A/M’23)
5. What is a cascadeless schedule? Why is cascadelessness of schedules desirable? (K1)(A/M’24)

6. What benefit does script two-phase locking provide? What disadvantages result?(K2)(A/M’24)
7. What are the ACID properties? (Or) State ACID Properties. Define the properties of Transaction
(Or) List ACID properties. (K2) (N/D’ 2023) (A/M’ 2023) (M/J’13, A/M’11, N/D’10, A/M’10,
A/M’15). (N/D’14, M/J’16)
8. What the problems of executing two concurrent transactions. (K2) (N/D’ 2023)
9. What are the different modes of lock? (K2) (A/M’ 2023)
10. List out the timestamp-based deadlock prevention schemes. (K2) (A/M’2022)
11. what is the use of save points in recovery. (K1) (A/M’2022)
12. Draw the diagram that represents transaction states. (K2) (N/D’2022)
13. Name the types of lock. (K2) (N/D’2022)
14. What are serializable schedules? (K2) (N/D’2021)
15. Name the four conditions for deadlock. (K2) (N/D’2021)
16. List the ACID properties and its usefulness. (K2) (A/M’2021)
17. What benefit does strict two-phase locking provide? What are the disadvantages of it? (K2)
(A/M’2021)
18. What is serializable schedule? (K1) (N/D’2020)
19. What type of locking needed for insert and delete operations? (K2) (N/D’2020)
20. Name the first transaction processing system and write the difference between SABRE and OLTP.
21. Brief about consistency in transaction. (K2)
22. What is a live lock? (K1)
23. Define durability. (K1)
24. What are the different transaction states? (Or) What are the states of transaction? (K2) (A/M’19)
25. What is meant by log-based recovery? (K1) (A/M’19)
26. When was the first transaction processing software developed and by which company? (K2)
CS3492 – Database Management Systems
14
27. State the difference between a shared lock and an exclusive lock. (K2) (A/M 2018)
28. List the ACID properties and its usefulness. (K2) (A/M’21)
29. What is Serializability? How it is tested? (K1) (N/D’14) (M/J’14) (N/D’16) (A/M 2018)
30. Define Deadlock. (K1) (M/J’14)
31. Define about cascading rollback. (k1) (N/D’13)
32. What is a rigorous two-phase locking protocol? (K1) (N/D’13)
33. Define two phase locking. (K1) (M/J’13)
34. State the write-ahead log rule. Why is the rule necessary? (K2) (N/D’12)
35. Differentiate strict two-phase locking protocol and rigorous two-phase locking protocol. (K2)
36. What benefit does strict two-phase locking provide? What disadvantages result? (K2)
(A/M’12)(A/M’21)
37. List the two commonly used concurrency Control techniques. (k2) (N/D’11)
38. List the SQL statements used for transaction control. (K2) (N/D’11)
39. What are two pitfalls (problems) of lock-based protocols? (K2) (A/M’11)
40. What are the three kinds of intent locks? (K2) (N/D’10)
41. What do you mean by a transaction? (K1) (A/M’10)
42. What is meant by conflict serializable schedule? (Or) What is a serializable schedule? (K1)
43. What is deadlock prevention? (K1)
44. What is meant by concurrency control? (K1) (N/D’15)
45. Give an example of two-phase commit protocol. (K2) (N/D’15)
46. List the four conditions for deadlock. (K2) (N/D’16)
47. What type of locking needed for inserts and delete operations? (K2) (A/M’17)

PART-B & C
1. Demonstrate conflict serializability and view serializability. (K2) (A/M’2024)
2. (i)Discuss in detail about Multiple Granularity.(7)
(ii) Explain different types of locks.(6) (K2)(A/M’2024)
3. (i)What is a transaction? List and explain ACID properties with an example. (6)
(ii) Outline the two phase locking protocol with an example.(7) (K2)(A/M’2023)
4. What is recovery? Outline the steps in the Algorithm for Recovery and Isolation Exploiting
Semantics (ARIES) algorithm with an example.(13) (K2)(A/M’2023)

5. Consider the below schedule for three transactions. R indicates a read of a page, W indicates a
write of a page, and COM indicates a commit.
(i) Draw the arrows for the dependency graph for this schedule. (4)
(ii) Is the schedule conflict serializable? Explain Conflict Serializable. (6)
(iii) Which of the following changes to the above schedule will result in a schedule that is
possible using strict two-phase locking? (5) (K3, K4) (N/D’ 2023)

T1 R(A) R(C) W(B) COM

T2 R(A) W(A) COM
T3 R(A) R(C) W(B) COM
6. Explain the concept of serial, non-serial and conflict-serializable schedules with example. (K2)
(N/D’ 2023)
7. Explain in detail two-phase locking and how does it guarantee serializability. (Or) What is the
two-phase locking protocol? How does it guarantee serializability? Explain with an example. (K2)
(N/D’ 2023) (A/M’ 2023) (N /D ’19) (N/D’11, A/M’11, M/J’14)
8. Discuss the concurrency control mechanisms in detail using suitable example. (K2) (A/M’ 2023)
9. Explain the two-phase locking protocol for concurrency control. (K2) (A/M’2022)
10. Consider the following two transaction
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) (K4)

CS3492 – Database Management Systems

15
11. 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, K3)
(A/M’2022)
12. (i) Define Transaction. Explain the desirable properties of a transaction. (K1. K2) (N/D’2022)
(ii) Briefly discuss about the different deadlock prevention schemas. (K2) (N/D’2022)
13. (i) Discuss the role of two-phase locking protocol for concurrency control. (K2) (N/D’2022)
(ii) With suitable example, explain the concept of conflict serializability. (K2) (N/D’2022)
14. (i) What is a transaction? Draw the state diagram corresponding to a transaction and present an
outline of the same. (8) (K1, K2)
(ii) Outline the properties that must be satisfied by a transaction. (5) (K2) (N/D’2021)
15. State and explain the transaction isolation level. (K2) (A/M’2021)
16. What are the two approaches of deadlock prevention? Explain in detail with suitable example.
(K2) (A/M’2021)
17. Define Transaction. Represent the transaction states and explain the various desirable properties
of the transactions. (K1, K2) (A/M’2021)
18. Explain the Two-phase commit and Three-phase commit protocols. (K2) (N/D’2020) (A/M’15)
19. 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, K4) (N/D’2020)
20. (i) Narrate the actions that are considered for deadlock detection and the recovery from
deadlock. (9) (K2) (N / D ’19)
(ii) Discuss the properties of a transaction that ensure integrity of data in the database system.
21. Elaborate on the following
(i) Two phase locking protocol. (7)
(ii) Graph based protocol (6) (K2) (N / D ’19) (N/D’2020)
22. Explain concurrency control and deadlock in relation to databases with examples. (K2) (N/D ’19)
23. What is concurrency control? How it is implemented in DBMS? Briefly elaborate with suitable
diagrams and examples. (K1, K2) (A/M’19)
24. Explain in detail about the ACID properties of a transaction. (K2) (A/M’19) (N/D’2020)
25. Discuss in detail about the testing of serializability. (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)
26. 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. (8)
(K2) (A/M’11)
27. (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)
28. What is concurrency control? Explain the two-phase locking protocol with an example. (K2)
(A/M’18) (N/D’14)
29. 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 schedules? (2)

CS3492 – Database Management Systems

16
 (ii) Is the schedule conflict - Serializable? If so, what are all the conflict equivalent serial
Sschedules? (7)
(iii)Is the schedule view-serializable? If so, what are all the view equivalent serial schedules? (7)
(K3) (A/M’15)
30. Write short notes on: (K2) (N/D’14)
(i) Transaction concept (ii) Deadlock
31. 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. (4) (N/D’13)
32. 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)
33. State and explain the transaction isolation level. (A/M’21)
34. Explain about locking protocols. (K2) (M/J’16)
35. Illustrate dead lock and conflict serializability with suitable example. (K2) (M/J’13) (M/J’15)
36. Explain two phase commit protocol. (K2) (M/J’13) (M/J’15) (M/J’16)
37. (i) Explain different locking mechanism used in lock-based concurrency control. (10) (K2)
(ii) Explain validation-based protocol with an example. (6) (K2) (N/D’13)
38. What is the difference between conflict serializability and view serializability? Explain in detail
with an example. (K2) (N/D’13) (N/D’15)
39. Discuss in detail about transaction concepts and two-phase commit protocol. (K2) (N/D’12)
40. Write down in detail about intent locking and isolation levels. (K2) (N/D’12)
41. Discuss in detail about transaction recovery, system recovery and media recovery. (K2) (A/M’12)
42. Write down in detail about deadlock and serializability. (K2) (A/M’12)
43. (i) Define a transaction. Then discuss the following with relevant examples:
a. A read only transaction b. A read write transaction c. An aborted transaction. (12) (K2)
(ii) Explain the distinction between the term’s serial schedule and serializable schedule. Give
relevant example. (4) (K2) (N/D’11)
44. Describe about the deadlock prevention schemes. (Or) What are the two approaches of deadlock
prevention? Explain in detail with suitable example. (K2) (A/M’21) (A/M’11)
45. (i) State the two-phase commit protocol. Discuss the implications of a failure of the coordinator
and some participants. (10) (K2) (N/D’10)
(ii) Briefly explain transaction recovery with primitive operations. (6) (K2) (N/D’10)
46. (i) State and explain the three concurrency problems. (9) (K2) (N/D’10)
(ii) What is meant by isolation level and define the five different isolation levels. (7) (K2)
(N/D’10)
47. (i) How can you implement atomicity in transactions? Explain. (8) (K4) (A/M’10)
(ii) How concurrency is performed? Explain the protocol that is used to maintain the concurrency
concept. (K1, K2) (A/M’10) (N/D’15)
48. Explain multiple update problem and uncommitted dependency problems. Give examples for
each. (K2)
49. (ii) Discuss about locking and concurrency problem. Also write a note on concurrency protocols.
(K2) (N/D’16)
50. What is deadlock? How does it occur? How transactions be written to:
i) Avoid deadlock
ii) Guarantee correct execution (K2) (N/D’15)
51. (i) Illustrate two phase locking protocol with an example. (6) (K2)
(ii) Outline deadlock handling mechanisms. (7) (K2) (N/D’16)
52. (i) 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. (8) (K4)
(ii) Show that the protocol ensures serializability and deadlock freedom. (7) (K2) (N/D’16)

CS3492 – Database Management Systems

17
 53. (i) 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? (6) (K2) (N/D’16)
54. Discuss the violations caused by each of the following: dirty read, non-repeatable read and
phantoms with suitable example. (K2) (A/M’17)
55. 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: 2024-25
UNIT IV - IMPLEMENTATION TECHNIQUES
Sem.: EVEN

Subject Code : CS3492 Branch : CSE

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 operations – Query optimization using Heuristics - Cost Estimation.

Course Outcome 4 (CO4)

PART - A
1. What is hash based indexing? (K1) (A/M’2024)
2. List three components of Query processor. (K2) (A/M’2024)
3. Outline the need for indexing. (K2) (A/M’2023)
4. What is a hash function? Give example. (K1) (A/M’2023)

5. What is scrubbing, in the context RAID systems, and why is scrubbing important? (K1)
(A/M’2024)
6. Why might the leaf nodes of a B+-tree file organization lose sequentially? (K3)(A/M’2024)
7. Define B+ trees. (K1) (N/D’ 2023)
8. When it is preferable to use a dense index rather than a sparse index. (K4) (A/M’2022)
9. What are the steps involved in query processing. (K2) (A/M’2022)
10. State the difference between B tree and B+ tree. (K2) (N/D’2022)
11. Define index. (K1) (N/D’2022)
12. What are the factors needed to evaluate the technique of ordered indexing and hashing? (K2)
13. State the storage device hierarchy. (K2) (A/M’21)
14. Name the two basic kinds of indices. (K1) (N/D’2021)
15. Differentiate static and dynamic hashing. (K2) (N/D ’2020)
16. Give an example of a join that is not a simple equi-join for which partitioned parallelism can be
used. (K2) (N/D ’2020)
17. Compare and Contrast Range Partitioning and Hash Partitioning. (K2) (N/D ’19)
18. Define dense index. (K1) (A/M’19)
CS3492 – Database Management Systems
18
19. Mention all the operations of files. (K2) (A/M’19)
20. What is a hash function? Give example. (K1, K2) (A/M 2018)
21. Outline the steps involved in query processing. (K2) (A/M 2018)
22. What is a query execution plan? (K1) (A/M’17)
23. Define replication transparency. (K2) (A/M’17)
24. Which cost components are used most often as the basis for cost function? (K3) (A/M’17)
25. What do you mean by data mart? State the function of data marts. (K1, K2) (A/M’17)
26. State the need for Query Optimization. (K2) (A/M’15)
27. Define query. (K1) (N/D’13)
28. What is Query Optimization? Write down the basic steps. (K1, K2) (A/M’15) (M/J’16)
29. What is mean by garbage collection? (K1) (M/J’16)
30. Define software and hardware RAID systems? (K1) (M/J’16)
31. List out the mechanisms to avoid collision during hashing. (K2) (N/D’16)
32. What are the disadvantages of B-Tree over B+ Tree? (K2) (N/D’16)
33. Why does SQL allow duplicate tuples in a table or in a query result? (K2) (N/D’15)
34. Write about the four types (Star, Snowflake, Galaxy and Fast constellation) of data warehouse
schemas. (K2) (A/M’15)
35. Differentiate between Static and Dynamic Hashing. (K2) (N/D’14, A/M’15, N/D’15)
36. Define Data Mining and Data Warehousing. (K1) (N/D’14)
37. What are ordered indices? (K2) (N/D’11, M/J’14, M/J’15)
38. What is slotted page sheet? Draw the diagram. (K1, K2) (N/D’13) (M/J’15)
39. What is the content of update log record? (K1) (N/D’13) (M/J’15)
40. What is the need for RAID? (K1) (M/J’13)
41. What is the basic difference between static hashing and dynamic hashing? (K1) (M/J’13)
42. What can be done to reduce the occurrence of bucket overflows in a hash file organization? (K2)
43. How might the type of index available influence the choice of a query processing strategy? (K2)
44. Mention the different hashing techniques. (K2) (A/M’12)
45. When is it preferable to use a dense index rather than a sparse index? Explain your answer. (K4)
46. Distinguish between sparse index and dense index. (K2) (N/D’11)
47. What are the advantages and disadvantages of indexed sequential file? (K2) (A/M’11)
48. Which are the factors to be considered for the evaluation of indexing and hashing techniques?
(K2) (N/D’10)
49. What are the advantages of distributed database? (K2) (N/D’04, A/M’08)
50. Define: Hash join, Merge join, Nested-loop join. (K1)
51. Who invented SQL? Write the needs. (K2)
52. Who invented the concept of RAID? (K2)
53. What is called bit - level and block – level striping? (K1)
54. What are the two main goals of parallelism? (K2)
55. Distinguish between fixed length records and variable length records. (K2)
56. What is known as heap file organization? (K1)
57. What is known as clustering file organization? (K1)
58. What is known as a search key? (K1)
59. What is B-Tree? (K1)
60. Define mobile and web database. (K1)
61. Write a note on multidimensional and parallel databases. (K2)
62. Define mobile database with an example. (K1)
63. What are the applications of spatial data? (K2)
64. Define spatial database. (K1)
65. What is an intra query parallelism? (K1)
PART – B & C
1. Explain B+ trees. Discuss about this Dynamic Index Structure. (K2)(A/M’24)
2. Compare I/O costs for all File Organizations. (K2)(A/M’24)
3. Consider a B+-tree in which the maximum number of keys in a node is 5. Calculate the minimum
number of keys in any non-root node. (K3)(A/M’24)
CS3492 – Database Management Systems
19
4. (i)Outline B tree index and B+ tree index with an example.(6) (K2)(A/M’23)
(ii)Explain static hashing with an example.(7) (K2)(A/M’23)
5. What is query processing? Elaborate about the steps in query processing with a diagram.
(K2)(A/M’23)

6. Construct a B+ tree for the following set of key values: (K3) (N/D’ 2023) (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.
7. (i) Brief on Static and Dynamic hashing. (7) (K2)
(ii) Suppose that we are using extendable hashing on a file that contains records with the
following search-key values: (2, 3, 5, 7, 11, 17, 19, 23, 29, 31)
Show the extendable hash structure for this file if the hash function is h(x) = x mod 8 and
buckets can hold three records. (7) (K3) (N/D’ 2023)
8. 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)
9. 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, K4) (A/M’2022)
10. (i) With a neat diagram, discuss about the various RAID levels. (6) (K2) (N/D’2022)
(ii) Explain various types of indices with relevant example. (7) (K2) (N/D’2022)
11. (i) With the neat diagram, explain the steps involved in query processing. (6) (K2) (N/D’2022)
(ii) Compare and contrast the features of static and dynamic hashing. (7) (K2) (N/D’2022)
12. 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. (K3) (A/M’2021)
13. (i) Outline the factors used to evaluate indexing and hashing techniques. (5) (K2)
(ii) What is an index record? Outline dense index and sparse index with an example. (8) (K1, K2)
(N/D’2021)
14. Describe the procedure for index update for single level indices with example. (K2) (A/M’2021)
15. Explain dynamic hashing with example. (K2) (A/M’2021)
16. Describe the procedure for index update for single level indices with example. (K2) (A/M’21)
17. Explain dynamic hashing with example. (K2) (A/M’21)
18. Explain about distributed databases and their characteristics, functions and advantages and
disadvantages. (K2) (N/D’2020)
19. i) What is RAID? List the different levels in RAID technology and explain its features. (8) (K1,K2)
ii) Illustrate indexing and hashing techniques with suitable examples. (5) (K2) (N/D’2020)
20. What is RAID? Briefly explain different levels of RAID. Discuss the factors to be considered in
choosing a RAID level. (K1, K2) (N/D’2020) (A/M’19) (N/D’16) (N/D’19)
21. Explain types of database security and database security issues. (K2) (N/D’2020)
22. Why data dictionary storage is important? (K1) (N/D’19)
23. (i) With simple algorithms explain the computing of Nested-loop join and Block Nested-loop join.
(10) (K2)
(ii) Sketch and concise the basic steps in Query Processing. (3) (K2) (N/D’19)
24. Describe the structure of B+ tree and give the algorithm for search in the B+ tree with example.
(K2) (A/M’19)
25. Discuss about the join order optimization and heuristic optimization algorithms. (K2) (A/M’15)
26. Give a detailed description about Query Processing and Optimization. Explain the cost estimation
of Query Optimization. (K2) (N/D’14)

CS3492 – Database Management Systems

20
27. With a help of a neat diagram, explain the basic steps involved in processing a query. (K2)
(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? (N/D’05, M/J’07)
28. 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 (K2) (M/J’05) (N/D’07)
29. Explain how the query is optimized. (K2) (M/J’05) (or) What are the steps involved in query
processing? How is the execution of a query optimized? (M/J’06)
30. Explain the Heuristic and cost estimation query optimization techniques in detail. (K2) (N/D’16)
31. What is a join? Explain the types of join. Give one example of each join operation. (K1, K2)
32. 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. Estimate the number of blocks transfers and seeks required, using each of the
following join strategies for r1∞ r2: (K3) (N/D’16)
(i) Nested loop join
(ii) Block nested loop join
(iii) Merge join
(iv) Hash join
33. What is meant by semantic query optimization? How does it differ from other query optimization
technique? Give example. (K1, K2) (A/M’17)
34. What is hashing? Explain static hashing and dynamic hashing with an example. (K1, K2)
(April/May 2018)
35. What is query optimization? Outline the steps in query optimization. (K1, K4) (April/May 2018)
36. (i) Compare and contrast the distributed databases and centralized database systems. (8)
(ii) Describe the mobile database recovery schemes. (5) (K2) (A/M’17)
37. 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)
38. Write suitable diagrams, discuss about the RAID Levels (Level 0, Level 1, Level 0+1, Level 3,
Level 4 and Level 5) (A/M’15) (N/D’15) (or) Briefly explain about RAID and RAID levels. (16)
(K2) (M/J’16)
39. Explain the architectural components of a Data Warehouse and write about Data marts. (K2)
(A/M’15)
40. Write short notes on Spatial and Mobile Databases. (K2) (N/D’14)
41. Explain in detail about:
(i) B+ tree index.
(ii) B tree index files. (K2) (N/D’14)
42. Briefly explain about B+ tree index file with example. (16) (K2) (M/J’16)
43. (i) Explain Magnetic Disk and Tertiary Storage. (8) (K2) (M/J’14) (M/J’15)
(ii) Write a note on hashing. (8) (K2) (M/J’14) (M/J’15)
44. Describe in detail about RAID and tertiary storage. (K2) (N/D’12, A/M’11, A/M’10, N/D’13)
45. Explain the structure of B+ tree and how to process queries in B+ tree. (10) (K2) (N/D’13)
46. 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, K2) (N/D’13)
47. Construct B+ tree to insert the following (order of the tree is 3). (K3) (M/J’13)
26, 27, 28, 3, 4, 7, 9, 46, 48, 51, 2, 6
48. Write down detailed notes on ordered indices and B+ tree index files. (K2) (N/D’12)
49. Construct a B+ tree to insert the following key elements (order of the tree is 3). (K3) (A/M’12)
5, 3, 4, 9, 7, 15, 14, 21, 22, 23
50. (i) Describe in detail about how records are represented in a file and how to organize them in a
file. (12) (K2) (A/M’12)
CS3492 – Database Management Systems
21
 (ii) When is it preferable to use a dense index rather than a sparse index? Explain your answer.
(4) (K1, K2) (N/D’11)
51. Explain the distinction between closed and open hashing. Discuss the relative merits of each
technique in database applications. (K2) (N/D’11)
52. (i) Describe the different methods of implementing variable length records. (4) (K2)
(ii) Explain the various indexing schemes used in database environment. (12) (K2) (A/M’11)
53. (i) Discuss the improvement of reliability and performance of RAID. (8) (K2) (N/D’10)
(ii) Explain the structure of B+ tree. (8) (K2) (N/D’10)
54. Mention the purpose of indexing. How this can be done by B+ tree? Explain. (K2) (A/M’10)
55. (i) Illustrate indexing and hashing techniques with suitable examples. (8) (K2)
(ii) Explain the architecture of a distributed database system. (7) (K2) (N/D’16) (N/D’15)

Year: 2024-25
UNIT V - ADVANCED TOPICS
Sem.: EVEN

Subject Code : CS3492 Branch : CSE

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 Theorem – 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 – Challenges.

Course Outcome 5 (CO5)

PART - A
1. Define Distributed Database. (K1) (A/M’ 2024)
2. What are the challenges faced when using an encrypted system? (K2) (A/M’ 2024)
3. What is a distributed database management system? (K1) (A/M’ 2023)
4. Define encryption with an example. (K1) (A/M’ 2023)

5. When is it useful to have a replication or fragmentation of data? (K2) (A/M’ 2024)

6. What is the difference between a false positive and a false drop? (K1) (A/M’ 2024)
7. State CAP Theorem. (K2) (N/D’ 2023)
8. List the different types of SQL injection attacks? (K2) (N/D’ 2023)
9. What are the advantages of NoSQL? (K2) (A/M’ 2023)
10. Write the advantages of object-oriented model. (K2) (A/M’ 2023)
11. Give the significance of xquery. (K2) (A/M’2022)
12. Specify the types of fragmentation in distributed databases. (K2) (A/M’2022)
13. Differentiate fragmentation and replication. (K2) (N/D’2022)
14. Define page ranking. (K1) (N/D’2022)
15. Outline the motivation of Replication in a distributed database environment. (K2) (N/D’2021)
16. What is the difference between a false positive and false drop? (K1) (A/M’21)
17. Define a distributed database management system. (N/D’16) (K2) (A/M 2018)
18. List the types of privileges used in database access control. (K2) (N/D’15)
19. When was the first database created? (K2)
20. Differentiate distributed database and normal database. (K2)
21. Differentiate Heterogeneous and Homogeneous DB? (K2)
CS3492 – Database Management Systems
22
22. State the functions of DDB. (K2)
23. List the advantages and disadvantages of DDB. (K2)
24. What are all the parameter requirement of DDB? (K2)
25. Write short notes on types of DDB architecture. (K2)
26. Differentiate DDB and DB. (K2)
27. Define data storage and its types. (K1, K2)
28. List the types of replication with its advantages and disadvantages. (K2)
29. List the types of fragmentation with example. (K2)
30. What is the need of basic concepts during transaction processing? (K1)
31. What is the work of transaction coordinator? (k2)
32. Describe the need of transaction manager. (K2)
33. Specify the actions done during translation. (K2)
34. What is the need of Query mapping? (K1)
35. List the four main categories of No SQL DB. (K2)
36. Transcribe the need of NoSQL Database technology. (K4)
37. Differentiate RDBMS and NoSQL. (K2)
38. Index the similarities between key-value store and document-based system of NoSQL. (K4)
39. What are the 2 components of graph DB? (K2)
40. Define brewer’s theorem. (K1)
41. Why DB security is important? (K2)
42. What is the cause produced by insider danger? (K1)
43. List the various data protection tools and platforms available with DB security. (K2)
44. List the DB security issues. (K2)
45. Define threats in DB with its types. (K1, K2)
46. Specify the four major control measures used to provide security on data in DB. (K2)
47. Describe about the special commands available in DBA. (K2)
48. What is non-discretionary access control. (K1)
49. List the benefits of RBAC. (K2)
50. What is the major difference between RBAC and ABAC? (K1)
51. Specify the aspects required for safeguard and cover DB security. (K4)
52. Why DB security is important? (K2)
53. Define convert channel. (K1)
54. What are the two important parts of encryption? (K2)
55. What are the types of cryptography? (K2)
56. How to make digital signature as authentication? (K3)
57. List the challenges faced by DB security. (K2)
58. Define flow control and its policy. (K1, K2)

PART – B&C
1. Explain distributed database architecture in detail. (K2) (A/M’ 2024)
2. Explain in detail about key value stores and role based access control in advanced database
management systems. (K2) (A/M’ 2024)
3. What is a distributed transaction? Explain distributed query processing with an example.(13)
(K2) (A/M’ 2023)
4. (i) What is NoSQL? Outline the features of NoSQL databases.(8) (K1) (A/M’ 2023)
(ii) Discuss role based access control with an example.(5) (K2) (A/M’ 2023)
5. Explain in detail Query Processing and Processing. (K2) (N/D’ 2023)
6. Discuss on the following:
(i) Access Control based on privileges. (7) (K2)
(ii) Role based Access Control. (6) (K2) (N/D’ 2023)
7. Explain mapping an EER schema to an ODB Schema in detail. (K2) (A/M’ 2023)
8. Explain MongoDB – Data Modelling in details with a real time example. (K2) (A/M’ 2023)
9. Write a short note on the following:
i) XML Databases. (7)
CS3492 – Database Management Systems
23
 ii) ODMG Model of ODG and OQL. (6) (K2) (A/M’2022)
10. (i) With a neat diagram, explain the system structure of a distributed database. (6) (K2)
(ii) Describe how table inheritance and type inheritance is achieved in SQL. (7) (K2) (N/D’2022)
11. (i) Discuss how you extract XML documents from relational databases. (6)
(ii) Give some metrics to measure the information retrieval effectiveness. (7) (N/D’2022)
12. Consider the XML schema Book with the following structure.
Book (id, name, author, price, publisher)
Write the DTD for the above schema. (K2) (N/D’2022)
13. Present an outline of Document Type Declaration, XML schema, path expressions and XQuery
language. (13) (K2) (N/D’2021)
14. (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. (5) (K2) (N/D’2021)
15. 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. (K2, K4) (A/M’2021)
16. State and explain the persistent programming languages. (K2) (A/M’2021)
17. 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. (K2, K3) (A/M’21)
18. Explain about distributed databases and their characteristics, functions and advantages and
disadvantages. (K2) (N/D’2020)
19. 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)
20. Present an overview of database security. (K2) (A/M 2018)
21. Discuss about the access control mechanism and cryptography methods to secure the databases.
(K2) (A/M’15)
22. (i) Write short notes on distributed transactions. (K2)
(ii) Explain about discretionary access control based on Granting and Revoking Privileges. (K2)
23. Explain types of databases security and database security issues. (16) (K2) (M/J’16)
24. Explain briefly about the following (i) NoSQL (ii) SQL Injection (K2)
25. Write short notes on: (i) Encryption with public key infrastructure (ii) Statistical DB Security (K2)
26. Describe about access control based on privileges. (K2)
27. Write short notes on: (i) CAP theorem (ii) Database Security. (K2)
28. Brief about (i) Data Storage (ii) Transaction Processing. (K2)

CS3492 – Database Management Systems

24