WWW.VIDYARTHIPLUS.

COM

CS6302 DATABASE MANAGEMENT SYSTEMS LTPC

3003
OBJECTIVES:

del.

Processing.

UNIT I INTRODUCTION TO DBMS 10

File Systems Organization - Sequential, Pointer, Indexed, Direct - Purpose of Database System-
Database System Terminologies-Database characteristics- Data models – Types of data models –
Components of DBMS- Relational Algebra. LOGICAL DATABASE DESIGN: Relational
DBMS -Codd's Rule - Entity-Relationship model - Extended ER Normalization – Functional
Dependencies,Anomaly- 1NF to 5NF- Domain Key Normal Form – Denormalization
UNIT II SQL & QUERY OPTIMIZATION 8
SQL Standards - Data types - Database Objects- DDL-DML-DCL-TCL-Embedded SQL-Static
Vs Dynamic SQL - QUERY OPTIMIZATION: Query Processing and Optimization - Heuristics
and Cost Estimates in Query Optimization.
UNIT III TRANSACTION PROCESSING AND CONCURRENCY CONTROL 8
Introduction-Properties of Transaction- Serializability- Concurrency Control – Locking
Mechanisms-Two Phase Commit Protocol-Dead lock.
UNIT IV TRENDS IN DATABASE TECHNOLOGY 10
Overview of Physical Storage Media – Magnetic Disks – RAID – Tertiary storage – File
Organization –Organization of Records in Files – Indexing and Hashing –Ordered Indices – B+
tree Index Files – B tree Index Files – Static Hashing – Dynamic Hashing - Introduction to
Distributed Databases- Client server technology- Multidimensional and Parallel databases-
Spatial and multimedia databases-Mobile and web databases- Data Warehouse-Mining- Data
marts.
WWW.VIDYARTHIPLUS.COM V +TEAM
 WWW.VIDYARTHIPLUS.COM

UNIT V ADVANCED TOPICS 9

DATABASE SECURITY: Data Classification-Threats and risks – Database access Control –
Types of Privileges –Cryptography- Statistical Databases.- Distributed Databases-Architecture-
Transaction Processing-Data Warehousing and Mining-Classification-Association rules-
Clustering-Information Retrieval- Relevance ranking-Crawling and Indexing the Web- Object
Oriented Databases-XML Databases.
TOTAL: 45 PERIODS
OUTCOMES:
At the end of the course, the student should be able to:

odel, ER diagrams.

TEXT BOOK:
1. Ramez Elmasri and Shamkant B. Navathe, “Fundamentals of Database Systems”, Fifth
Edition, Pearson Education, 2008.
REFERENCES:
1. Abraham Silberschatz, Henry F. Korth and S. Sudharshan, “Database System Concepts”, Sixth
Edition, Tata Mc Graw Hill, 2011.
2. C.J.Date, A.Kannan and S.Swamynathan, “An Introduction to Database Systems”, Eighth
Edition, Pearson Education, 2006.
3. Atul Kahate, “Introduction to Database Management Systems”, Pearson Education, New
Delhi,2006.
4. Alexis Leon and Mathews Leon, “Database Management Systems”, Vikas Publishing House
Private Limited, New Delhi, 2003.
5. Raghu Ramakrishnan, “Database Management Systems”, Fourth Edition, Tata Mc Graw Hill,
2010.
6. G.K.Gupta, “Database Management Systems”, Tata Mc Graw Hill, 2011.
7. Rob Cornell, “Database Systems Design and Implementation”, Cengage Learning, 2011.

WWW.VIDYARTHIPLUS.COM V +TEAM
 WWW.VIDYARTHIPLUS.COM

CS6302/DATABASE MANAGEMENT SYSTEMS

PART-A
UNIT I
INTRODUCTION TO DBMS
1. Define database management system?
Database management system (DBMS) is a collection of interrelated data and a set of
programs to access those data.
2. List any eight applications of DBMS.
a) Banking
b) Airlines
c) Universities
d) Credit card transactions
e) Tele communication
f) Finance
g) Sales
h) Manufacturing
i) Human resources
3. What are the disadvantages of file processing system?
The disadvantages of file processing systems are
a) Data redundancy and inconsistency
b) Difficulty in accessing data
c) Data isolation
d) Integrity problems
e) Atomicity problems
f) Concurrent access anomalies
4. What are the advantages of using a DBMS?
The advantages of using a DBMS are
a) Controlling redundancy
b) Restricting unauthorized access
c) Providing multiple user interfaces
d) Enforcing integrity constraints.
WWW.VIDYARTHIPLUS.COM V +TEAM
 WWW.VIDYARTHIPLUS.COM

e) Providing back up and recovery

