GANADIPATHY TULSIS JAIN ENGINEERING COLLEGE

DEPARTMENT OF INFORMATION TECHNOLOGY

IV- Semester CS3492 – DATABASE MANAGEMENT SYSTEMS
UNIT-I (Relational Database)
UNIT-I PART – B

1. Explain DBMS Architecture with an example.

2. Explain the various types of SQL commands. Discuss the features
of SQL
3. Explain Embedded SQL , Dynamic SQL & Advanced SQL Features
with its applications.
4. Explain the different types of keys used in DBMS.
5. Relational Algebra – Select, Project, Cartesian product, Set &Join
Operation

[Link] is Procedural Query Language? Explain the various operations

performed using relational operators. (13)

5.
3. [Link] Data Models. Relational Models & Keys
4. SQL fundamentals – parts of SQL & Structure of SQL
5. 11
6. Advanced SQL & Embedded SQL

Various Model with Example

6. Explain Relational Databases with examples. (13)
7. Draw a Schema and mention the various elements of the schema
with examples (13)
(13)
PART – C
1. Consider the following relations for a company database Application.
Employee (Eno, Name, Sex, DOB, Doj, Designation, Basic_Pay,
Dept_No) Department (DeptNo, Name)
Project (ProjNo, Name, Dept_No)
Works for (Eno,ProjNo,Date, Hours)
The attributes specified for each relation is self-explanatory. However
the business rules are stated as follows. A department can control a
project. An employee can work on any number of projects on a day.
However an employee cannot work more than once on a project he/she
worked on that day. The primary key are underlined. (i). Identify the
foreign keys, Develop DDL to implement the above schema.
(ii)Develop an SQL query to list the department number and the
number of Employee in each department. (iii)Develop a View that will
keep track of the department number, the number of employees in the
department, and the total basic pay expenditure for each department.
(iv)Develop an SQL query to list the details of employees who have
worked in more than three projects on a day.(15)

[Link] the following table Degree(degcode, name, subject)

Candidate(seatno, degcode, semester, month, year, result)
Marks(seatno, degcode, semester, month, year, papcode, marks)
Degcode-degree code, Name-name of the degree (MSc, MCOM)
Perform various query operations using SQL: (i) Write a SELECT
statement to display all the degree codes which are there in the
candidat table but not present in degree table in the order of degcode.
(ii) Write a SELECT statement to display the name of all the candidates
who have got less than 40 marks in exactly 2 subjects. (iii)Write a
SELECT statement to display the name, subject and number of
candidates for all degrees in which there are less than 5 candidates.
(iv) Write a SELECT statement to display the names of all the
candidates who have got highest total marks in MSc.,(Maths) (15)

UNIT-II (Database Design)

PART A
[Link] entity and relationship set.
[Link] Cardinality.
[Link] is weak entity?
[Link] Functional Dependency.
[Link] is Multivalued Dependency?
[Link] the properties of Decomposition.
[Link] is a Relational Mapping?
[Link] Normalization.
[Link] is the difference between unique and primary key?
[Link] is domain key normal form?
11 What is transitive functional dependency?
12 Define 1NF with an example.
13 Define 2NF with an example.
14 Define 3NF with an example.
15 Define BCNF with an example.
16 Define 4NF with an example.
17 Define 5NF with an example.
18 Boyce-Codd normal form is found to be stricter than 3NF’. Justify
the statement
19 Draw an ER model showing one-to-many relationship.
20 Draw an ER model showing many-to-many relationship.
UNIT-II PART – B
1. Draw an ER model by taking Hospital management/Banking
System/University Database and explain all the relationship sets with
cardinality. (13)
2. Explain EER Model with a neat sketch for School Database. (13)
3. Explain various functional dependencies of an ER model with an
example (13)
4. What is Normalization? Explain 1NF, 2NF, 3NF, BCNF, 4NF, 5NF with
examples(13)
5. Explain the concept of Non-Loss Decomposition with an example
(13)
[Link] in detail the steps involved in the ER – to Relational mapping
in the process of relational database design (13)
7. Explain with suitable example, the constraints of specialization and
generalization in ER data modelling. (13)
PART – C
1. 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) and finalize the
customer’s bill. The food preparation staffs (Chefs), with their touch-
display interface 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 notification 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. (15)
2. A car rental company maintains a database for all vehicles in its
current fleet. For all vehicles, it includes the vehicle identification
number, license number, manufacturer, model, date of purchase, and
color. Special data are included for certain types of vehicles.  Trucks:
cargo capacity.  Sports cars: horsepower, renter age requirement. 
Vans: number of passengers.  Off-road vehicles: ground clearance,
drivetrain (four- or two-wheel drive). Construct an ER model for the car
rental company database
 UNIT-III(Transactions)
