DHIRAJLAL GANDHI COLLEGE OF TECHNOLOGY, SALEM

Department of Computer Science and Engineering

CS3492/Database Management System
INTENSIVE COACHING TEST-I

PART-A
1. What is Shadow Paging?
Shadow Paging is recovery technique that is used to recover database. In this recovery
technique, database is considered as made up of fixed size of logical units of storage which are referred
as pages. pages are mapped into physical blocks of storage, with help of the page table which allow one
entry for each logical page of database. This method uses two page tables named current page
table and shadow page table.

2. What is deadlock?

Deadlock is an unwanted situation in which two or more transactions are waiting indefinitely
for one another to give up locks. Deadlock is said to be one of the most feared complications in
DBMS as it brings the whole system to a Halt.

3.Define ARIES. List the various phases of ARIES.

Algorithm for Recovery and Isolation Exploiting Semantics (ARIES) is based on the Write Ahead
Log (WAL) protocol. Every update operation writes a log record which is one of the following :

1. Undo-only log record:

Only the before image is logged. Thus, an undo operation can be done to retrieve the old
data.

2. Redo-only log record:

Only the after image is logged. Thus, a redo operation can be attempted.

3. Undo-redo log record:

Both before images and after images are logged.

4. What are Graph Databases? Give example

A graph database (GDB) is a database that uses graph structures for storing data.
It uses nodes, edges, and properties instead of tables or documents to represent and
store data. The edges represent relationships between the nodes. This helps in retrieving
data more easily and, in many cases, with one operation. Graph databases are commonly
referred to as a NoSQL.

5. what is the state of transaction?

States through which a transaction goes during its lifetime. These are the states which tell about the
current state of the Transaction and also tell how we will further do the processing in the transactions.

6. what is meant by log based recovery?

The atomicity property of DBMS states that either all the operations of transactions

must be performed or none. The modifications done by an aborted transaction should not
be visible to the database and the modifications done by the committed transaction should
be visible.

7. Define dense index.

o The dense index contains an index record for every search key value in the data file.
It makes searching faster.
o In this, the number of records in the index table is same as the number of records in
the main table.
o It needs more space to store index record itself. The index records have the search
key and a pointer to the actual record on the disk.

8. Mention all the operations of files.

Operations on database files can be broadly classified into two categories −

 Update Operations
 Retrieval Operations
  Open − A file can be opened in one of the two modes, read mode or write mode. In read mode,
the operating system does not allow anyone to alter data.
 Read − By default, when files are opened in read mode, the file pointer points to the beginning of
the file.
 Write − User can select to open a file in write mode, which enables them to edit its contents. It
can be deletion, insertion, or modification.
 Close − This is the most important operation from the operating system’s point of view. When a
request to close a file is generated, the operating system

9.list mention two feature of multimedia database.

multimedia database is collection of interrelated multimedia data that includes

text, graphics (sketches, drawings), images, animations, video, audio etc and have vast
amounts of multisource multimedia data.
1. Media data – The actual data representing an object.
2. Media format data – Information such as sampling rate, resolution, encoding scheme
etc.

10. compare sequential access devices verse random access device with an example.

Sequential Memory Access Random Memory Access

The amount of time needed to

Memory access time depends on
access memory is not dependent on
where the store is located.
the storage location.

In Sequential Memory Access, Random Memory Access,memory

memory access time is more. access time is less.

Sequential Memory Access having Random Memory Access having

non-volatile memory. valatile memory

Implementation of Sequential Implementation of Random Memory

Memory Access is straightforward. Access is straightforward.

Example: Magnetic tape Example: Semi-conductor devices

PART-B

11. Two-phase locking protocol (2PL).

A transaction is said to follow the Two-Phase Locking protocol if Locking and Unlocking can be
done in two phases.
 Growing Phase: New locks on data items may be acquired but none can be released.
 Shrinking Phase: Existing locks may be released but no new locks can be acquired.
Lock Based Protocols