5. Give the levels of data abstraction?
a) Physical level
b) logical level
c) view level
6. Define instance and schema?
Instance: Collection of data stored in the data base at a particular moment is called an
Instance of the database.
Schema: The overall design of the data base is called the data base schema.
7. Define the terms 1) physical schema 2) logical schema.
Physical schema: The physical schema describes the database design at the physical
level, which is the lowest level of abstraction describing how the data are actually stored.
Logical schema: The logical schema describes the database design at the logical level,
which describes what data are stored in the database and what relationship exists among the
data.
8. What is conceptual schema?
The schemas at the view level are called subschemas that describe different views
of the database.
9. Define data model?
A data model is a collection of conceptual tools for describing data, data relationships,
data semantics and consistency constraints.
10. What is storage manager?
A storage manager is a program module that provides the interface between the low level
data stored in a database and the application programs and queries submitted to the system.
11. What are the components of storage manager?
The storage manager components include
a) Authorization and integrity manager
b) Transaction manager
c) File manager
d) Buffer manager
12. What is the purpose of storage manager?
WWW.VIDYARTHIPLUS.COM V +TEAM
 WWW.VIDYARTHIPLUS.COM

The storage manager is responsible for the following

a) Interaction with he file manager
b) Translation of DML commands in to low level file system commands
c) Storing, retrieving and updating data in the database
13. List the data structures implemented by the storage manager.
The storage manager implements the following data structure
a) Data files
b) Data dictionary
c) indices
14. What is a data dictionary?
A data dictionary is a data structure which stores meta data about the structure of the
database ie. the schema of the database.
15. What is an entity relationship model?
The entity relationship model is a collection of basic objects called entities and
relationship among those objects. An entity is a thing or object in the real world that is
distinguishable from other objects.
16. What are attributes? Give examples.
An entity is represented by a set of attributes. Attributes are descriptive properties
possessed by each member of an entity set.
Example: possible attributes of customer entity are customer name, customer id,
customer street, customer city.
17. What is relationship? Give examples.
A relationship is an association among several entities.
Example: A depositor relationship associates a customer with each account that he/she has.
18. Define the terms i) Entity set ii) Relationship set
Entity set: The set of all entities of the same type is termed as an entity set.
Relationship set: The set of all relationships of the same type is termed as a
relationship set.
19. Define single valued and multivalued attributes.
 Single valued attributes: attributes with a single value for a particular entity are called
single valued attributes.
WWW.VIDYARTHIPLUS.COM V +TEAM
 WWW.VIDYARTHIPLUS.COM

 Multivalued attributes: Attributes with a set of value for a particular entity are called
multivalued attributes.
20. What are stored and derived attributes?
 Stored attributes: The attributes stored in a data base are called stored attributes.
 Derived attributes: The attributes that are derived from the stored attributes are
called derived attributes.
21. What are composite attributes?
Composite attributes can be divided in to sub parts.
22. Define null values.
In some cases a particular entity may not have an applicable value for an attribute or if
we do not know the value of an attribute for a particular entity. In these cases null value is used.
23. Define the terms i) Entity type ii) Entity set
 Entity type: An entity type defines a collection of entities that have the same attributes.
 Entity set: The set of all entities of the same type is termed as an entity set.
24. What is meant by the degree of relationship set?
The degree of relationship type is the number of participating entity types.
25. Define the terms i) Key attribute ii) Value set
Key attribute: An entity type usually has an attribute whose values are distinct from
each individual entity in the collection. Such an attribute is called a key attribute.
Value set: Each simple attribute of an entity type is associated with a value set that
specifies the set of values that may be assigned to that attribute for each individual entity.
26. Define weak and strong entity sets?
Weak entity set: entity set that do not have key attribute of their own are called weak
entity sets.
Strong entity set: Entity set that has a primary key is termed a strong entity set.
27. What does the cardinality ratio specify?
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:

WWW.VIDYARTHIPLUS.COM V +TEAM
 WWW.VIDYARTHIPLUS.COM

28. Explain the two types of participation constraint.

Total: The participation of an entity set E in a relationship set R is said to be total if
every entity in E participates in at least one relationship in R.
Partial: if only some entities in E participate in relationships in R, the participation of
entity set E in relationship R is said to be partial.
29. Define the terms i) DDL ii) DML
DDL: Data base schema is specified by a set of definitions expressed by a special
language called a data definition language.
DML: A data manipulation language is a language that enables users to access or
manipulate data as organized by the appropriate data model.
30. Write short notes on relational model
The relational model uses a collection of tables to represent both data and the
relationships among those data. The relational model is an example of a record based model.
31. Define tuple and attribute
Attributes: column headers
Tuple: Row
32. Define the term relation.
Relation is a subset of a Cartesian product of list domains.
33. Define tuple variable
Tuple variable is a variable whose domain is the set of all tuples.
34. Define the term Domain.
For each attribute there is a set of permitted values called the domain of that attribute.
35. What is a candidate key?
Minimal super keys are called candidate keys.
36. What is a primary key?
Primary key is chosen by the database designer as the principal means of identifying an
entity in the entity set.
37. What is a super key?
A super key is a set of one or more attributes that collectively allows us to identify
uniquely an entity in the entity set.
WWW.VIDYARTHIPLUS.COM V +TEAM
 WWW.VIDYARTHIPLUS.COM

38. Define- relational algebra.