PART A
[Link] Transaction.
[Link] the types of failures.
[Link] is average response time?
[Link] the need of time stamps.
[Link] strict two phase locking protocol and rigorous two phase
locking protocol.
[Link] are the different modes of lock?
[Link] deadlock.
[Link] Concurrency
[Link] the phases of two phase locking protocol.
[Link] are uncommitted modifications?
11 What is Shadow Paging?
12 Define ARIES. List the various phases of ARIES.
13 What is serializability?
14 What do you mean by phantom problem?
15 What is an isolation level?
16 List the various Recovery techniques.
17 What is deferred update in recovery?
18 Define Validation.
19 What is Snapshot isolation?
20 Define Scheduling.
UNIT-III PART – B
1. Discuss view serializability and conflict serializability. (13)
2. Briefly describe two phase locking in concurrency control
techniques. (13)
3. Explain the concepts of concurrent execution in Transaction
processing system. (13)
4. Brief the ACID properties. Explain Transactions with SQL support for
a banking application (13)
5. What is concurrency control? How is it implemented in DBMS?
Illustrate with a suitable example. (13)
[Link] explain about Two phase commit and three phase commit
protocols. (13)
7. What is deadlock? How does it occur? How transactions be written to
(i) Avoid deadlock (ii) Guarantee correct execution. Illustrate with
suitable example. (13)
8. (i) Narrate the actions that are considered for deadlock detection
and the recovery from deadlock (ii) Discuss the properties of a
transaction that ensure integrity of data in the database system. (13)
9. Write Short notes on (i)Validation and Snapshot Isolation. (ii)
Multiple Granularity locking. (13)
[Link] is Recovery? Explain various recovery techniques during
transactions in detail [Link] Short notes on (i) Shadow Paging. (ii)
ARIES Algorithm. (13)
PART – C
1. Consider the following extension to the tree-locking protocol, which
allows both shared and exclusive locks:  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.  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. (15)
2. Consider the following schedules. The actions are listed in the order
they are schedule, and prefixed with transaction name. S1: T1: R(X),
T2: R(x), T1: W(Y), T2: W(Y), T1: R(Y), T2: R(Y) S2:T3: R(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:  What is the precedence graph for the
schedule?  Is the schedule conflict-serializable? If so, what are all the
conflict equivalent serial schedules?  iii. Is the schedule view-
serializable? If so, what are all the view equivalent serial schedules?
(15)
UNIT-IV(Implementation Techniques)
PART A
[Link] the various heuristics involved in query optimization.
[Link] the various types of record organizations in a file.
3. Draw the storage device hierarchy.
4. What is RAID?
5. List the factors to be taken into account in choosing a RAID system.
6. Mention the various types of file organization with ex.
7. What are the two basic kinds of indices?
8. Differentiate clustering index and non-clustering index
9. What is a balanced tree?
10Write a query for B+ tree.
11Define a bucket.
12Define hash function.
13What is dynamic hashing?
14List the steps involved in query processing.
15Which cost components are used for cost function estimation?
16What is replication transparency?
17State the need for query optimization.
18Differentiate left join and right join.
19What is Outer join? Give example.
20Differentiate Data Dictionary Storage and Column Oriented Storage.
UNIT-IV PART – B
1. Explain how the RAID systems improve performance and reliability.
(13)
2. What is RAID? List the different level in RAID technology and explain
its Features with neat sketches. (13)
3. Describe the structure of B+ tree and list the characteristics of a
B+tree with indexing operation. (13)
4. Explain the steps involved in Query Processing with a neat sketch.
(13)
5. Discuss static hashing and dynamic hashing with examples. (13)
[Link] in detail about how records are represented in a file and how
to organize them in a file. (13)
7. Explain the cost estimation for query processing. (13)
8. Discuss the selection, sorting and join operations using appropriate
algorithms. (13)
9. Explain the various heuristics involved in query optimization. (13)
[Link] B tree indexing with an example. (13)

PART – C
1. Explain the various steps involved for Select Operation with
example. (15)
2. Explain the various steps involved for Join Operation with example.
(15)
3. Explain Cost-based optimization with example. (15)

UNIT-V(Advanced Topics)
PART A
[Link] are Distributed Databases?
[Link] Filtering and Polinstantiation.
[Link] the different types of security problem.
[Link] is discretionary access control?
[Link] is mandatory access control?
[Link] is NOSQL database?
[Link] CAP Theorem.
[Link] are the advantages of distributed databases?
[Link] the issues of distributed databases.
[Link] the various utilities of graph databases.
11 What is a threat in DBMS?
12 What are the various security metrics used for statistical
databases?
13 What is SQL Injection?
14 How to encrypt a database system? Illustrate with an example.
15 List the open challenges faced in securing a database system.
16 What are Document based systems?
17 What are Column based systems?
18 Define role based access.
19 State the needs for encrypting a database system.
20 What are Graph Databases? Give examples
UNIT-V PART – B
1. Explain in detail about Distributed Databases with a neat sketch.
(13)
2. Discuss the query processing and optimization for a transaction in
Distributed Databases. (13)
3. Explain NOSQL databases with applications. (13)
4. Explain about the various threats and risks in Database
Management Systems(13)
5. Discuss about various Access Control Mechanisms and Efficient
Methods to Secure the Databases. (13)
6. Write Short notes on (i) CAP Theorem. (ii) Key Value Stores. (13)
7. Write Short notes on (i) Column based systems (ii) Graph Databases
(13)
8. What is Statistical Database? Explain the security measures involved
for having uniqueness of access. (13)
9. Explain the encryption techniques used for securing a database
system. (13)
[Link] Discretionary Access control based on Granting and
Revoking Privileges.
[Link] about the Federation of Distributed Database Systems (13)
[Link] SQL Injection Methods with an example. (13)
PART – C
1. Explain the Granting and Revoking Privileges in a Distributed
Database with example.
2. Discuss the Risks associated with SQL Injection Methods with
suitable Preventive measures. (15)
3. Explain the various types of NOSQL Database systems (15)