ANAND INSTITUTE OF HIGHER TECHNOLOGY
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING
UNITWISE UNIVERSITY QUESTIONS
CS6302 DATABASE MANAGEMENT SYSTEMS
UNIT I
PART A
1.
With the block diagram, discuss briefly the various levels of abstraction [Nov/Dec2002]
2.
Specify with suitable example the different types of keys used in DBMS [Nov/Dec2002],
[Nov-Dec2012]
3.
Distinguish between physical and logical data independence [May-Jun2003]
4.
Define DBMS [May/Jun2005] .
5.
Define Abstraction [May/Jun2005]
6.
List the functions of database administrator[ Nov/Dec2005]
7.
What are the main differences between file processing system and DBMS [May/Jun2006],
[May/Jun2012]
8.
Give the limitation of ER model and how do you overcome this? [May/Jun2007]
9.
List the five responsibilities of DB Manager.
[May/Jun2007]
10.
List any two advantages of database systems. [Nov/Dec2007]
11.
Give the reasons why null values might be introduces into the database. [Nov/Dec2007]
12.
Define data independence.
[Apr/May2008]
13.
Distinguish between primary key and candidate key. With an example explain a weak entity in an ER diagram.
[Apr/May2008]
14.
With an example explain referential integrity. [Apr/May2008]
15.
With an example explain a weak entity in an ER diagram.
[Apr/May2008]
16.
With relevant example explain ternary relationship [May/Jun2009]
17.
Explain the basic structure of a relational database with an example.[ May/Jun2010]
18.
Define the two levels of data independence.
[Nov/Dec2010]
19.
Who is a DBA? What are the responsibilities of a DBA?
[Apr/May2011]
20.
What is a data model? List the types of data models used.
[Apr/May2011],[Nov/Dec2011],[May/Jun2012]

21.
With an example what a derived attribute is?
[Nov/Dec2011]
22.
Distinguish terms primary key and super key.
[Nov/Dec2011]
23.
Specify the differences between physical and logical data independence [Nov/Dec2012]
24.
Give an example for one to one and one to may relationship. [May/Jun2013]
25.
What do you mean by simple and composite attribute? [Nov/Dec2013]
26.
Define query. [Nov/Dec2013]
27.
Describe BCNF and describe the relation which is in BCNF [Nov/Dec2002]
28.
Define multi valued dependencies [Nov/Dec2002], [Nov/Dec2012]
29.
Explain lossless join decomposition with example. [May/Jun2003]
30.
Explain two desirable properties of decomposition. [May/Jun2003]
31.
Define Functional Dependency. [Nov/Dec2004], ]May/Jun2010], [Nov/Dec2013],
[May/Jun2014]
32.
Why it is necessary to decompose a relation? [May/Jun2007]
33.
What is normalization? [May/Jun2010], [May/Jun2014]
34.
Consider the following relation:
R [A, B, C, D, E]
The primary key of the relation is AB. The following functional dependencies hold:
A C
B D
AB E
Is the above relation in second normal form?
[Nov/Dec2011]
35.
Give an example of a relation schema R and a set of dependencies such that R is in BCNF,
but not in 4NF [May/Jun2012]
36.
Why are certain functional dependencies called as trivial functional dependencies?
[May/Jun2012]
37.
Show that if a relation database is in BCNF,then it is also in 3NF [Nov/Dec2012]
38.
What is Boyce codd Normal Form? [May/Jun2013]
39.
What is the need for normalization? [May/Jun2013]
40.
Define trivial functional dependency. [Nov/Dec2013]
PART B
1.
Explain the File System organization.
[Nov/Dec2013]

2.
With the help of data models describe the design of a database at the logical level
[May/Jun2004], [Nov/Dec2012]
3.
With the help of the block diagram, explain the basic architecture of DBMS [Nov/Dec2004],
[Apr/May2011], [May/Jun2012], [ May/Jun2013], [May/Jun2014]
4.
Explain the component modules of a DBMS and their interactions with the architecture.
[Nov/Dec2008]
5.
Explain the purpose of database system. [ May/Jun2013]
6.
Explain the basic concept of Functional Dependency with example. [Nov/Dec2002]
7.
Discuss the various pitfalls in relational database design. [May/Jun2003]
8.
State the goals of normalization. Explain the different levels of normalization.
[May/Jun2006], [May/Jun2007], [Apr/May2008]
9.
Explain 1NF, 2NF and 3NF and BCNF with an example.
[May/Jun10],[Apr/May11],
[May/Jun12],[May/Jun2014]
10.
Explain the Boyce/Codd normal form with an example. Also state how it differs from that of 3NF. [May/Jun2010], [May/Jun2014]
11.
What a r e the pitfalls i n relational d a t a b a s e d e s i g n ? With a suitable example, explain the role of functional dependency in the process of normalization.
[May/Jun2003],
[Apr/May2011]
12.
Define a functional dependency. List and discuss the six inference rules for functional dependencies. Give relevant examples.
[Nov/Dec2011]
13.
Give a set of Functional dependencies for the relation schema R[A,B,C,D,E] with primary key AB under which R is in 2NF but not in 3NF.
[Nov/Dec2011]
14.
Prove that any relation schema with two attributes in BCNF.
[Nov/Dec2011]
15.
Consider a relation R that has three attributes ABC. It is decomposed in to Relations R i with attributes AB & R
2
with attributes BC. State the definition of lossless joint decomposition with respect to this example. Answer this question concisely by writing a relational algebra equation involving R, R
1
& R
2
.
[Nov/Dec2011]
16.
Describe about Multi/Valued Dependencies and Fourth normal form with suitable example.
[May/Jun2012]
17.
Explain in detail about all functional dependencies based normal forms with examples [Nov/Dec2012]
18.
Describe about the join dependencies and fifth normal form with examples [Nov/Dec2012]

19.
Consider the relation [May/Jun2013 ]
CAR/SALE[car#, date/sold, salesman#,commsion%,discount/amount]
Dependencies are
Date/sold

discount/amt
Salesman

Commision%
Based on the given primary key, is this relation 1NF, 2NF or 3NF? Why or Why not?
How would you normalize it completely?
20.
Explain the principles [May/Jun2013 ] a.
Loss less joid decomposition b.
Join dependencies c.
Fifth Normal Form
21.
What is redundant data? What are the problems caused by redundant data? [Nov/Dec13]
22.
Explain the process of normalization form 1NF to BCNF stage with example. [Nov/Dec13]
23.
Consider the relation R[A,B,C,D,E] with functional dependencies.{ A->BC,CD->E,B->D,
E->A}. Identify super keys. Find Fc,F+. [Nov/Dec13]
24.
Draw an ER diagram corresponding to customers and loans.
[May/Jun2014]
25.
Write a note on database languages.
[May/Jun2014]
26.
Explain the various operations in relational algebra with examples.
[May/Jun2014]
UNIT II
PART A
1.
Explain the basic structure of an SQL expression. [Nov/Dec2002]
2.
In what way is an embedded SQL differs from SQL.Discuss [May/Jun03], [Apr/May2011]
3.
List the various Join Operations [May/Jun2005]
4.
Write a SQL statement to find the names and loan no’s of all customers who have loan at
Chennai branch [N0v/ Dec2006]
5.
What are nested queries? Explain with example [Nov/ Dec2006]
6.
What are relational algebra operations supported in SQL [May/Jun2007]
7.
Define Query language and give its classification [May/Jun2007]
8.
What is static SQL? How does it differ from dynamic SQL? [Nov/Dec2007]
9.
Give the usage of the rename operation with an example. [May/Jun2010]
10.
What is embedded SQL? What are its advantages?
[May/Jun2014]
11.
List the two types of embedded SQL SELECT statements.
[Nov/Dec2011]

12.
Describe a circumstance in which you would choose to use embedded SQL rather than using
SQL alone.
[May/Jun2012]
13.
List two reasons why null values might be introduced in the database [Nov/Dec2012]
14.
What are primary key constraints? [May/Jun2013]
15.
Which operators are called as unary operators and why are they called so? [Nov/Dec2013]
16.
Give the diagrammatic representation to indicate the basic steps in query processing.
[Nov/Dec2002]
17.
How to choose the best evaluation plan for query. [May/Jun2003]
18.
How does pipelining improve query evaluation efficiency? [Nov/Dec2004]
PART B
1.
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 [May/Jun2013]
2.
Diagrammatically illustrate and discuss the steps involved in processing a query.
[Nov/Dec
2011], [May/Jun2014]
3.
Explain embedded SQL with suitable example [May/Jun2005], [May/Jun2014]
4.
Write short note on the following: [Nov/Dec2008]
[i]Data manipulation language[DML]
[ii]Data definition language[DDL]
[iii] Data control language [DCL]
5.
Consider the database schema
Emp [emp/name,type,birthday,set of[Exam/names], set of [Skills]]
Children[emp/name,ch/name,birthday]
Skills[type,set of[exam/names]]
Exams[exam/name,year,city]
Write SQL statements for the following queries. i.
Find the names of all employees who have a birthday in March as their children.

ii.
Find those employees who took an examination for the skill type “typing” in the city
“Chennai”. iii.
List all exam names under specific skill type for the given employee order than his exam names. iv.
Find the names of the city and year where the examination is going to be held for the given skill type. [Nov/Dec2013]
6.
Write a note on SQL facilities.
[May/Jun2014]
7.
Since indices speed query processing, why might they not be kept on several search keys?
List as many reasons as possible.
[Nov/Dec2011]
UNIT III
PART A
1.
Why it is necessary to have a control of current execution of transaction? [Nov/Dec2002]
2.
What is time stamp ordering scheme. [May/Jun2003]
3.
What is transaction? [May/Jun2004, May/Jun2010]
4.
What does time to commit mean?
[May/Jun2004]
5.
What are ACID properties ? [May/Jun2005], [Nov/Dec2007], [Nov/Dec2008],
[May/Jun2010], [May/Jun2013]
6.
State the benefits of strict two phase locking. [Nov/Dec2006], [Nov/Dec2007],
[May/Jun2012]
7.
Define deadlock. [May/Jun2008]
8.
When are two schedules conflict equivalent? [Nov/Dec2008]
9.
State the atomicity property of transaction. [May/Jun2009]
10.
What are two pitfalls [problems] of lock/based protocols? [May/Jun2010]
11.
List the two commonly used Concurrency Control techniques.
[Nov/Dec2011]
12.
List the SQL statements used for transaction control [Nov/Dec2011]
13.
List down the SQL facilities for concurrency.
[May/Jun2012]
14.
Define two phase locking [May/Jun2013]
15.
Brief about cascading rollback. [Nov/Dec2013]
16.
What is a rigorous two phase locking protocol? [Nov/Dec2013]

PART B
1.
Explain in detail ACID properties in transaction with example. [May/Jun2004],
[Nov/Dec2011], [Nov/Dec2013] , [May/Jun2014]
2.
When do you say that the system is in deadlock? Explain [Nov/Dec2004]
3.
Explain the two approaches of deadlock prevention. [Nov/Dec2004]
4.
Illustrate the states of transaction [Nov/Dec2005], [Nov/Dec2011]
5.
What is locking and explain various locking techniques. [May/Jun2006]
6.
Explain the different forms of serializability. [Nov/Dec2006], [May/Jun2010],
[Apr/May2011]
7.
Explain testing for Serializability with respect to concurrency control schemes. How will you determine whether a schedule is serializable or not. [Apr/May2008]
8.
Explain the following protocols for concurrency control: [Apr/May2008]
[i] Lock/based protocols.
[ii] Time stamp based protocols.
9.
[i] Explain Timestamp/based concurrency control protocol and the modifications implemented in it. [ii]Describe shadow paging recovery technique. [Nov/Dec2008]
10.
How concurrency is performed? Explain the protocol that is used to maintain the concurrency concept. [May/Jun2010]
11.
Explain Two/phase locking protocol.
[Nov/Dec2007] ,[Nov/Dec2011], [Apr/May2011],
[May/Jun2014]
12.
Define a transaction. Then discuss the following with relevant examples:

A read only transaction

A read write transaction

An aborted transaction [Nov/Dec2011]
13.
Explain the distinction between the terms serial schedule and serializable schedule. Give relevant example.
[Nov/Dec2011]
14.
Discuss in detail about transaction concepts and two phase commit protocol [Nov/Dec2012]
15.
What is the difference between conflict serializability and view serializability? Explain in detail with an example.
[Nov/Dec2013]
16.
Briefly explain ACID property with an example. [Nov/Dec2013]

UNIT IV
PART A
1.
Give the measures of a quality of a disc. [Nov/Dec2006]
2.
What are the two types of ordered indices? [Nov/Dec2006]
3.
Compare sequential access devices and random access devices. [Nov/Dec2007]
4.
Distinguish between dense and sparse indices. [Apr/May2008]
5.
Explain the following with relevant examples. [Apr/May2008]
i] B Tree
ii] B+ Tree
iii] Static and Dynamic hashing
6.
Describe flash memory. [May/Jun2010]
7.
List out the physical storage media . [May/Jun2010]
8.
What are the advantages and disadvantages of indexed sequential file?
[Apr/May2011]
9.
What is database tuning?
[Apr/May2011]
10.
Mention the different Hashing techniques.
[May/Jun2012]
11.
When is it preferable to use a dense index rather than a spare index? Explain your answer.
[May/Jun2012]
12.
How might the type of index available influence the choice of a query processing strategy?
[Nov/Dec2012]
13.
What is meant by data mining? [Nov/Dec2012]
14.
What is the need for RAID?
[May/Jun2013]
15.
What is the difference between between static hashing and dynamic hashing?
[May/Jun2013]
16.
What is slotted page sheet? Draw the diagram. [Nov/Dec2013]
PART B
1.
Define the structure of B+ tree. [May/Jun2003]
2.
What are the merits and demerits of B+ tree? [May/Jun2003]
3.
What are the different types of storage media? [May/Jun2003]
4.
Discuss briefly static and dynamic hashing. [May/Jun2004], [Nov/Dec2008]
Explain the use of index structure and explain the concept of ordered indices. [Nov/Dec2004]
5.
Describe a hash file organization. [Nov/Dec2004]

6.
Write a detailed note on hashing. [Nov/Dec2005], [May/Jun2014]
7.
Describe the structure of B+ tree and give the algorithm of B+ tree with example
[Nov/Dec2006], [Nov/Dec2007], [Nov/Dec2013]
8.
Describe about RAID levels [Nov/Dec2006, [May/Jun2010], [Nov/Dec2012],
[Nov/Dec2013]
9.
Describe the different types of file organization? Explain using a sketch of each of them with their advantages and disadvantages. [Nov/Dec2008]
10.
Mention the purpose of indexing. How this can be done by B+ tree? Explain.
[May/Jun2010]
11.
Describe the different methods of implementing variable length record.
[Apr/May2011]
12.
Explain the various indexing scheme used in database environment.
[Apr/May2011]
13.
When is it preferable to use a dense index rather than a sparse index? Explain your answer.
[Nov/Dec2011]
14.
Explain the distinction between closed and open hashing. Discuss the relative merits of each technique in database applications.
[Nov/Dec2011]
15.
Construct a B+ tree to insert the following key elements [order of the tree is 3]
5, 3, 4, 9, 7, 15, 14, 21, 22, [May/Jun2012]
16.
Describe in detail about how records are represented in a file and how to organize
them in a file.
[May/Jun2012]
17.
Write down detailed notes on ordered indices and B/tree index files [Nov/Dec2012]
18.
Construct a B+ tree to insert the following key elements [order of the tree is 3]
26,27,28,3,4,7,9,46,48,51,2,6 . [May/Jun2013]
19.
Explain in detail about distributed database.
[May/Jun2014]
20.
Explain Magnetic disk and tertiary storage.
[May/Jun2014]