The relational algebra is a procedural query language. It consists of a set of operations
that take one or two relation as input and produce a new relation as output.
39. What is a SELECT operation?
The select operation selects tuples that satisfy a given predicate. We use the lowercase
letter 𝞂 to denote selection.
40. What is a PROJECT operation?
The project operation is a unary operation that returns its argument relation with certain
attributes left out. Projection is denoted by pi (π).
41. Define functional depedency.
A functional dependency is a constraint between two sets of attributes from the data base.
A functional dependency , denoted by
X Y
Between two sets of attributes X and Y that are subsets of R specifies a constraint on the possible
tuples that can form a relation instance r of R.R={ A1,A2,…,An}.
42. Define normalization.
Normalization of data is a process during which unsatisfactory relation schemas are
decomposed by breaking up their attributes into smaller relation shemas that possess desirable
properties.
43. Define 1NF.
1NF states that the domains of attributes must include only atomic values and that the
value of any attribute in a tuple must be a single value from the domain of that attribute. It
disallows multivalued attributes, composite attributes and their combinations.
44. Define 2NF.
A relation shema R is in 2NF if every nonprime attribute A in R is fully functionally
dependent on the primary key. A functional dependency X Y is a full functional dependency if
removal of any attribute A from X means that the dependency does not hold any more; that is,
for any attribute AX, (X-{A}) X Y.
45. Define 3NF.
A relation shema R is in 3NF if it is in 2NF and no nonprime attribute of R is transitively
dependent on the primary key. A funtional dependency X  Y in arelation shema R is a
WWW.VIDYARTHIPLUS.COM V +TEAM
 WWW.VIDYARTHIPLUS.COM

transitive dependency if ther is a set of attributes Z that is not a subset of any key of R, and both
XY and ZY hold.
46. What is need for normalization.
 To ensure that the update anomalies do not occur.
 Normal forms provide a formal frame work for analyzing relation shemas based on
their keys and on the functional dependencies among their attributes.
 A series of tests that can be carried out on individual relation schemas so that the
relation database can be normalized to any degree. When a test fails , the relation
violating that test must be decomposed into relations that individually meet the
normalization tests.
47. In what way BCNF is different from 3NF?
A relation schema R is in BCNF if whenever a functional dependency XY holds in
R,then X is a superkey of R.The only difference between BCNF and 3NF : the 3NF allows A to
be a prime if X is not a superkey, is absent from BCNF.
48. Define multivalued dependency.
Multivalued dependencies are a result of 1NF which disallowed an attribute in a tuple to
have a set of values. A multivalued dependency X->->Y specified on relation schema R where X
and Y are subsets of R specifies the following constraint on any relation r of R:
If two tuples t1 and t2 exist in r such that t1[x]=t2[x] then two tuples t3 and t4 should also
exist in r with the following properties:
 t3[X]=t4[X]=t1[X]=t2[X]
 t3[Y]=t1[Y]=t4[Y]=t2[Y]
 t3[R-(XY)]=t2[R-(XY)]=t4[R-(XY)]=t1[R-(XY)]

49. Define lossless joins (or) What is nonadditive property.

Lossless join property or nonadditive property ensures that no spurious tuples(tuples
containing wrong information) are generated when a natural join operation is applied to the
relations in the decomposition.
50. Explain BCNF with example(or) How to convert a relation into BCNF.

WWW.VIDYARTHIPLUS.COM V +TEAM
 WWW.VIDYARTHIPLUS.COM

Boyce-Codd Normal form: It is stricter than 3NF, meaning that every relation in BCNF is
also in 3NF; however a relation in 3NF is not necessarily in BCNF. A relation is in BCNF if and
only if every determinant is a candidate key (i.e) a relatioln schema R is in BCNF if whenever a
functional dependency X->A holds in R, then X is a superkey of R
51. Why are certain functional dependencies called trivial functional dependencies?
A multivaluedd functional dependency x->>Y in R is called a trivial MVD if
(a) Y is subset of X or
(b) XUY=R
e.g., the FD ename> pname is trivial

Ename Pname

52. Why are certain functional dependencies called non-trivial functional dependencies?
A multivalued functional dependency x> Y in R is called a no-trivial MVD if it does
not satisfy the following:
(a) Y is subset of X
(b) XUY=R
Ename Eno Dob Dno Dname dmgrno

53. What are pitfalls in relational database design?

 Repetition of informaition
 Inability to represent certain information
 Loss of information
54. Explain the desirable properties of decomposition.
 Lossless-join decomposition
 Dependency preservation
 Repetition of information
55. What are the uses of functional dependencies?
 To test relations to see whether they are legal under a given set of functional
dependencies.
 To specify constraints on the set of legal relations.
56. Explain trivial dependency?
WWW.VIDYARTHIPLUS.COM V +TEAM
 WWW.VIDYARTHIPLUS.COM

Functional dependency of the form α ->β. is trivial if α C β. Trivial functional

dependencies are satisfied by all the relations.
UNIT II
SQL & QUERY OPTIMIZATION
1. What are the parts of SQL language?
The SQL language has several parts:
 data - definitition language
 Data manipulation language
 View definition
 Transaction control
 Embedded SQL
 Integrity
 Authorization
