Scribd
Upload
41 views2 pages

Question Bank For DBMS CIT II-1

The document defines functional dependency and discusses database normalization forms including 1NF, 2NF and 3NF. It also covers topics like transaction states, relational algebra operations, concurrency control techniques like timestamp-based and locking-based, and issues like deadlocks and shadow paging.

Uploaded by

brgamer0614
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
41 views2 pages

Question Bank For DBMS CIT II-1

The document defines functional dependency and discusses database normalization forms including 1NF, 2NF and 3NF. It also covers topics like transaction states, relational algebra operations, concurrency control techniques like timestamp-based and locking-based, and issues like deadlocks and shadow paging.

Uploaded by

brgamer0614
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

1. Define functional Dependency.

The functional dependency is a relationship that exists between two attributes. It


typically exists between the primary key and non-key attribute within a table.

X → Y

The left side of FD is known as a determinant, the right side of the production is known
as a dependent.For example:Assume we have an employee table with attributes:
Emp_Id, Emp_Name, Emp_Address.

Here Emp_Id attribute can uniquely identify the Emp_Name attribute of employee table
because if we know the Emp_Id, we can tell that employee name associated with it.

2. List the anomalies of 1NF.


All the insertion, deletion and update anomalies are in 1NF relation.

3. What do you mean by trivial dependency?


In Trivial Functional Dependency, a dependent is always a subset of the determinant.
i.e. If X → and Y is the subset of X, then it is called trivial functional dependency.

4. Develop a Database to illustrate 3NF.


 There are two basic requirements for a database to be in 3NF:
1. The database must meet the requirements of both 1NF and 2NF.
2. All database columns must depend on the primary key, meaning that any
column's value can be derived from the primary key only

5. Which normal form is considered adequate for normal relational database


design?
Third Normal Form (3NF) is considered adequate for normal relational database design
because most of the 3NF tables are free of insertion, update, and deletion anomalies.
Moreover, 3NF always ensures functional dependency preserving and lossless.

6. List the states of transaction.


 Active: The initial state where the transaction is executing

 Partially committed: The state after the final statement of the transaction has been
executed
 Committed: The state where the changes are made permanent on the database and the
transaction is complete
 Failed: The state where the transaction fails to complete successfully
 Aborted: The state where the changes made by the transaction are canceled and the
database is restored to its state before the transaction began
 Terminated: The state where the transaction is finished

7. Discuss about SELECT and PROJECT operation in relational algebra.


Select: This operation is used to select a subset of rows from a table based on a
specific condition. Project: This operation is used to select a subset of columns from a
table. The select operation is represented by the Greek letter sigma (σ), while the project
operation is represented by the Greek letter pi (π).
8. Show the time stamps associated with each data item.
In timestamp-based concurrency control, each data item in the database is
associated with two timestamps: a read timestamp (RTS) and a write timestamp
(WTS). The RTS is updated when a transaction reads a data item, and the WTS is
updated when a transaction writes or updates a data item.

9. Define deadlock.
In a database management system (DBMS), a deadlock occurs when two or more
transactions are waiting for each other to release locks, creating a circular wait that can block the
system. For example, Transaction A might have a lock on the Accounts table and need a lock on
the Orders table to finish, while Transaction B might have a lock on the Orders table and need a
lock on the Accounts table.
10. Describe the need of shadow paging.
Shadow paging is a technique used in database management systems (DBMS) to avoid
in-place updates of pages and ensure data consistency. It creates a shadow copy of the
database and applies modifications to it, which minimizes the risk of data
corruption. Shadow paging also improves concurrency and performance by allowing
transactions to work on isolated portions of the database without affecting other
concurrent transactions.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy