Scribd
Upload
7 views

Dbmsass 2

Uploaded by

21amtics440
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
7 views

Dbmsass 2

Uploaded by

21amtics440
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

Asha M.

Tarsadia Institute of Computer Science and


Technology
Programme: B.Tech. CSE, B.Tech. CSE (CC), B.Tech. CE(SE)
Subject: CE4012 Databases Management Systems(2022-23)
Chapter 4:
1. Explain different ways of organizing records in a file.
2. State the differences between sparse index and dense index
3. State the comparison between B-tree and B+ tree.
4. Describe primary and secondary indexing
5. Consider a B-tree with key size=10bytes, block size 512 bytes, data pointer is of size 8 bytes
and block pointer is 5bytes.Find the order of B-tree?
6. Differentiate indexing and hashing.
7. Discuss data dictionary with an appropriate example.
8. List and describe RAID techniques.
9. Define RAID and Briefly Explain RAID techniques.
10. Construct B+ tree for the following set of key values – (2, 3, 5, 7, 11, 17, 19, 23, 29,
31). Assume that the tree is initially empty and the number of pointers that will fit in one
mode is 4
11. Discuss join order optimization and heuristic optimization algorithm.
12. Demonstrate the searching of given element in B+ trees with necessary example.
13. Discuss and describe bitmap indices with its usage.
14. Discuss about join order optimization and heuristic optimization algorithm
15. Describe dynamic hashing and explain mechanism of dynamic hashing
16. Discuss hashing along with its types.
17. List and describe various factors used to evaluate the indexing
18. It is easy to create index on all attributes of any given relation. Explain why it is not
recommended to create index on all attributes

Chapter 5:
1. Discuss the procedure to evaluate an expression in query processing
2. What is query processing? Explain each step involved in query processing with state
diagram.
3. How to measure cost of query? Explain with an example.
4. Explain various steps involved in query processing with functioning of each step
5. List the techniques to obtain the cost of a query and discuss any of them
6. Explain how an expression can be evaluated with the help of materialization and pipeline
approach
7. Write a short note on intrusion detection
8. Explain how an expression can be evaluated with the help of materialization and pipeline
approach.
9. What is meant by term heuristic optimization? Discuss the main heuristics that are applied
during query optimization
10. Explain steps of query processing with the help of a state diagram
11. Explain materialized views
12. Explain typical query processing strategies of DBMS
13. What are different techniques used in query optimization?
14. Discuss the procedure to evaluate an expression in query processing.
15. What are the problems in query optimization?
16. What are the four phases in a typical Query Processing in DBMS
17. Write a PL/SQL program that fetches records of all students and insert record as
students having CPI > 4 in ELIGIBLE table and students having CPI <= 4 in
NOT_ELIGIBLE table from student_master table
18. Let Relation R1(A,B,C) & R 2(C,D,E) have following properties. R1 has 10,000 tuples
& R2 has 15,000 tuples where 20 tuples of R1 on one block and 15 tuples of R2 on one
block. Estimate no. of block access required using each of the following join strategies of
R1 & R2 a) Merge Join b) Hash Join c) Block Nested Loop Join d) Nested Loop Join

Chapter 6:
1. Describe GRANT and REVOKE commands
2. Explain two phase commit protocol with its advantages
3. Describe TCL and DCL commands each with an example.
4. Explain three types of actions to be taken for recovery from deadlock
5. Describe timestamp based locking protocols.
6. Enlist and summarize different transaction states
7. Explain commit, rollback, and save point commands with an example.
8. Describe validation based locking protocols.
9. What is deadlock? Explain different deadlock prevention techniques
10. Explain atomicity, durability, isolation, and consistency preservation properties of a
database transaction.
11. Define transaction. Explain various states of transaction with suitable diagram.
12. Write a note on conflict serializability
13. Explain the Two-Phase lock Protocol and show how it ensures conflict serializability.
Two Phase lock protocol does not ensure freedom from deadlock explain with necessary
example. Also explain its two versions: strict two-phase lock protocol and rigorous two
phase lock protocol.
14. What is log based recovery? Explain immediate database modification technique for
database recovery
15. Define Failure? Explain Log based Recovery (deferred database modification and
immediate database modification)
16. List and explain various issues while transactions are running concurrently in DBMS
17. Explain three types of actions to be taken for recovery from deadlock
18. Explain validation-based protocol with an example.

You might also like