2. What are the categories of SQL command?
SQL commands are divided in to the following categories:
1. Data - Definitition Language
2. Data Manipulation language
3. Data Query Language
4. Data Control Language
5. Data Administration Statements
6. Transaction Control Statements
3. What are the three classes of SQL expression?
SQL expression consists of three clauses:
 Select
 From
 Where
4. Give the general form of SQL query?
Select A1, A2…………., An
From R1, R2……………, Rm
Where P
5. What is the use of rename operation?
WWW.VIDYARTHIPLUS.COM V +TEAM
 WWW.VIDYARTHIPLUS.COM

Rename operation is used to rename both relations and a attributes.It uses the as clause,
taking the form:
Old-name as new-name
6. List the string operations supported by SQL?
1) Pattern matching Operation
2) Concatenation
3) Extracting character strings
4) Converting between uppercase and lower case letters.
7. List the set operations of SQL?
1) Union
2) Intersect operation
3) The except operation
8. What is the use of Union and intersection operation?
Union: The result of this operation includes all tuples that are either in r1 or in r2 or in
both r1 and r2.Duplicate tuples are automatically eliminated.
Intersection: The result of this relation includes all tuples that are in both r1 andr2.
9. What are aggregate functions? And list the aggregate functions supported by
SQL?
Aggregate functions are functions that take a collection of values as input and return a
single value.
Aggregate functions supported by SQL are
 Average: avg
 Minimum: min
 Maximum: max
 Total: sum
 Count: count
10. What is the use of group by clause?
Group by clause is used to apply aggregate functions to a set of tuples. The attributes
given in the group by clause are used to form groups. Tuples with the same value on all
attributes in the group by clause are placed in one group.
11. What is the use of sub queries?
WWW.VIDYARTHIPLUS.COM V +TEAM
 WWW.VIDYARTHIPLUS.COM

A sub query is a select-from-where expression that is nested with in another query. A

common use of sub queries is to perform tests for set membership, make set comparisions, and
determine set cardinality.
12. What is view in SQL? How is it defined?
Any relation that is not part of the logical model, but is made visible to a user as a virtual
relation is called a view.
13. We define view in SQL by using the create view command. The form of the
create view command is
Create view v as <query expression>
14. What is the use of with clause in SQL?
The with clause provides a way of defining a temporary view whose definition is
available only to the query in which the with clause occurs.
15. List the table modification commands in SQL?
 Deletion
 Insertion
 Updates
 Update of a view
16. List out the statements associated with a database transaction?
 Commit work
 Rollback work
17. What is transaction?
Transaction is a unit of program execution that accesses and possibly updated various
data items.
18. List the SQL domain Types?
SQL supports the following domain types.
1)Char(n) 2) varchar(n) 3) int 4) numeric(p,d) 5) float(n) 6) date.
19. What is the use of integrity constraints?
Integrity constraints ensure that changes made to the database by authorized users do not
result in a loss of data consistency. Thus integrity constraints guard against accidental damage
to the database.

WWW.VIDYARTHIPLUS.COM V +TEAM
 WWW.VIDYARTHIPLUS.COM

20. Mention the 2 forms of integrity constraints in ER model?

 Key declarations
 Form of a relationship
21. What is trigger?
Triggers are statements that are executed automatically by the system as the side effect of
a modification to the database.
22. What are domain constraints?
A domain is a set of values that may be assigned to an attribute .all values that appear in a
column of a relation must be taken from the same domain.
23. What are referential integrity constraints?
A value that appears in one relation for a given set of attributes also appears for a certain
set of attributes in another relation.
24. What is assertion? Mention the forms available.
An assertion is a predicate expressing a condition that we wish the database always to
satisfy.
25. Give the syntax of assertion?
Create assertion <assertion name>check<predicate>
26. What is the need for triggers?
Triggers are useful mechanisms for alerting humans or for starting certain tasks
automatically when certain conditions are met.
27. List the requirements needed to design a trigger.
The requirements are
 Specifying when a trigger is to be executed.
 Specify the actions to be taken when the trigger executes.
28. Give the forms of triggers?
 The triggering event can be insert or delete.
 For updated the trigger can specify columns.
 The referencing old row as clause
 The referencing new row as clause
 The triggers can be initiated before the event or after the event.

WWW.VIDYARTHIPLUS.COM V +TEAM
 WWW.VIDYARTHIPLUS.COM

29. What does database security refer to?

Database security refers to the protection from unauthorized access and malicious
destruction or alteration.
30. List some security violations (or) name any forms of malicious access.
 Unauthorized reading of data
 Unauthorized modification of data
 Unauthorized destruction of data.
31. List the types of authorization.
 Read authorization
 Write authorization
 Update authorization
 Drop authorization
32. What is authorization graph?
Passing of authorization from one user to another can be represented by an authorization
graph.
33. List out various user authorization to modify the database schema.
 Index authorization
 Resource authorization
 Alteration authorization
 Drop authorization
34. What are audit trails?
An audit trail is a log of all changes to the database along with information such as which
user performed the change and when the change was performed.
35. Mention the various levels in security measures.
 Database system
 Operating system
 Network
 Physical
 Human
