Unit 1- 2mark

1. Define Database Management System

2. List the applications of Database Management System.

3.List the role of Database Administrator.

 4.Define Data Abstraction.

5.Define Instance, Schema, Query language, Data Dictionary

6.What is E-R model?

7.Define entity and entity set.

8.What is Weak entity set?

9.Define relationship and relationship set.

10.Define Relational model.

11.Write about the types of attributes in ER model.

 12 .What are the advantages of using a DBMS?

Unit 2 - 2mark
1)Define Aggregate Functions in SQL? Commented [1]:

In database management an aggregate function is a function where the values

of multiple rows are grouped together as input on certain criteria to form a
single value of more significant meaning.
Types:

1) Count()
2) Sum()
3) Avg()
4) Min()
5) Max()

2) Define normalization?

o Normalization is the process of organizing the data in the database.

o Normalization is used to minimize the redundancy from a relation or

set of relations. It is also used to eliminate the undesirable
characteristics like Insertion, Update and Deletion Anomalies.
3)What do you mean by Correlated subquery?
Correlated subqueries are used for row-by-row processing. Each subquery is
executed once for every row of the outer query.

A correlated subquery is evaluated once for each row processed by the parent
statement. The parent statement can be a SELECT, UPDATE,
or DELETE statement.

4)Define trigger.
Trigger: A trigger is a stored procedure in database which automatically invokes
whenever a special event in the database occurs. For example, a trigger can be
invoked when a row is inserted into a specified table or when certain table
columns are being updated.
5)list the pit fall in relation database design.

6)what is Nested sub query?

A Subquery or Inner query or a Nested query is a query within another SQL query
and embedded within the WHERE clause.
A subquery is used to return data that will be used in the main query as a condition
to further restrict the data to be retrieved.

7)What is the difference between TRUNCATE and DELETE

command?
TRUNCATE:

 .It is a DDL command

 .It does not support WHERE clause/condition
  .Removes all the data all the time
 .Faster than DELETE as it locks entire table
 .It removes the data by deallocating the data pages used to store the
table’s data, and only the page deallocations are recorded in the
transaction log
 .It does not activate triggers
 .Table identity column is reset to seed value

Syntax:

TRUNCATE TABLE TableName

DELETE:

 It is DML command
 It supports WHERE clause/condition
 Removes data based on conditions specified in the WHERE clause
(removes all the data if there is no WHERE clause)
 Slower than TRUNCATE as it takes row level locks
 It removes rows one at a time and records an entry in the transaction log
for each deleted row
 It does activate triggers
 Table identity column is not reset

Syntax:

DELETE FROM TableName

WHERE ColName = ‘YourCondition’

8).Define SQL and state the difference between SQL and other
conventional programming Language.

1. SQL is a nonprocedural language that is designed specifically for

data access operations on normalized relational database structures.
 The primary difference between SQL and other conventional
programming languages is that SQL statements specify what data
operations should be performed rather than how to perform them.
2. SQL is a simple and powerful language used to create, access and
manipulate data and structure in the database.

9)What is database trigger is a PL/SQL block that can defined to

automatically execute for insert,update and deleted statements
against a table ?
A trigger is a named PL/SQL block stored in the Oracle Database and executed
automatically when a triggering event takes place. The event can be any of the
following:

1. A data manipulation language (DML) statement executed against a table

e.g., INSERT, UPDATE, or DELETE. For example, if you define a trigger that fires
before an INSERT statement on the customers table, the trigger will fire once
before a new row is inserted into the customers table.

2. A data definition language (DDL) statement executes

e.g., CREATE or ALTER statement. These triggers are often used for auditing
purposes to record changes of the schema.

10)List the properties of decomposition.

Following are the properties of Decomposition,
1. Lossless Decomposition
2. Dependency Preservation
3. Lack of Data Redundancy

UNIT 3
1)Define physical storage.
Databases are stored in file formats, which contain records. At physical level,
the actual data is stored in electromagnetic format on some device. These
storage devices can be broadly categorized into three types −
2)Define cache
A cache, in computing, is a data storing technique that provides the
ability to access data or files at a higher speed.

3 )Define Order index

In this, the indices are based on a sorted ordering of the values. These are
generally fast and a more traditional type of storing mechanism. These
Ordered or Sequential file organization might store the data in a dense or
sparse format.

4)Differentiate between Dense index and Sparse index.

5)Define static Hashing.

In static hashing, when a search-key value is provided, the hash function
always computes the same address. For example, if we want to generate
address for STUDENT_ID = 76 using mod (5) hash function, it always result in
the same bucket address 4. There will not be any changes to the bucket
address here. Hence number of data buckets in the memory for this static
hashing remains constant throughout.

