CS3492 Database Management Systems

UNIT - I
1. What is DBMS?
A database management system (DBMS) is a software package designed to define,
manipulate, retrieve and manage data in a database. Example of database applications.
 Banking Airlines Universities Credit card transactions Telecommunication
 Finance Sales

Describe the three levels of data abstraction?

There are three levels of abstractions
a)Physical level - The lowest level of abstraction describes how data are stored.
b) Logical level - describes what data are stored in database and what relationship among those data.
c) View level - The highest level of abstraction describes only part of entire database.

What is a schema?
The structure of a database system is called Schema. The schema defines the tables,
the fields in each table, and the relationships between fields and tables. Schemas are
generally stored in a data dictionary.
What do u mean by data model?
Data Model can be defined as an integrated collection of concepts for describing
and manipulating data, relationships between data, and constraints on the data in an
organization.

What are the different data model?

 Relational Data Model
 The Entity-Relationship Data Model
 Object-Based Data Model
 Semi structured Data Model
What is a relational model?
The Relational model uses a collection of tables to represent both data and the
relationships among those data. Each table has multiple columns, and each column has a
unique Value.
What is an entity-relationship model?
This data model is based on real world that consists of basic objects called entities and
of relationship among these objects. Entities are described in a database by a set of attributes.
What is Meta data?
Data dictionary contains Metadata-that is, data about data.

What is the use of embedded SQL?

An embedded SQL statement is distinguished from the host language statements by enclosing it between EXEC
SQL or EXEC SQL BEGIN and a matching END-EXEC or EXEC SQL END (or semicolon) ™ Syntax may vary with
language ™ Shared variables (used in both languages) usually
prefixed with a colon (:) in SQL
 What is Dynamic SQL.
Dnamic SQL is a part of embedded SQL. It consists of a set of dynamic
statements‖ which themselves are compiled of time- whose purpose is
precisely to support the compilation and execution of regular SQL
statements that are constructed at run time.

What is a candidate key? Other than Primary key, it is also unique.

What is a primary key? Primary key value is unique and not null. Example Student’s
Register Number, Employee number.
What is foreign key? A foreign key is a field (column) in one table that refers to the
primary key in another table, establishing a link between the two tables.
What is a trigger?
Triggered procedures are precompiled procedures that are stored along with the database and
invoked automatically whenever some specified event occurs.
What are the relational operators?
Union, Intersect, Difference, Product, Select, Project, Join, Divide are the relational operators.
What is Super key ? A superkey is a combination of attributes that can be uniquely used to identify a
database record. A table might have many superkeys.

List the aggregation functions in SQL (Also refer PART-B this question)
Aggregate functions are functions that take a collection of values as input and return a single value
as output.
min - minimum value
max - maximum value 3
sum - sum of values
count - number of values.
PART B
1. Explain the system architecture of a database system with neat block diagram.
2. What is a data model? Explain various data
3. Explain the different between physical and logical data independence with an example.
4. Describe the three-schema architecture.
5. What is the notation (symbols) used in E-R diagram? Explain the E-R model structure
with Example.
6.Explain the role and functions of the database administrator. (Splitup question)
7.Explain the following
i. Data Definition Language. ii.Data Manipulation Language. iii.Data control Language.
iv. Views
8.Develop an Entity Relationship model for a library management system.
9.Explain Embedded SQL?
10. Explain Dynamic SQL.
11. What are aggregate functions? Explain five built-in aggregate functions.
12.Consider the following relations for a company database Application.
Employee (Eno, Name, Sex, DOB, Doj, Designation, Basic_Pay, Dept_No)
These types
Department (DeptNo,Name)
of question, I
Project (ProjNo, Name, Dept_No) have sent
Works for (Eno,ProjNo,Date, Hours) DBMS
university
practical
examination
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 forging 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.
(ii) Develop an SQL query to list the details of employees who have worked in more than
three projects on a day.

UNIT II
What is entity? - It is a 'thing' in the real world with an independent existence.
Example : Student, Course, mobile
What is relationship set? The collection (or set) of similar relationships.
What is entity set? It is a collection of all entities of particular entity type in the database.
What is week entity? An entity set may not have sufficient attributes to form a primary key.
What is mapping cardinality?
Mapping cardinality express the number of entities to which another entity can be
associated via a relationship set. Types of mapping – one to one, one to many, many to
one, many to many relationship sets.
What is functional dependence?
A Functional dependency is denoted by X Y between two sets of attributes X and Y that
are subsets of R specifies a constraint on the possible tuple that can form a relation state
r of R.
Define query language?
A query language is a language in which user requests information from the database.
Define Mapping cardinalities.
Mapping cardinalities or cardinality ratios express the number of entities to which another entity can be associated.
Mapping cardinalities must be one of the following:
One to one, One to many, Many to one, Many to many

Define the terms Generalization and Aggregation

Generalization is a containment relationship that exists between a high-level Entity set and one or more low-level entity
set.
Aggregation is an abstraction through which relationships are treated as higher-level entities.

What is ER diagrams?
An entity-relationship diagram is a data modeling technique that creates a graphical representation of the entities, and
the relationships between entities, within an information system.

What are the steps involved in creating ERD?

a) Identify the entities.
b) Find the relationships
c) Identify key attributes for every entity
d) Draw the ERD.