36. Name the various privileges in SQL?

WWW.VIDYARTHIPLUS.COM V +TEAM
 WWW.VIDYARTHIPLUS.COM

o Delete
o Select
o Insert
o Update
37. Mention the various user privileges.
 All privileges directly granted to the user or role.
 All privileges granted to roles that have been granted to the user or role.
38. Give the limitations of SQL authorization.
 The code for checking authorization becomes intermixed with the rest of the
application code.
 Implementing authorization through application code rather than specifying it
declaratively in SQL makes it hard to ensure the absence of loopholes.
39. List the disadvantages of relational database system
 Repetition of data
 Inability to represent certain information.
40. What do you mean by “Query Optimization”?
Improving of the strategy for processing a query is called “Query Optimization”. It is the
responsibility of the system to transform the query as entered by the user into an equivalent
query which can be computed more efficiently.
41. What is called query processing?
Query processing refers to the range of activities involved in extracting data froma
database.
42. What are the steps involved in query processing?
The basic steps are:
 parsing and translation
 optimization
 Evaluation
43. What is called an evaluation primitive?
A relational algebra operation annotated with instructions on how to evaluate is called an
evaluation primitive.

WWW.VIDYARTHIPLUS.COM V +TEAM
 WWW.VIDYARTHIPLUS.COM

44. What is called a query evaluation plan?

A sequence of primitive operations that can be used to evaluate a query is a query
evaluation plan or a query execution plan.
45. What is called a query –execution engine?
The query execution engine takes a query evaluation plan, executes that plan, and returns
the answers to the query.
UNIT III
TRANSACTION PROCESSING AND CONCURRENCY CONTROL
1. What is transaction?
Collections of operations that form a single logical unit of work are called transactions.
2. What are the two statements regarding transaction?
The two statements regarding transaction of the form:
 Begin transaction
 End transaction
3. What are the properties of transaction?
The properties of transactions are:
 Atomicity
 Consistency
 Isolation
 Durability
4. What is recovery management component?
Ensuring durability is the responsibility of a software component of the base system
called the recovery management component.
5. When is a transaction rolled back?
Any changes that the aborted transaction made to the database must be undone. Once the
changes caused by an aborted transaction have been undone, then the transaction has been rolled
back.
6. What are the states of transaction?
The states of transaction are
 Active
 Partially committed
WWW.VIDYARTHIPLUS.COM V +TEAM
 WWW.VIDYARTHIPLUS.COM

 Failed
 Aborted
 Committed
 Terminated
7. What is a shadow copy scheme?
It is simple, but efficient, scheme called the shadow copy schemes. It is based on making
copies of the database called shadow copies that one transaction is active at a time. The scheme
also assumes that the database is simply a file on disk.
8. Give the reasons for allowing concurrency?
The reasons for allowing concurrency is if the transactions run serially, a short
transaction may have to wait for a preceding long transaction to complete, which can lead to
unpredictable delays in running a transaction. So concurrent execution reduces the unpredictable
delays in running transactions.
9. What is average response time?
The average response time is that the average time for a transaction to be completed after
it has been submitted.
10. What are the two types of serializability?
The two types of serializability is
 Conflict serializability
 View serializability
11. Define lock?
Lock is the most common used to implement the requirement is to allow a transaction to
access a data item only if it is currently holding a lock on that item.
12. What are the different modes of lock?
The modes of lock are:
 Shared
 Exclusive
13. Define deadlock?
Neither of the transaction can ever proceed with its normal execution. This situation is
called deadlock.
14. Define the phases of two phase locking protocol
WWW.VIDYARTHIPLUS.COM V +TEAM
 WWW.VIDYARTHIPLUS.COM

 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.
15. Define upgrade and downgrade?
 It provides a mechanism for conversion from shared lock to exclusive lock is
known as upgrade.
 It provides a mechanism for conversion from exclusive lock to shared lock is
known as downgrade.
16. What is a database graph?
The partial ordering implies that the set D may now be viewed as a directed acyclic
graph, called a database graph.
17. What are the two methods for dealing deadlock problem?
The two methods for dealing deadlock problem is deadlock detection and deadlock
recovery.
18. What is a recovery scheme?
An integral part of a database system is a recovery scheme that can restore the database to
the consistent state that existed before the failure.
19. What are the two types of errors?
The two types of errors are:
 Logical error
 System error
20. What is meant by log-based recovery?
The most widely used structures for recording database modifications is the log.The log
is a sequence of log records, recording all the update activities in the database. There are several
types of log records.
21. What are uncommitted modifications?
The immediate-modification technique allows database modifications to be output to the
database while the transaction is still in the active state. Data modifications written by active
transactions are called uncommitted modifications.
22. Define shadow paging.

WWW.VIDYARTHIPLUS.COM V +TEAM
 WWW.VIDYARTHIPLUS.COM

An alternative to log-based crash recovery technique is shadow paging. This technique

needs fewer disk accesses than do the log-based methods.
23. Define page.
The database is partitioned into some number of fixed-length blocks, which are referred
to as pages.
24. What are the drawbacks of shadow-paging technique?
 Commit Overhead
 Data fragmentation
 Garbage collection
