Q 1.

Explain the ACID properties in the context of

DBMS.
Ans: ACID stands for Atomicity, Consistency, Isolation,
and Durability.
Atomicity ensures that a transaction is treated as
a single, indivisible unit. It either fully completes
or leaves no trace in the database.
Consistency ensures that a transaction takes the
database from one consistent state to another. It
must satisfy all integrity constraints.
Isolation ensures that concurrent transactions do
not interfere with each other, and their effects
appear as if they occurred serially.
Durability guarantees that once a transaction is
committed, its changes are permanent and will
survive system crashes.

01
Q 2. What is normalization, and why is it important in
DBMS?
Ans: Normalization is the process of organizing data in a
database to reduce data redundancy and improve
data integrity.

It involves dividing large tables into smaller, related

tables and defining relationships between them.

Normalization helps in eliminating data anomalies

like insertion, update, and deletion anomalies,
making the database more efficient and
maintainable.

Q 3. Explain the difference between a primary key

and a foreign key.
Ans: A primary key is a unique identifier for a record in
a table. It ensures that each row in the table is
uniquely identifiable. There can be only one
primary key per table.
A foreign key is a field in a table that is used to
establish a link between two tables. It creates a
relationship between the tables by referencing
the primary key of another table. It enforces
referential integrity.

02
Q 4. What is indexing in DBMS, and why is it
important?
Ans: Indexing is a technique used to optimize the retrieval
of records from a database table. It involves creating
a data structure that provides fast access to rows
based on one or more columns.

Indexes improve query performance by reducing the

number of records that need to be scanned. They are
important for efficient data retrieval in large
databases.
Q 5. What is a transaction in DBMS, and what are its
properties?
Ans: A transaction is a sequence of one or more SQL
statements that are treated as a single unit of work.
The properties of a transaction are commonly
referred to as ACID:
Atomicity: A transaction is atomic, meaning it is
either executed in its entirety or not at all.
Consistency: A transaction takes the database
from one consistent state to another.
Isolation: Transactions are isolated from each
other to prevent interference.
Durability: Once a transaction is committed, its
changes are permanent and survive system
failures.
03
Q 6. What is the difference between a clustered
and a non-clustered index?
Ans: A clustered index determines the physical order of
data rows in a table. There can be only one
clustered index per table, and it directly affects the
way data is stored on disk.
A non-clustered index does not dictate the physical
order of data. It creates a separate data structure
that provides a quick lookup to the actual data
rows. Multiple non-clustered indexes can exist on a
table.

Q 7. Explain the concept of data concurrency

control in DBMS.
Ans: Data concurrency control is a mechanism to manage
simultaneous access to the database by multiple
users or transactions. It ensures that transactions do
not interfere with each other and maintain data
consistency. Techniques like locking, timestamping,
and multiversion concurrency control are used to
achieve this.

These questions cover essential concepts in

database management systems without focusing on
specific SQL or NoSQL technologies. They can help
assess a candidate's understanding of fundamental
database principles.
04
Q 8. What is the difference between a database
and a DBMS?
Ans: A database is a structured collection of data, while a
DBMS (Database Management System) is software
that facilitates the storage, retrieval, and
management of data in a database.

The DBMS provides tools and services to interact

with the data stored in the database.

Q 9. Explain the concept of data normalization

and denormalization. When would you use
each approach?
Ans: Data normalization is the process of organizing data
in a database to reduce redundancy and improve
data integrity.

Denormalization, on the other hand, is the process of

intentionally introducing redundancy for
performance or other reasons.

Use normalization when data integrity is a top

priority, and use denormalization when you need to
optimize query performance.

05
 Why Choose AlgoTutor?
1:1 PERSONAL
100 % PLACEMENT
MENTORSHIP FROM
ASSISTANCE
INDUSTRY EXPERTS

100 % SUCCESS
23 LPA(AVG.)CTC
RATE

200+ SUCCESSFUL 147%(AVG.)

ALUMNI SALARY HIKE

LEARN FROM
CAREER SERVICES
SCRATCH

EXPLORE MORE

