CS2255 Data Base Management Systems question bank

QUESTION BANK

UNIT IV

PART A - Two Mark Questions

1. What is transaction?
2. What are the two statements regarding transaction?
3. What are the properties of transaction?
4. What is recovery management component?
5. When is a transaction rolled back?
6. What are the states of transaction?
7. What is a shadow copy scheme?
8. Give the reasons for allowing concurrency?
9. What is average response time?
10. What are the two types of serializability?
11. Define lock?
12. What are the different modes of lock?
13. Define deadlock?
14. Define the phases of two phase locking protocol
15. Define upgrade and downgrade?
16. What are the two methods for dealing deadlock problem?
17. What is a recovery scheme?
18. What are the two types of errors?
19. What are the storage types?
20. Define blocks?
21. What is meant by Physical blocks?
22. What is meant by buffer blocks?
23. What is meant by disk buffer?
24. What is meant by log-based recovery?
25. What are uncommitted modifications?
27. Define shadow paging.
28. Define page.
29. Differentiate strict two phase locking protocol and rigorous two phase locking
protocol.
30. How the time stamps are implemented?
31. What are the time stamps associated with each data item?
32. Define transaction-processing systems.
33. Define read only transaction.
34. When does the transaction go into an active state and partially committed state?
35. What is called as committed state?
36. Define ACID property.
37. What is isolation of ACID properties?
38. Define cascading rollback.
39. What is called as a time stamp?
40. What is shared lock and Exclusive lock?
41. When does a deadlock occur?
42. What is meant by transaction rollback?
43. Write the reasons for using concurrent execution.
44. Define recoverable schedule.
45. What are the objectives & phases of concurrency control?
46. What are the types of locking protocols?
47. What are the problems that occur in transaction if they run concurrently?
48. What are the types of failures?
49. What are the transaction operations?
50. When does a transaction reach its commit point?
51. What are the properties of transaction?
52. Define consistent state.
53. When is a schedule said to be serial?
54. When is a schedule serializable?
55. Define precedence graph or serialization graph?
56. What is a lock?
57. What is a binary lock?
58. What are the fields present in a lock?
59. What are the locking operations of a shared/exclusive lock?
60. What are the phases in a locking transaction?
70. What are the values present in a timestamp algorithm?
71. What are the phases in concurrency control protocol?

PART – B (16 MARK QUESTIONS)

1. Explain ACID in detail.

2. Explain serializability
3. Explain lock based protocols
4. Explain two phase locking in detail.
5. Explain log based recovery in detail.
6. Explain: Locking techniques for Concurrency Control
7. Explain the process of concurrency control based on timestamp ordering.