25. Differentiate strict two phase locking protocol and rigorous two phase locking
protocol.
 Strict two phase locking protocol all exclusive mode locks taken by a
transaction is held until that transaction commits.
 Rigorous two phase locking protocol requires that all locks be held until the
transaction commits.
26. How the time stamps are implemented?
 Use the value of the system clock as the time stamp. That is a transaction’s time
stamp is equal to the value of the clock when the transaction enters the system.
 Use a logical counter that is incremented after a new timestamp has been assigned;
that is the time stamp is equal to the value of the counter.
27. What are the time stamps associated with each data item?
 W-timestamp (Q) denotes the largest time stamp if any transaction that executed
WRITE (Q) successfully.
 R-timestamp (Q) denotes the largest time stamp if any transaction that executed
READ (Q) successfully.
UNIT IV
TRENDS IN DATABASE TECHNOLOGY
1. What are the storage types?
The storage types are:
 Volatile storage

WWW.VIDYARTHIPLUS.COM V +TEAM
 WWW.VIDYARTHIPLUS.COM

 Nonvolatile storage
2. Define blocks?
The database system resides permanently on nonvolatile storage, and is into fixed-length
storage units called blocks.
3. What is meant by Physical blocks?
The input and output operations are done in block units. The blocks residing on the disk
are referred to as physical blocks.
4. What is meant by buffer blocks?
The blocks residing temporarily in main memory are referred to as buffer blocks.
5. What is meant by disk buffer?
The area of memory where blocks reside temporarily is called the disk buffer.
6. Define garbage collection.
Garbage may be created also as a side effect of crashes. Periodically, it is necessary to
find all the garbage pages and to add them to the list of free pages. This process is called garbage
collection.
7. What is an index?
An index is a structure that helps to locate desired records of a relation quickly,without
examining all records.
8. Define query optimization.
Query optimization refers to the process of finding the lowest –cost method of evaluating
a given query.
9. What are the types of storage devices?
 Primary storage
 Secondary storage
 Tertiary storage
 Volatile storage
 Nonvolatile storage
10. What is called remapping of bad sectors?
If the controller detects that a sector is damaged when the disk is initially formatted, or
when an attempt is made to write the sector, it can logically map the sector to a different physical
location.
WWW.VIDYARTHIPLUS.COM V +TEAM
 WWW.VIDYARTHIPLUS.COM

11. Define access time.

Access time is the time from when a read or write request is issued to when data transfer
begins.
12. Define seek time.
The time for repositioning the arm is called the seek time and it increases with the
distance that the arm is called the seek time.
13. Define average seek time.
The average seek time is the average of the seek times, measured over a sequence of
random requests.
14. Define rotational latency time.
The time spent waiting for the sector to be accessed to appear under the head is called the
rotational latency time.
15. Define average latency time.
The average latency time of the disk is one-half the time for a full rotation of the disk.
16. What is meant by data-transfer rate?
The data-transfer rate is the rate at which data can be retrieved from or stored to the disk.
17. What is meant by mean time to failure?
The mean time to failure is the amount of time that the system could run continuously
without failure.
18. What is a block and a block number?
A block is a contiguous sequence of sectors from a single track of one platter.Each
request specifies the address on the disk to be referenced. That address is in the form of a block
number.
19. What are called journaling file systems?
File systems that support log disks are called journaling file systems.
20. What is the use of RAID?
A variety of disk-organization techniques, collectively called redundant arrays of
independent disks are used to improve the performance and reliability.
21. What is called mirroring?
The simplest approach to introducing redundancy is to duplicate every disk. This technique
is called mirroring or shadowing.
WWW.VIDYARTHIPLUS.COM V +TEAM
 WWW.VIDYARTHIPLUS.COM

22. What is called mean time to repair?

The mean time to failure is the time it takes to replace a failed disk and to restore the data
on it.
23. What is called bit-level striping?
Data striping consists of splitting the bits of each byte across multiple disks. This is called
bit-level striping.
24. What is called block-level striping?
Block level striping stripes blocks across multiple disks. It treats the array of disks as a
large disk, and gives blocks logical numbers
25. What are the two main goals of parallelism?
 Load –balance multiple small accesses, so that the throughput of such accesses
increases.
 Parallelize large accesses so that the response time of large accesses is reduced.
26. What are the factors to be taken into account when choosing a RAID level?
 Monetary cost of extra disk storage requirements.
 Performance requirements in terms of number of I/O operations
 Performance when a disk has failed.
 Performances during rebuild.
27. What is meant by software and hardware RAID systems?
RAID can be implemented with no change at the hardware level, using only software
modification. Such RAID implementations are called software RAID systems and the systems
with special hardware support are called hardware RAID systems.
28. Define hot swapping?
Hot swapping permits the removal of faulty disks and replaces it by new ones without
turning power off. Hot swapping reduces the mean time to repair.
29. What are the ways in which the variable-length records arise in database systems?
 Storage of multiple record types in a file.
 Record types that allow variable lengths for one or more fields.
 Record types that allow repeating fields.