A lock is a variable associated with a data item that describes a status of data item with respect to
possible operation that can be applied to it. They synchronize the access by concurrent transactions to
the database items. It is required in this protocol that all the data items must be accessed in a
mutually exclusive manner. Let me introduce you to two common locks which are used and some
terminology followed in this protocol.

1. Shared Lock (S): also known as Read-only lock. As the name suggests it can be shared
between transactions because while holding this lock the transaction does not have the
permission to update data on the data item. S-lock is requested using lock-S instruction.

2. Exclusive Lock (X): Data item can be both read as well as written.This is Exclusive and
cannot be held simultaneously on the same data item. X-lock is requested using lock-X
instruction.

Explain various hashing techniques

Static Hashing
Whenever a search-key value is given in static hashing, the hash algorithm always returns the same
address. If the mod-4 hash function is employed, for example, only 5 values will be generated. For this
function, the output address must always be the same. At all times, the total number of buckets available
remains constant. Click here to learn more about static hashing.

Dynamic Hashing
The disadvantage of static hashing is that it doesn’t expand or contract dynamically as the database size
grows or diminishes. Dynamic hashing is a technology that allows data buckets to be created and
withdrawn on the fly. Extended hashing is another name for dynamic hashing.

If all these conditions are true for any relation(table), it is said to have multi-valued dependency.

Normalization is the process of minimizing redundancy from a relation or set of relations.

Redundancy in relation may cause insertion, deletion, and update anomalies. So, it helps to minimize
the redundancy in relations. Normal forms are used to eliminate or reduce redundancy in database
tables.
Normalization of DBMS
In database management systems (DBMS), normal forms are a series of guidelines that help to ensure
that the design of a database is efficient, organized, and free from data anomalies. There are several
levels of normalization, each with its own set of guidelines, known as normal forms.
Important Points Regarding Normal Forms in DBMS
 First Normal Form (1NF): This is the most basic level of normalization. In 1NF, each
 table cell should contain only a single value, and each column should have a unique name. The
first normal form helps to eliminate duplicate data and simplify queries.
 Second Normal Form (2NF): 2NF eliminates redundant data by requiring that each non-key
attribute be dependent on the primary key. This means that each column should be directly related
to the primary key, and not to other columns.
 Third Normal Form (3NF): 3NF builds on 2NF by requiring that all non-key attributes are
independent of each other. This means that each column should be directly related to the primary
key, and not to any other columns in the same table.
 Boyce-Codd Normal Form (BCNF): BCNF is a stricter form of 3NF that ensures that each
determinant in a table is a candidate key. In other words, BCNF ensures that each non-key
attribute is dependent only on the candidate key.
 Fourth Normal Form (4NF): 4NF is a further refinement of BCNF that ensures that a table does
not contain any multi-valued dependencies.
 Fifth Normal Form (5NF): 5NF is the highest level of normalization and involves decomposing
a table into smaller tables to remove data redundancy and improve data integrity.
Normal forms help to reduce data redundancy, increase data consistency, and improve database
performance. However, higher levels of normalization can lead to more complex database designs and
queries. It is important to strike a balance between normalization and practicality when designing a
database.
Advantages of Normal Form
 Reduced data redundancy: Normalization helps to eliminate duplicate data in tables, reducing
the amount of storage space needed and improving database efficiency.
 Improved data consistency: Normalization ensures that data is stored in a consistent and
organized manner, reducing the risk of data inconsistencies and errors.
 Simplified database design: Normalization provides guidelines for organizing tables and data
relationships, making it easier to design and maintain a database

13.Explain Transaction Isolation ,durability and Atomicity.

 Advantages of ACID Properties in DBMS:

1. Data Consistency: ACID properties ensure that the data remains consistent and accurate after any
transaction execution.
2. Data Integrity: ACID properties maintain the integrity of the data by ensuring that any changes to
the database are permanent and cannot be lost.
3. Concurrency Control: ACID properties help to manage multiple transactions occurring
concurrently by preventing interference between them.
4. Recovery: ACID properties ensure that in case of any failure or crash, the system can recover the
data up to the point of failure or crash.

Course Coordinator Module Coordinator HOD/Programme

Coordinator