What is normalization?
Database normalization is the process of organizing the fields and tables of a relational database to
minimize redundancy and eliminate dependency. Normalization usually involves dividing large tables into smaller (and
less redundant) tables and defining relationships between them.
PART – B

Explain about Entity relationship model with ER diagram and example.

Draw an ER diagram for Banking System and Payroll system.

UNIT – III TRANSACTIONS

What are the ACID properties?
Atomicity, Consistency, Isolation, Durability is a set of properties that guarantee database transactions are processed
reliably.

What is transaction?
Collections of operations that form a single logical unit of work are called transactions.

What are the two statements regarding transaction?

The two statements regarding transaction of the form: Begin transaction and End transaction

What are the two types of serializability?

A (possibly concurrent) schedule is serializable if it is equivalent to a serial schedule. Different forms of schedule
equivalence gives rise to the notions of:
• Conflict serializability
• View serializability

List the SQL statements used for transaction control.

Commit : Saves all transactions
Rollback : Used to undo transactions
Savepoint : Establishes a point back to which you may roll
Set Transaction : Establishes properties for current transaction.

Define the phases of two phase locking protocol

Growing phase: a transaction may obtain locks but not release any lock.
Shrinking phase: a transaction may release locks but may not obtain any new locks.

What is Time-stamp based protocol?

Timestamp based protocol ensures Serializability. It selects an ordering among transactions in advance using time
stamps.
With each Transaction in the system, a unique fixed timestamp is associated. It is denoted by TS(Ti). This timestamp is
assigned by the database system before the transaction Ti status execution. If a transaction Ti has
been assigned time- stamp TS(Ti) and new transaction Tj enters the system, then TS(Ti)<TS(Tj).

What is Concurrency Control?

Process of managing simultaneous execution of transactions in a shared database, to ensure the Serializability of
transactions, is known as concurrency control.

PART - B
1 Explain about ACID properties with suitable example.
2 Describe briefly about Serializability and its types with relevant example.
3 Discuss the following transaction with relevant example:
I. Read Only Transaction II. Read Write Transaction III. Aborted Transaction
4 Discuss in detail about two phase commit protocol.
5 Explain the concepts of Concurrency control mechanism.
6 Describe briefly about deadlock handling.
7 Why concurrency control is needed? Explain the problems that would arise when concurrency
control is not provided by the database system.
 UNIT IV –IMPLEMENTATION TECHNIQUES

1. List out the levels of RAID.

RAID level 0 –Block striping non-redundant RAID level 1 –Mirroring
RAID level 2 –Memory style Error correcting code RAID level 3 –Bit interleaved parity
RAID level 4 –Block interleaved parity
RAID level 5 – Block interleaved distributed parity RAID level 6 – P+Q redundancy disk

2. List the merits and demerits of B+ tree index structure.

Mertis
Insertion in B+tree is easy.
Deletion in B+ tree is simple than B tree.
Demeris :
Requires redundant storage for search-key values every search key appears in some leaf node. Several are repeated in
non-leaf node.
Lookup on B+-tree requires traversal of a path from root of tree to some leaf node.

What are the two types of ordered indices?

•Primary index
•Secondary index

What are different types of file organization?

• Sequential file organization
• Heap file organization
• Hashing file organization

What are the factors to evaluate the indexing technique?

• Access types
• Access time
• Insertion time
• Deletion time
• Space overhead
What is B+ tree?
A B+ tree is an n-ary tree with a variable but often large number of children per node. The root may be either a
leaf or a node with two or more children.A B+ tree can be viewed as a B-tree in which each node contains only keys (not
key-value pairs), and to which an additional level is added at the bottom with linked leaves.

Define File organization.

The database is stored as a collection of files. Each file is a sequence of records. A record is a sequence of fields. We
have a file with 2 types of records.
Fixed length records. And Variable length records.

What are the factors to evaluate the indexing technique?

 Access types
 Access time
 Insertion time
 Deletion time
Space overhead

List the five methods of file organization

 Sequential organization.
 Indexed-sequential organization.
 Direct or Hash organization.
 Heap organization.
Clustered Organization

What are the two indices in files?

There are 2 basic kinds of indices.
Ordered indices - Based on a stored ordering of the values
Hash indices - Based on a uniform distribution of values across a range of buckets.

List the advantages and disadvantages of B+ tree.

Advantage of B+-tree index files
•Automatically reorganizes itself with small, local changes, in the face of insertions and deletions. Reorganization of
entire file is not required to maintain performance.
Disadvantage of B+-tree
•Extra insertion and deletion overhead, space overhead.

PART-B

1.What are the various ways of organizing records in files and explain any one file organization in detail.
2. Describe the structure of B+ tree and list the characteristics of B+ tree.
3.What is RAID? Briefly explain different level of RAID.
4. Give brief notes on overviews of physical storage media.
5. Describe briefly about indexing and hashing.
6. Explain Static and Dynamic Hashing.
7. Explain about query processing in detail.
8. Discuss about query optimization in detail.
 UNIT – V

PART B

1. Explain Distributed Database system architecture in detail.

2. Explain Distributed Data Storage.
3. What is CAP Theorem.
4. What is SQL Injection. Write its challenges.
5. Explain NOSQL - Document oriented database, Key value paid database, Graph based database in detail.
6. Explain Database security functions in detail.