WWW.VIDYARTHIPLUS.COM V +TEAM
 WWW.VIDYARTHIPLUS.COM

30. What is the use of a slotted-page structure and what is the information present in the
header?
The slotted-page structure is used for organizing records within a single block.The header
contains the following information.
 The number of record entries in the header.
 The end of free space
 An array whose entries contain the location and size of each record.
31. What are the two types of blocks in the fixed –length representation? Define them.
Anchor block: Contains the first record of a chain.
Overflow block: Contains the records other than those that are the first record of a chain.
32. What is known as heap file organization?
In the heap file organization, any record can be placed anywhere in the file where there is
space for the record. There is no ordering of records. There is a single file for each relation.
33. What is known as sequential file organization?
In the sequential file organization, the records are stored in sequential order,according to
the value of a “search key” of each record.
34. What is hashing file organization?
In the hashing file organization, a hash function is computed on some attribute of each
record. The result of the hash function specifies in which block of the file the record should be
placed.
35. What is known as clustering file organization?
In the clustering file organization, records of several different relations are stored in the
same file.
36. What are the types of indices?
 Ordered indices
 Hash indices
37. What are the techniques to be evaluated for both ordered indexing and hashing?
 Access types
 Access time
 Insertion time

WWW.VIDYARTHIPLUS.COM V +TEAM
 WWW.VIDYARTHIPLUS.COM

 Deletion time
 Space overhead
38. What is known as a search key?
An attribute or set of attributes used to look up records in a file is called a search key.
39. What is a primary index?
A primary index is an index whose search key also defines the sequential order of the
file.
40. What are called index-sequential files?
The files that are ordered sequentially with a primary index on the search key, are called
index-sequential files.
41. What are the two types of indices?
 Dense index
 Sparse index
42. What are called multilevel indices?
Indices with two or more levels are called multilevel indices.
43. What is B-Tree?
A B-tree eliminates the redundant storage of search-key values .It allows search key
values to appear only once.
44. What is a B+-Tree index?
A B+-Tree index takes the form of a balanced tree in which every path from the root of
the root of the root of the tree to a leaf of the tree is of the same length.
45. What is a hash index?
A hash index organizes the search keys, with their associated pointers, into a hash file
structure.
46. What are called as index scans?
Search algorithms that use an index are referred to as index scans.
47. What is called as external sorting?
Sorting of relations that do not fit into memory is called as external sorting.
48. What is called as recursive partitioning?
The system repeats the splitting of the input until each partition of the build input fits in
the memory. Such partitioning is called recursive partitioning.
WWW.VIDYARTHIPLUS.COM V +TEAM
 WWW.VIDYARTHIPLUS.COM

49. What is called as an N-way merge?

The merge operation is a generalization of the two-way merge used by the standard in-
memory sort-merge algorithm. It merges N runs, so it is called an N-way merge.
50. What is known as fudge factor?
The number of partitions is increased by a small value called the fudge factor,which is
usually 20 percent of the number of hash partitions computed.
UNIT V
ADVANCED TOPICS
1. What are the classifications of threats?
 Physical Threats
 Accidental error
 Unauthorized access
 Malicious misuse
2. Define data mining
Data mining is a process of extracting or mining knowledge from huge amount of data.
3. What are the steps in the data mining process?
 Data cleaning
 Data integration
 Data selection
 Data transformation
 Data mining
 Pattern evaluation
 Knowledge representation
4. What are the uses of statistics in data mining?
Statistics is used to
 To estimate the complexity of a data mining problem;
 suggest which data mining techniques are most likely to be successful; and
 identify data fields that contain the most “surface information”.
5. Define Data Classification.

WWW.VIDYARTHIPLUS.COM V +TEAM
 WWW.VIDYARTHIPLUS.COM

It is a two-step process. In the first step, a model is built describing a pre-determined set
of data classes or concepts. The model is constructed by analyzing database tuples described by
attributes. In the second step the model is used for classification.
6. What is Association rule?
Association rule finds interesting association or correlation relationships among a large
set of data items, which is used for decision-making processes. Association rules analyzes
buying patterns that are frequently associated or purchased together.
7. How are association rules mined from large databases?
Association rule mining is a two-step process.
 Find all frequent itemsets.
 Generate strong association rules from the frequent itemsets.
8. Why do you need data warehouse life cycle process?
Data warehouse life cycle approach is essential because it ensures that the project pieces
are brought together in the right order and at the right time.
9. What are the merits of Data Warehouse?
 Ability to make effective decisions from database
 Better analysis of data and decision support
 Discover trends and correlations that benefits business
 Handle huge amount of data.
10. List some of the Data Warehouse tools?
 OLAP (Online Analytic Processing)
 ROLAP (Relational OLAP)
 End User Data Access tool
 Ad Hoc Query tool
 Data Transformation services
 Replication

WWW.VIDYARTHIPLUS.COM V +TEAM
 WWW.VIDYARTHIPLUS.COM

CS6302/DATABASE MANAGEMENT SYSTEMS

