Hyderabad Institute of Technology and Management

Gowdavelli (V), Medchal Dist. 501401.

Faculty In-Charge:T. Raghavendra Gupta Year II
Subject Name :Subject Code:CS404PC Sem II

Q.N Bloom’
Question Marks Cos POs
O s Level
UNIT – III

1 What is normalization? What are the conditions required for a 10 L2 CO2 PO1
relation to be in 3NF and BCNF explain with example.
2 . What is normalization? Explain 4 NF and 5 NF with example. 5 L2 CO2 PO1

3 What do you mean by scheme refinement? Explain how it can be 5 L2 CO2 PO1
accomplished?
4 What are the problems caused by redundancy and decomposition of 5 L2 CO2 PO1
relation?
5 Describe about data query language? with examples? 5 L2 CO4 PO2

UNIT IV

1 Explain transaction states and desirable properties. 5 L2 CO3 PO1

2 How to test serializability of a schedule? Explain with an example 5 L2 CO3 PO1

3 Explain Time-stamp based concurrency control Protocol ? 5 L2 CO3 PO1

4 What Is transaction? Explain the ACID properties of transaction? 10 L2 CO3 PO1

With example?
5 Explain Conflict serializability and View serializability 5 L2 CO3 PO1

6 Explain Two phase locking protocol 5 L2 CO3 PO1

7 Explain briefly about Multiple Granularity? 5 L2 CO3 PO1

8 Explain Log based protocol with an example? 5 L2 CO3 PO1

9 Write about the concurrent control mechanisms without locking? 5 L2 CO3 PO1

10 Differentiate Transaction Recovery and Media Recovery? 5 L2 CO3 PO1

UNIT V

1 Explain Deletion and insertion operations in ISAM with example 5 L2 CO4 PO2

2 Explain various file organization methods. Give suitable examples to 5 L2 CO3 PO1
each of them.
3 Explain Deletion and insertion operations in linear hashing with 5 L2 CO3 PO1
example?
4 How does Extendable hashing use a directory of buckets? How does 5 L2 CO3 PO1
it handles insert and delete operations
5 Explain how insert and delete operations are handled in a static hash 5 L2 CO3 PO1
index
6 Explain deletion and insertion operation in B+ trees 5 L2 CO3 PO1

7 Compare linear hashing and extendable hashing 5 L2 CO3 PO1

8 Explain Primary, Cluster and Secondary Indexes 5 L2 CO3 PO1

9 Explain i)Hash Based indexing ii)Tree Based indexing 5 L2 CO3 PO1

10 Compare Hash indexing and B+ tress indexes 5 L2 CO3 PO1