6)What is query processing?

Query Processing is a translation of high-level queries into low-level
expression.

It is a step wise process that can be used at the physical level of the file system,
query optimization and actual execution of the query to get the result.

7)what are the steps involved in query processing?

 Step 1: Parsing
 Step 2: Translation
 Step 3: Optimizer
 Step 4: Execution Plan
 Step 5: Evaluation

8) Advantage of clustering file organization

The cluster file organization is used when there is a frequent request for
joining the tables with same joining condition.

It provides the efficient result when there is a 1:M mapping between the
tables.

9)Define Sparse index.

In sparse index, index records are not created for every search key. An index
record here contains a search key and an actual pointer to the data on the
disk. To search a record, we first proceed by index record and reach at the
actual location of the data. If the data we are looking for is not where we
directly reach by following the index, then the system

10)Explain B+ tree index structure?

o The B+ tree is a balanced binary search tree. It follows a multi-level

index format.

o In the B+ tree, leaf nodes denote actual data pointers. B+ tree

ensures that all leaf nodes remain at the same height.

Every leaf node is at equal distance from the root node. A B+ tree is
of the order n where n is fixed for every B+ tree.

Unit 4

1)Define Transaction Processing.

The transaction is a set of logically related operation. It contains a group of tasks.A transaction is an
action or series of actions. It is performed by a single user to perform operations for accessing the
contents of the database.

2)Define concurrency Control

In the concurrency control, the multiple transactions can be executed simultaneously.It may affect
the transaction result. It is highly important to maintain the order of execution of those transactions.

3)Write the properties of Transaction?

 Atomicity

 Consistency

 Isolation

 Durability

4)When the System Said to Dead lock?

A system is in a deadlock state if there exists a set of transactions such that every transaction in the
set is waiting for another transaction in the set.

5)What are the need for concurrency?

When more than one transactions are running simultaneously there are chances of a conflict to
occur which can leave database to an inconsistent state. To handle these conflicts we need
concurrency control in DBMS, which allows transactions to run simultaneously but handles them in
such a way so that the integrity of data remains intact.

6)Define deadlock.
A system is in a deadlock state if there exists a set of transactions such that every transaction in the
set is waiting for another transaction in the set.

7)Type of locking
There are two types of lock:

1. Shared lock

2. Exclusive lock

8)Define atomicity?
Atomicity. In a transaction involving two or more discrete pieces of information, either
all of the pieces are committed or none are.

9)When the schedule is called serial?

The serial schedule is a type of schedule where one transaction is executed
completely before starting another transaction. In the serial schedule, when
the first transaction completes its cycle, then the next transaction is
executed.

10)Define serializability.
When multiple transactions are running concurrently then there is a possibility that the database
may be left in an inconsistent state. Serializability is a concept that helps us to check which schedules
are serializable. A serializable schedule is the one that always leaves the database in consistent state.

Unit 5
1)Define Data Mining ?
Data mining is the process of extracting the useful information stored in
the large database.It is the extraction of hidden predictive information. Data
mining can be applied to relational databases, object-oriented databases,
data warehouses, structured-unstructured databases etc.

2)Define distributed database

A distributed database management system (DDBMS) is a centralized software system
that manages a distributed database in a manner as if it were all stored in a single
location.

3)what dataware housing?

A Data Warehouse is a relational database which is designed to support
management and decision – making.It is designed for query analysis rather
than transaction processing.

4)What are Deductive Databases?

A deductive database is a database system that can make deductions (i.e., conclude
additional facts) based on rules and facts stored in the (deductive) database

5)Mention two features of parallel Databases

Each processor in a system can perform tasks concurrently.

Tasks may need to be synchronized.

Nodes usually share resources, such as data, disks, and other devices.

6)Mention two features of Multimedia databases.

Integration. Data items do not need to be duplicated for different programs invocations.

 Data independence. ...

 Concurrency control. ...

 Persistence. ...

 Privacy. ...
  Integrity control. ...

 Recovery. ...

7)Components of Distributed DBMS?

 Computer work station
 Network hardware and software
 Communications media
 Transaction processor

8)Define Integrity
Data integrity is a fundamental component of information security.

Data Integrity - can be used to describe a state, a process or a function – and is often used as a
proxy for “data quality

9)Define Database Security.

Database security refers to the collective measures used to protect and secure a
database or database management software from illegitimate use and malicious threats and
attacks.

10)Define Recovery and ACID Property

 Recovery
 It is the method of restoring the database to its correct state in the event of a failure at the
time of the transaction or after the end of a process. .
 Acid property
 Atomicity
 Abort
 Commit