PART-B
UNIT I
1. Explain in detail about file Systems Organization with example.
2. Explain in detail about purpose of Database System
3. What are the characteristics of database? Explain
4. Explain in detail about DBMS components.
5. Discuss the various disadvantages in the file system and explain how it can be overcome
by the database system.
6. Explain the database system structure with a neat diagram.
7. Construct an ER diagram for an employee payroll system.
8. Explain the basic Relational Algebra operations with the symbol used and an example for
each.
9. Explain Codd's Rule .
10. Explain 1NF, 2NF and 3NF and BCNF with an example.
11. Explain the Boyce/Codd normal form with an example. Also state how it differs from that
of 3NF.
12. What are the pitfalls in relational database design? With a suitable example, explain the
role of functional dependency in the process of normalization.
13. Consider the universal relation r(A,B,C,D,E,F,G,H,I,J) and the set of FD’s. G=({A,B}
{C} {B,D} {E,F}, {A,D} {G,H}, {A}{I}, {H}{J}) What is the key of R?
Decompose R into 2NF, then 3NF relations.
14. Define data model. Explain the different types of data models with relevant examples.
15. Construct an ER diagram for a car insurance company that has a set of customers, each of
whom owns one/more cars. Each car has associated with it zero to any number of recorded
accidents. Construct appropriate tables for the above ER diagram.
WWW.VIDYARTHIPLUS.COM V +TEAM
 WWW.VIDYARTHIPLUS.COM

16. Construct the ER diagram for hospital with a set of patients and a set of medical doctors.
Associate with each patient a log of the various tests and examinations conducted.

UNIT II
1. Explain in detail about database Objects.
2. Write short note on the following:
[i]Data manipulation language
[ii]Data definition language
[iii] Data control language
3. Differentiate Static SQL and Dynamic SQL
4. Give the diagrammatic representation to indicate the basic steps in query processing.
5. How to choose the best evaluation plan for query?
6. How does pipelining improve query evaluation efficiency?
7. Explain in detail about Heuristics and Cost Estimates in Query Optimization.
8. Let relations r1[A,B,C] and r2[C,D,E] have the following properties:
r1 has 20,000 tuple, r2 has 45,000 tuples, 25 tuples of r1 fit on one block and 30 tuples of
r2 fit on the block. Estimate the number of block transfers and seeks required, using each
of the following join stratesies for r1 * r2 :
i. Nested loop join
ii. Block nested loop join
iii. Merge Join
9. Explain embedded SQL with suitable example.
10. Consider the employee database , where the primary keys are underlined.
employee(empname,street,city)
works(empname,companyname,salary)
company(companyname,city)
manages(empname,management)
Give an expression in the relational algebra for each request.
1) Find the names of all employees who work for First Bank Corporation.

WWW.VIDYARTHIPLUS.COM V +TEAM
 WWW.VIDYARTHIPLUS.COM

2) Find the names, street addresses and cities of residence of all employees who work for
First Bank Corporation and earn more than 200000 per annum.
3) Find the names of all employees in this database who live in the same city as the
company for which they work.
4) Find the names of all employees who earn more than every employees of small Bank
Corporation.
UNIT III
1. Explain testing for Serializability with respect to concurrency control schemes. How will
you determine whether a schedule is serializable or not.
2. Explain the following protocols for concurrency control:
i. Lock-based protocols.
ii. Time stamp based protocols.
3. What is concurrency Control? How is it implemented in DBMS?
4. Explain the properties of transactions. Illustrate the states of transactions.
5. Briefly explain ACID property with an example.
6. When do you say that the system is in deadlock? Explain
7. Explain the two approaches of deadlock prevention.
8. Define a transaction. Then discuss the following with relevant examples:
(i) A read only transaction
(ii) A read write transaction
(iii) An aborted transaction
UNIT IV
1. Explain how the RAID system improves performance and reliability.
2. Describe the structure of B+ tree and list the characteristics of a B+ tree.
3. What are the different types of storage media?
4. Discuss briefly static and dynamic hashing.
Explain the use of index structure and explain the concept of ordered indices.
5. Describe a hash file organization.
6. Write a detailed note on hashing techniques.

WWW.VIDYARTHIPLUS.COM V +TEAM
 WWW.VIDYARTHIPLUS.COM

7. Describe the different types of file organization? Explain using a sketch of each of them
with their advantages and disadvantages. Mention the purpose of indexing. How this can be
done by B+ tree? Explain.
8. Describe the different methods of implementing variable length record.
9. Explain in detail about Distributed Databases.
10. Explain in detail about Multidimensional and Parallel databases.
11. Describe in detail about spatial and multimedia databases.
UNIT V
1. Describe the classification of data? Explain about Threats and Risks?
2. Explain in detail about database control and types of privileges?
3. Explain in detail about Cryptography?
4. Describe about Statistical Databases and Distributed Databases?
5. Describe the architecture Data Warehousing and Mining?
6. Explain in detail about the transaction processing?
7. Describe about the Association rule?
8. Explain about Clustering, Information Retrieval, Relevance ranking?
9. Describe about the Crawling and Indexing the Web?
10. Explain about Object Oriented Databases and XML Databases with suitable example?

WWW.VIDYARTHIPLUS.COM V +TEAM