+91-7260058093 www.algotutor.io info@algotutor.io

Q 10. What is a deadlock in a DBMS, and how can it
be prevented or resolved?
Ans: A deadlock occurs when two or more transactions
are unable to proceed because each is waiting for a
resource that the other holds.

Deadlocks can be prevented using techniques like

locking protocols, timeouts, or resource allocation
strategies.

They can also be resolved using deadlock detection

and resolution algorithms.

Q 11. Explain the concept of a transaction log in a

DBMS.
Ans: A transaction log is a record of all changes made to a
database during transactions. It includes information
about the beginning and end of transactions, as well
as details about data modifications.

Transaction logs are essential for recovering a

database to a consistent state after system failures
and for maintaining data integrity.

06
Q 12. What is the role of a query optimizer in a
DBMS?
Ans: A query optimizer is a component of a DBMS that is
responsible for determining the most efficient way
to execute a database query.

It analyzes various query execution plans and selects

the one with the lowest cost in terms of I/O, CPU, or
other resources. The goal is to optimize query
performance.

Q 13. Explain the difference between a heap file and

a clustered file organization.
Ans: A heap file organization is an unstructured
storage approach where records are inserted
wherever there is space in the file. It is simple but
can lead to fragmentation and slower retrieval
times.
A clustered file organization organizes records in
a specific order based on the values of one or
more columns. It can provide faster retrieval for
certain types of queries but may be less flexible
than a heap file.

07
Q 14. What is the role of the transaction manager
in a DBMS, and how does it ensure the ACID
properties of transactions?
Ans: The transaction manager in a DBMS is responsible
for managing the execution of transactions and
ensuring they adhere to the ACID properties.

It does this by coordinating transaction execution,

maintaining a transaction log, and using techniques
like locking and rollback to guarantee atomicity,
consistency, isolation, and durability.

Q 15. Explain the concept of database

normalization forms (e.g., 1NF, 2NF, 3NF).
Ans: Database normalization forms are a series of
guidelines used to eliminate data redundancy and
improve data integrity.
1NF (First Normal Form): Ensures that each
column contains only atomic (indivisible) values.
2NF (Second Normal Form): Requires 1NF and
that all non-key attributes are fully functionally
dependent on the primary key.
3NF (Third Normal Form): Requires 2NF and that
there are no transitive dependencies between
non-key attributes.

08
Q 16. What is the difference between a schema and
a database in a DBMS?
Ans: A database is a collection of data stored in an
organized manner, while a schema is a logical
container within a database that defines the
structure and organization of the data, including
tables, relationships, and constraints.

A database can have multiple schemas.

Q 17. Explain the concept of referential integrity in

DBMS.
Ans: Referential integrity is a constraint that ensures the
consistency of relationships between tables.

It requires that foreign key values in one table match

primary key values in another table.

This constraint prevents the creation of orphaned

records and maintains data integrity.

09
Q 18. What is a B-tree index, and how does it differ
from a hash index?
Ans: A B-tree index is a type of index structure that
organizes data in a balanced tree-like structure. It
is suitable for range queries and sorting, and it
maintains data in a sorted order.
A hash index is a data structure that uses a hash
function to map keys to locations in a table. It is
efficient for equality queries but not well-suited
for range queries or sorting.

Q 19. Explain the concept of a database transaction

log and its role in disaster recovery.
Ans: A database transaction log records all changes made
to the database during transactions.

It plays a crucial role in disaster recovery by allowing

the system to restore the database to a consistent
state after a failure.

By replaying the log, the DBMS can recover changes

up to the point of failure.

10
Q 20. Explain the concept of data warehousing in
the context of DBMS.
Ans: Data warehousing involves the process of collecting,
storing, and managing large volumes of data from
various sources into a centralized repository called a
data warehouse.

The data is then organized, transformed, and

optimized for analytical and reporting purposes.
Data warehousing facilitates business intelligence
and data analysis.

For Admission Enquiry

+91-7260058093
info@algotutor.io
11
07
+91-7260058093 www.algotutor.io info@algotutor.io