module 1
3 marks
1)Define weak entity set with an example.
2)With the help of a diagram explain the different levels of data abstraction?
3)List down any three functions of database administrator (DBA).
4)Explain the various levels of data abstraction in a concise manner using a
diagram. (3)
5)Demonstrate the extended ER feature specialization. (3)
6)Differentiate logical data independence and physical data independence. (3)
7)With the help of an example, explain generalization and specialization in
extended ER features. (3)
8)Differentiate between file system and DBMS. (3)
9)Explain the concept of entity and attribute with suitable example. (3)
10)Differentiate Database schema and instance.
6 marks
1)Draw an E-R diagram of a college database with entities student, staff, course,
teacher, clerk, department & hostel? Relationship names must be meaningful and
there should be an ISA relationship also in diagram.
2)Explain the relational model concept and discuss the different relational model
constraints.
Consider the following schema.
Suppliers (SID, sname, address)
Parts(PID, pname, colour)
Catalog(SID, PID, price)
Catalog[SID] ⸦ Suppliers[SID]
Catalog[PID] ⸦ Parts[PID]
Write relational algebra queries for the following:
(i) Find all prices for parts that are red or green. (A part may have different
prices
from different manufacturers)
(ii) Find the SIDs of all suppliers who supply a part that is red or green.
(iii) Find the names of all suppliers who supply a part that is red or green.
(iv) Find the name and address of all suppliers who supply a part that price
greater than 100.
Explain Entity Relationship model and different symbols used in ER diagram.
11. a. Design an Entity Relationship Diagram for a car race database with the
following (4)
requirements:
For each car we keep its registration number (unique), engine type, colour and
model. Each driver has unique ID, name, DoB, and age which is derived from
DoB. Drivers use cars to enter races, each race has some attributes such as the
race number (unique), race type, the number of rounds, and date. Each driver
can enter many races and can use the same car or different one in each race. Thus
the same car can participate in many races. In the design, we want to capture
which car is used by which driver and in which race.
b. Convert ER diagram constructed in above question to relational schema. (2)
Demonstrate Select, Project, Union, Intersection and Join operations in relational
(6)
algebra.
Identify the additional operations of relational algebra with suitable example. (6)
11. Construct an Entity-Relationship Diagram for a database of research projects.
(6)
The database should contain the information about the following
Projects: name, manager, budget, duration (in years), funding agency
Employees: SSN, name, projects, salary
Each project is funded by a single agency. Project names are unique within an
agency. An Employee can be associated with several projects. Managers are
employees.
11. With a neat diagram, explain the three-schema architecture of DBMS. (6)
OR
12. Explain different types of attributes with suitable example. (6)
module 2
3 marks
Differentiate between BCNF and 3NF with an example. (3)
Explain functional dependency with suitable example.
Explain the issues that may occur if the relation is not normalized.
Give R(X, Y, Z, W) and Set of Functional Dependency FD = {X → Y, Y → Z, Z
→ X}. Find the candidate keys of above relation.
List down inference rules for functional dependency. (3)
Define Join Dependency and Fifth Normal Form (5NF). (3)
Define multivalued dependency and the related normal form with an example. (3)
Write down the inference rules for functional dependencies used in database
normalisation.
What are anomalies? How can it be removed? (3)
What are functional dependency and trivial functional dependency? (3)
6 marks
Analyze the common anomalies found in databases? How can we eliminate it
through normalization?
Define Normalization. Explain 1NF, 2NF and 3NF in detail.
13 a) Consider a relation R(A,B,C,D,E,F) with A as the only key. Assume that the
dependencies E→F and C→DE hold on R. Is R in 2NF? If not, decompose to
2NF.
b) Let E= {B→A, D→A, AB→D} is a set of Functional Dependencies. Find a
minimal cover for E.
Define 2NF. Consider relational schema Student(StudentID, CourseID,
StudentName, CourseName, Grade) with functional dependencies {StudentID,
CourseID} → Grade, StudentID → StudentName, CourseID → CourseName.
Check whether this relation is in 2NF? If not convert into 2NF. Justify your
answer.
3. Consider the following relation. (6)
RegNo Sname CId Cname Mark Grade
1 Ann 101 DBMS 80 A
1 Ann 102 OS 70 D
2 Dave 101 DBMS 60 C
2 Dave 102 OS 95 S
3 Smith 103 OOP 95 S
4 Dan 102 OS 72 B
4 Dan 103 ODP 83 A
Some of the functional dependencies present in this relation are RegNo ->
Sname, CId -> Cname, Mark -> Grade, {RegNo, CId} -> Mark.
Decompose this relation into 3NF relations. Justify your answer.
OR
14. Define 4NF. Give a relation which is not in 4NF and convert it into 4NF.
Justify (6)
your example.
13. Discuss the anomalies at different levels of normalization with example. (6)
14. Describe the informal design guidelines for relational databases. (6)
13. What is normalisation? Explain 1NF, 2NF and 3NF with example. (6)
OR
14. Explain Armstrong's Axioms in detail. (6)
module 3
3 marks
Discuss the ACID properties of transaction. (3)
Define deadlock and discuss the strategies for managing deadlocks.
Does Two Phase locking protocol avoid deadlocks? Justify your answer with
example.
How can the wait/die and wound/wait schemes be utilized to manage transaction
concurrency effectively in a multi-user database environment?
Describe various types of locks used in concurrency control methods. (3)
Explain the properties of transaction. (3)
Discuss the ACID properties of a transaction. (3)
How does it implement concurrency control using timestamp method? (3)
What are the disadvantages of concurrent execution of transactions? (3)
Explain about Deadlock with example. (3)
6 marks
Define deadlock. How can we deal with deadlocks? (6)
Explain concurrency control with locking methods.
What are the possible issues that may arise if concurrent execution of
transactions is not controlled? With the help of example, explain any three such
issues.
16 a) Explain ACID properties of transaction.
b) How would you apply the ACID properties in transactions to ensure data
integrity in banking application?
15. Explain any problems that may occur if concurrent execution of transactions is
(6)
not controlled. Use proper examples.
16. How Concurrency can be controlled using Time Stamps? Explain the wait-die, (6)
wound-wait schemes for concurrency control.
15. Explain why concurrency control mechanism needed in transaction management. (6)
16. Define lock granularity and explain different levels of locking methods for
concurrency control. (6)
15. Explain ACID properties with example. (6)
OR
16. Explain two phase locking protocol with example. (6)
module 4
3 marks
Diagrammatically represent the basic steps in query processing. (3)
Differentiate static and dynamic hashing.
Explain query processing with figure.
Explain any two types of indices used in databases.
Illustrate static hashing. (3)
Differentiate fixed and variable length record organization. (3)
Discuss any two RAID levels with diagram. (3)
Prepare a note on dense index and sparse index with example. (3)
Write a short note on indexed sequential file organization. (3)
Briefly explain on RAID level 0 and level 1. (3)
6 marks
Explain the various RAID levels with appropriate diagrams. (6)
Differentiate between Dense index and Sparse index with example.
Explain various file organization methods with figures.
What is the purpose of RAID? Explain various levels of RAID.
17. Demonstrate various RAID levels with diagram. (6)
18. Explain B Tree and B+ Tree index structures. (6)
17. Elaborate on different file organization methods in data storage. (6)
18. Explain the structure and search operation of a B+ Tree with an example. (6)
17. Explain different types of hashing techniques in detail. (6)
OR
18. Explain B+ tree in detail with example. (6)
module 5
3 marks
Illustrate the different types of Distributed Databases. (3)
Define collection and document in MongoDB.
Explain structured types in SQL with example.
List down any three non-relational databases.
Explain CAP theorem. (3)
Discuss various methods to fragment data in a distributed database. (3)
Compare homogeneous and heterogeneous distributed databases. (3)
Explain array and multiset types in SQL. (3)
List and explain the challenges of distributed database system. (3)
Differentiate between OLTP and OLAP. (3)
6 marks
Explain HBase and Cassandra. (6)
Explain XML and its applications.
Explain MongoDB sharding and replication with figure.
Explain ‘shared disk’ and ‘shared nothing’ architecture with figures.
19. a. Explain MongoDB sharding. (3)
b. Explain MongoDB Replication. (3)
OR
20. a. Explain Arrays and multisets in object based database with example. (3)
b. Explain Object Identity and Reference types in object based database with (3)
example.
19. Explain about non-relational distributed databases. (6)
20. Discuss about MongoDB sharding and replication. (6)
19. What is distributed database? Explain the advantages and disadvantages of
distributed database system. (6)
OR
20. Explain different types of database architectures with neat diagram. (6)
