DATABASE MANAGEMENT SYSTEM

UNIT-1

7 MARKS:

1. What are the problems with traditional file processing system? Explain briefly
2. Why would you choose a database system instead of simply storing data in operating- system
files? Explain briefly
3. Describe in detail about Database Languages and Database users
4. Explain Database Applications with relevant examples.
5. Explain various database levels of Abstraction.
6. Discuss in detail about Data Independence and its types.
7. Explain Database System Architecture with neat diagram
8. Explain Storage Manager and Query Processor components of DBMS with neat diagram
9. Define ER diagram. Explain various components used in ER diagram.
10. Discuss about various types of attributes with suitable example.
11. State and explain various features of E-R Models.
12. Discuss the representation of weak entities, participation and key constraints in ER diagram
13. Describe about Generalization and Specialization with examples.
14. Describe about entity, entity set, relationship, relationship set with suitable examples
15. Define aggregation. Demonstrate aggregation using E-R diagram.
16. With an example briefly describe Aggregation versus Ternary Relationships

3MARKS:

17. Define DBMS? Specify the goals of DBMS?

18. Explain any four drawbacks of File processing system
19. Explain the functionalities of DBA.
20. Write a short notes on DML commands .
21. Write the importance of Logical data independence.
22. Differentiate Logical Schema and External Schema .
23. Explain the role of Query Processor component in DBMS.
24. Explain the role of Storage Manager component in DBMS.
25. Differentiate single valued and multi valued attributes with an example.
26. How to represent Entity sets and Relationship sets in an ER diagram? Quote suitable example
27. How to represent a weak entity set in an ER diagram? Quote suitable example
28. Give the diagrammatic representation of recursive relationship in an ER diagram
29. Explain about Generalization in an ER Model.
30. Explain about Specialization in an ER Model.
31. Explain about Aggregation in an ER Model.
32. Explain the distinction between Binary versus Ternary Relationship.
 2MARKS:

33. Define metadata.

34. Illustrate Create and Alter command syntaxes.
35. Give syntaxes to Update and Delete rows of a table
36. How do you add column to table and delete column from table?
37. Define Physical data independence.
38. Give syntaxes to DROP and TRUNCATE commands
39. What is the role of DBA?
40. What is the Purpose of Database System?
41. What is an Entity Relationship diagram and why it is useful?
42. Give an example for total participation in an E-R diagram
43. Give an example for partial participation in an E-R diagram
44. Draw an ER Diagram for Employee–Department relationship
45. Draw an ER Diagram for Student–Course relationship
46. Draw an ER Diagram for Professor–Course relationship
47. Draw an ER Diagram for Patient–Doctor relationship
48. Draw an ER Diagram for Sailors–Boats relationship

UNIT-2:

7MARKS:

49. List different types of Integrity constraints over relations and explain.
50. Discuss in detail about integrity constraints over relations with examples
51. Define Query. Describe how querying can be done in relational database.
52. Discuss in detail about Query processing in relational database.
53. Describe in detail about Logical database design with ER model.
54. Describe how to translate an ER diagram into a relational database schema.
55. Describe in detail about altering Views and Tables.
56. What is a view? With an example, briefly describe altering Views/Tables.
57. Discuss in detail about Selection and Projection operations of relational algebra with examples
58. Describe the application of relational algebra with selection and projection operations.
59. List out the set operations specified in relational algebra? explain with examples.
60. Discuss in detail about the Set operations of relational algebra with examples.
61. Discuss in detail about Division and Rename operators in relational algebra.
62. Describe about Rename and Division operators in relational algebra
63. What is join operation in relational algebra? Discuss in detail about variants of joins.
64. List different types of Joins in relational algebra and explain with examples.
 3MARKS:

65. Differentiate between relation schema and instance.

66. Explain about Foreign key with an example.
67. Write SQL queries to perform selection of relational databases.
68. Write SQL queries to perform modifications of relational databases.
69. Explain the translation of Relationship Sets to Tables
70. Explain the translation of Entity Sets to Tables
71. Write brief notes on altering tables and views
72. What restrictions are necessary to ensure that view is updatable?
73. Explain about Selection operation in relational algebra with an example.
74. Explain about Projection operation in relational algebra with an example.
75. Explain any two Set operations on relational algebra with an example.
76. Write about Cross-product operation in relational algebra.
77. Explain the Rename operator of Relational algebra with a suitable example.
78. Explain the Division operator of Relational algebra with a suitable example.
79. Explain about Natural join with a suitable example.
80. How does left outer join, right outer join works?

2MARKS:

81. What is a relational schema?

82. Define the degree of cardinality and arity of a relation.
83. What are integrity constraints?
84. Can a foreign key value in a database be NULL? Justify your answer.
85. " Consider the following relation:
86. Employee (eno:integer, name:string, dept:string, salary:real, city:string)
Answer the following queries in SQL:
i. Find the names of all employees who are living in vizag or Hyderabad.
ii. Find the names of all employees who are working in CSE dept."
87. "Consider the following relation:
Employee (eno:integer, name:string, dept:string, salary:real, city:string)
Answer the following queries in SQL:
i. Find the details of all employees whose name contains second character as ‘a’ and
name length should be 5
ii. Find the names of all employees who are living in city Vizag."
88. How are entity sets mapped into relations?
89. What is an updatable view?
90. "Consider the following relation:
Employee(eno:integer,name:string, dept:integer,salary:real)
Answer the following queries in the relational algebra:
i. Find the names of all employees whose salary is greater than 5000.
 ii. Find the names of all employees who are working in CSE dept."
91. Consider the join of a relation R with a relation S. If R has m tuples and S has n tuples then what
are the maximum and minimum sizes of the join respectively.

92. List the primitive operators in Relational Algebra.

93. Consider the following relations:
Sailors(sid:integer,sname:string, rating:integer,age:real)
Boats(bid:integer,bname:string,color:string);
Reserves(sid:integer,bid:integer,day:date) (Bold indicates the primary key) Answer the following
query in the relational algebra:
i. Find the details of all sailors who have reserved red boat and green boat."
94. Consider the following relations:
Sailors (sid: integer, sname:string, rating:integer,age:real)
Boats(bid:integer,bname:string,color:string);
Reserves(sid:integer,bid:integer,day:date) (Bold indicates the primary key) Answer the following
query in the relational algebra:
i. Find the sid’s of sailors who have reserved a red boat or green boat."
95. Consider the following relations:
Sailors(sid:integer,sname:string, rating:integer,age:real)
Boats(bid:integer,bname:string,color:string);
Reserves(sid:integer,bid:integer,day:date) (Bold indicates the primary key) Answer the following
query in the relational algebra:
i. Find the details of all sailors who have reserved red boat but not green boat."
96. "Consider the following relations:
Sailors(sid:integer,sname:string, rating:integer,age:real)
Boats(bid:integer,bname:string,color:string);
Reserves(sid:integer,bid:integer,day:date) (Bold indicates the primary key)
Answer the following query in the relational algebra:
i. Find the details of all sailors who have reserved boat103."
97. "Consider the following relations:
Sailors(sid:integer,sname:string, rating:integer,age:real)
Boats(bid:integer,bname:string,color:string);
Reserves(sid:integer,bid:integer,day:date) (Bold indicates the primary key)
Answer the following query in the relational algebra:
ii. Find the details of all sailors who have reserved all red boats."
 UNIT-3:

7MARKS:

98. Explain the syntax and semantics of Tuple Relational calculus.

99. "Schema: sailors(sid, sname, rating, age)
i. Boats( Bid, Bname, Color)
ii. Reserves(sid, bid, day)
Answer the below queries using Tuple Relational calculus for the given schema
Find the names and ages of sailors with a rating above 7.
Find the sailor id, boat id, and reservation date for each reservation.
Find the names of the sailors who reserved a boat on 1-1-2022
"
100. Define domain variable. Explain the semantics of Domain Relational Calculus.
101. Describe Domain Relational Calculus in detail.
"Schema:
Sailors(sid, sname, rating, age)
Boats( Bid, Bname, Color)
Reserves(sid, bid, day)
Answer the below queries using Domain Relational calculus for the given schema
i) Find the names of sailors who have reserved a red boat.
ii) Find the age of sailors whose rating is less than 9 and name is `JOHN``
iii) Find the bids of boats with color “red``

102. "Schema:
Sailors(sid, sname, rating, age)
Boats( Bid, Bname, Color)
Reserves(sid, bid, day)
Answer the below queries using Domain Relational calculus for the given schema
i) Find the names of the sailors who have reservations
ii) Find the boat ids which are reserved.
iii) Find the names of sailors who have reserved a red boat

103. Explain the SELECT statement structure of SQL with suitable examples.
104. Explain the various operators used in where clause to filter the data while retrieving.
105. What is a sub query? Explain the syntax of nested query with a suitable example.
106. Explain correlated queries with suitable example.
107. Discuss about aggregate operators of SQL.
108. Describe set comparison operators of SQL.
109. Describe the impact of AND, OR, NOT clauses with respect to SQL queries
 110. Explain the usage of primary key in the view of NULL values. Create a student table with
attributes sid, sname, address and phone number. Identify the primary key also.
111. Define the terms - Natural join, equi join and conditional join with suitable examples
with respect to SQL.
112. Explain the variants of outer joins with suitable SQL statements and /or Venn diagrams

3MARKS:

113. "Schema:
Sailors(sid, sname, rating, age)
Boats( Bid, Bname, Color)
Reserves(sid, bid, day)
Answer the below querry using Tuple Relational calculus for the given schema
Find the sailors who have reserved all red boats.

114. " Schema:

Sailors(sid, sname, rating, age)
Boats( Bid, Bname, Color)
Reserves(sid, bid, day)
Answer the below queries using Tuple Relational calculus for the given schema
Find the sailor names who reserved a boat with id 103
115. Identify the differences between TRC and DRC while defining the calculus variable.
116. What is an unsafe query? Give an example and explain why it is important to disallow
such queries
117. ". Schema:
Sailors(sid, sname, rating, age)
Boats( Bid, Bname, Color)
Reserves(sid, bid, day)
Answer the below queries using Domain Relational calculus for the given schema
Find the names of sailors who have reserved at least two boats
118. "Schema:
Sailors(sid, sname, rating, age)
Boats( Bid, Bname, Color)
Reserves(sid, bid, day)
Answer the below queries using Domain Relational calculus for the given schema
Find the names of sailors who have reserved all boats

119. Write a SQL query to display the employee’s first name and last name as concatenated
string.
120. Identify the difference between the SQL queries with and without using DISTINCT
keywords.
121. Identify the difference between nested queries and correlated queries
 122. Identify the difference between EXISTS and NOT EXISTS keyword.

123. Does HAVING clause requires GROUPBY as mandatory? Justify your answer with an
example.
124. How do you Compare NULL values of a relation?
125. What is the difference between AND, OR operators of SQL
126. How do you restrict that a table cannot have null values?
127. Illustrate the difference between inner join and cross product with suitable examples.
128. Illustrate the difference between LEFT Outer JOIN and RIGHT OUTER JOIN with a
suitable example.

2MARKS:

129. "Schema:
Sailors(sid, sname, rating, age)
Boats( Bid, Bname, Color)
Reserves(sid, bid, day)
Answer the below queries using Tuple Relational calculus for the given schema
Find the names of sailors who have reserved all boats.

130. "Schema:
Sailors(sid, sname, rating, age)
Boats( Bid, Bname, Color)
Reserves(sid, bid, day)
Answer the below queries using Tuple Relational calculus for the given schema
Find the names of sailors who have reserved all red boats.
"
131. "Schema:
Sailors(sid, sname, rating, age)
Boats( Bid, Bname, Color)
Reserves(sid, bid, day)
Answer the below queries using Domain Relational calculus for the given schema
Find the names and ages of sailors with a rating above 7.
"
132. "Schema:
Sailors(sid, sname, rating, age)
Boats( Bid, Bname, Color)
Reserves(sid, bid, day)
Answer the below queries using Domain Relational calculus for the given schema
 Find the names of sailors with age>35
"
133. "Schema:
Sailors(sid, sname, rating, age)
Boats( Bid, Bname, Color)
Reserves(sid, bid, day)
Answer the below queries using Domain Relational calculus for the given schema
Find the names of sailors who have reserved boat 103.

134. ". Schema:

Sailors(sid, sname, rating, age)
Boats( Bid, Bname, Color)
Reserves(sid, bid, day)
Answer the below queries using Domain Relational calculus for the given schema
Find the names of sailors who have reserved a red color boat with 103.

135. "Schema: employee (empid, empname, salary, designation, deptid).

Write the below query using SQL.
Retrieve the employee names whose salary is between 50000 and 100000

136. "Schema: employee (empid, empname, salary, designation, deptid)

Write the below query using SQL.
Retrieve the employees who ever are working in the department with id `12’.

137. "Answer the below query by considering the below schema .

Schema:
Student(sid, sname, address, phno)
Course( cid, cname, credits)
Enrolls(sid, cid, year)

find the student details who enrolled for a course called “DBMS`` using nested queries.

"Answer the below query by considering the below schema .

138. Schema:
Student(sid, sname, address, phno)
Course( cid, cname, credits)
Enrolls(sid, cid, year)
Find the course details where no student is enrolled, using nested queries.
"
139. "Schema:
 Student(sid, sname, address, phno)
Course( cid, cname, credits)
Enrolls(sid, cid, year)
From the above schema , find the student details who have enrolled for maximum number of
courses

140. "Schema:
Sailors(sid, sname, rating, age)
Boats( Bid, Bname, Color)
Reserves(sid, bid, day)"
"Schema:
141. Student(sid, sname, address, phno)
Course( cid, cname, credits)
Enrolls(sid, cid, year)
From the above schema, find the student details who have enrolled for the `DWDM’ but not for
` DBMS’ course.

142. "Schema:
Student(sid, sname, address, phno)
Course( cid, cname, credits)
Enrolls(sid, cid, year)
From the above schema, find the student details who have enrolled for the either `DWDM’ or `
DBMS’ course

143. "SELECT columns FROM TableA RIGHT OUTER JOIN TableB ON A.columnName =
B.columnName WHERE A.columnName IS NULL
What is the output of the above query?

144. ". SELECT * FROM table_A

FULL OUTER JOIN table_B
ON table_A.A=table_B.A;
What is the output of above Query??

UNIT-3
PART –B
7MARKS:

145. Explain the problems caused by Redundancy with examples.

146. Write about the anomalies caused by redundancy.
147. Define Functional Dependency. Explain with an example.
148. Write the Armstrong’s axioms
149. How do you verify weather two given FD sets are equal for a relation R?
 150. What is the process to verify two given FD sets over R are equal or not? Explain briefly
with an example.
151. What are the properties to be ensured while decomposing a relation? Explain them
briefly.
152. Does dependency preserving and lossless join are mandatory while decomposing a
relation
153. How do you identify whether a relation is in first normal form or not?
154. let a relation R contains 4 attributes and one of the attribute consists of multiple values
. What is the normal form that R is in?. Explain the scenario with an example.
155. Explain 3NF with a suitable example
156. What is transitive dependency? Explain with an example
157. Explain what is the need of BCNF? Justify with an example
158. Explain the differences between 3NF and BCNF with suitable examples.
159. Explain the need of fourth normal Form with a suitable example
160. Explain Multi Valued Dependency with comparison against BCNF

3MARKS:

161. State the need of decomposition with examples

162. When do you need the decomposition exactly? State with an example.
163. "Suppose that we have the following three tuples in a legal instance of a relation
schema S with three attributes ABC (listed in order): (1,2,3), (4,2,3), and (5,3,3).
Which of the following dependencies can you infer that does not hold over schema S?
(a) A -> B (b) BC -> A (c) B -> C

164. "Suppose that we have the following three tuples in a legal instance of a relation
schema S with three attributes ABC (listed in order): (1,2,3), (4,2,3), and (5,3,3).
Can you identify any dependencies that hold over S?

165. Identify the differences between trivial FD and Non- Trivial FD.
166. "Consider the relation R with five attributes ABCDE. If the relation R is having following
dependencies
A --> B, BC --> E, ED-->A
Identify the trivial and Non-trivial FDs from the above FD set

167. Consider a relation schema R ( A , B , C , D ) with the functional dependencies A -> B and
C -> D. Determine whether the decomposition of R into R1 ( A , B ) and R2 ( C , D ) is lossless or
lossy.
168. Let a relation R (A, B, C, D ) and functional dependency {AB –> C, C –> D, D –> A}.
Relation R is decomposed into R1( A, B, C) and R2(C, D). Check whether decomposition is
dependency preserving or not.
169. How to identify the partial dependency in a realtion? Give an Example.
170. State the second Normal Form with an example .
171. Describe the rules satisfied by relation R, If R is to be in 3NF.
172. What are the anomalies caused by transitive dependency? State a suitable example
173. "Suppose you are given a relation R with four attributes, ABCD. For each of the following
sets of FDs, assuming those are the only dependencies that hold for R. if the relation is not in
BCNF, decompose to upto BCNF.
FD set: .C -> D, C -> A, B -> C

174. "Consider the attribute set R = ABCDEF and the FD set is F={ABC-->DE, BC -->D, E-->F}.
Decompose the R, if it is not in BCNF."
175. Write a short notes on axioms to calculate (F)+ in case of MVD
176. "State the following rules
MVD Complementation, MVD Augmentation, MVD Transitivity

2MARKS:

177. let R is a relation with attributes A, B,C,D,E. if the data insertion is not possible until
unless other data provided, then what sort of anomaly it is???
178. let R is a relation with attributes A, B,C,D,E. if the attribute `D`` is updated in one
place and the same value is not updated at another place , then what sort of anomaly it is?
179. "Consider the relation R with five attributes ABCDE. If the relation R is having following
dependencies
A-->B, BC->E, ED-->A
List the all candidate keys possible.

180. "Consider the relation R with five attributes ABCDE. If the relation R is having following
dependencies
A-->B, BC --> E, ED --> A
List all super keys

181. "R=(A,B,C,D,E,F) , F1={A->BC, B->CDE, AE->F} , F2={A->BCF, B->DE, E->AB}

Check whether F1 and F2 are equivalent or not.

182. "Given a relational schema R( X, Y, Z ) set of functional dependencies P and Q such that:
P = { X -> Y, Y -> Z, Z -> X } and Q = { X -> YZ, Y -> X, Z -> X } using FD sets P and Q are equivalent or
not.

183. "Consider a relation R(A, B, C, D, E, F, G) with set of functional dependencies

F = {AD -> BF, CD -> EGC, BD -> F, E -> D, F -> C, D -> F}
 The relation R is decomposed into the following two relations after finding the minimal cover for
the above set of functional dependencies R1(A, B, C, D, E) and R2(A, D, F, G).
Use the functional dependencies in the minimal cover to determine the nature of this
decomposition.

184. "R(A,B,C,D) is a relation. Which of the following does not have a lossless join,
dependency preserving decomposition?
(A) A->B, B->CD (B) A->B, B->C, C->D (C) AB->C, C->AD"
185. Relation R has eight attributes ABCDEFGH. Fields of R contain only atomic values. F =
{CH -> G, A -> BC, B -> CFH, E -> A, F -> EG} is a set of functional dependencies (FDs) so that F+ is
exactly the set of FDs that hold for R. How many candidate keys does the relation R have?
186. Relation R has eight attributes ABCDEFGH. Fields of R contain only atomic values. F =
{CH -> G, A -> BC, B -> CFH, E -> A, F -> EG} is a set of functional dependencies (FDs) so that F+ is
exactly the set of FDs that hold for R. is the relation in 1NF OR 2NF?
187. Relation R has eight attributes ABCDEFGH. Fields of R contain only atomic values. F =
{CH -> G, A -> BC, B -> CFH, E -> A, F -> EG} is a set of functional dependencies (FDs) so that F+ is
exactly the set of FDs that hold for R. is the relation in 3NF?
188. Consider a relation R( P, Q, R, S, T, U, V, W, X, Y) wit FD = { PQ -> R, P -> ST, Q -> U, U ->
VW, and S -> XY}. Decompose the relation R into 3NF.
189. Consider the following relational schema:
Suppliers(sid:integer, sname:string, city:string, street:string)
Parts(pid:integer, pname:string, color:string)
Catalog(sid:integer, pid:integer, cost:real)
Assume that, in the suppliers relation above, each supplier and each street within a city has a
unique name, and (sname, city) forms a candidate key. No other functional dependencies are
implied other than those implied by primary and candidate keys. In which normal form the
above Relation is??

190. "Consider the following relational schemes for a library database: Book (Title, Author,
Catalog_no, Publisher, Year, Price) Collection (Title, Author, Catalog_no) with in the following
functional dependencies:
I. Title Author --> Catalog_no
II. Catalog_no --> Title, Author, Publisher, Year
III. Publisher Title Year --> Price
Assume {Author, Title} is the key for both schemes
In which Normal Form the above relation is in??

191. "Consider the following relational schemes for a library database: Book (Title, Author,
Catalog_no, Publisher, Year, Price) Collection (Title, Author, Catalog_no) with in the following
functional dependencies:
I. Title Author --> Catalog_no
II. Catalog_no --> Title, Author, Publisher, Year
 III. Publisher Title Year --> Price
Assume {Author, Title} is the key for both schemes
Is there any possibility of MVD ? Justify

192. Consider the attribute set R = ABCDEGH and the FD set F = {AB -> C, AC -> B, AD -> E, B ->
D, E -> G}. Is there any Multi Valued Dependency??

UNIT-4

7MARKS:

193. List the ACID properties of transaction. Explain the importance of each
194. Define Transaction. Illustrate and explain the transaction state diagram.
195. Explain the distinction between the terms serial schedule and concurrent schedule.
196. Explain the anomalies caused due to interleaved execution of transactions.
197. Define conflict serializability? Discuss in detail about conflict serializability with an
example.
198. Discuss in detail about view serializability with an example.
199. Describe recoverable schedules and non-recoverable schedules with an example of
each.
200. What is recoverable schedule? List and explain different types of recoverable schedules .
201. Describe in detail about Lock Based Protocols.
202. Discuss in detail about 2 phase locking protocol and strict 2 phase locking protocol.
203. State and explain the steps involved in Timestamp based concurrency control Protocol.
204. Discuss the validation based protocol in detail.
205. Describe in detail how Multiple-Granularity Locking works.
206. Describe about Multi version concurrency control protocol.
207. Define Deadlock? Explain about Deadlock prevention and detection methods.
208. Write short notes on deadlocks .Also depict wait-for graph to detect deadlock system.

3MARKS:

209. Transactions access data using two operations. What are they? Illustrate with an
example.
210. List the various states of transaction.
211. Why does DBMS interleave concurrent transactions?
212. What are the two good reasons for following concurrent executions of transactions?
213. Illustrate serial schedule with an example.
214. Differentiate between conflict equivalent and conflict serializable.
215. Discuss about cascading rollback.
216. Describe blind writes.
 217. Define lock compatibility matrix.
218. Protocol requires that each transaction issue lock and unlock requests in two phases.
List the phases.
219. Write the importance of Thomas’ write rule.
220. What is the difference between implicit and explicit locking?
221. What are the two different deadlock prevention schemes?
222. Describe intention lock modes.
223. Define Total rollback and Partial rollback
224. Write a short note on lock conversions.

2MARKS:

225. Differentiate between serial schedule and complete schedule.

226. Give an example of dirty read.
227. What are the properties of transaction?
228. What is a locking protocol?
229. What is a strict schedule?
230. What is a serializable schedule?
231. Describe strict 2PL.
232. Define the term blind write.
233. When are two schedules conflict equivalent?
234. What does lock manager do?
235. Give an example of a strict schedule that is not serializable.
236. Compare lock downgrades with upgrades.
237. What are the different modes of lock?
238. What is the graph used to depict deadlock.
239. List the prevention schemes in dead lock
240. What are TCL commands?

UNIT-5

7MARKS:

241. What are the properties required of LSNs? List and explain different types of log records.
242. Explain the purpose of the checkpoint mechanism. How often should check points be
performed? How does the frequency of checkpoints affect System performance when no failure
occurs and the time it takes to recover from a system crash?
243. Briefly describe the log based recovery algorithm.
244. List the recovery actions taken when the system crash occurs?
245. Describe the steal and force policies in the context of a buffer manager.
 246. Describe log based buffering and database buffering.
247. What are the roles of the Analysis, Redo and Undo phases in ARIES?
248. Aries recovers from a system crash in three phases. List the phases and explain each
phase.
249. Explain about primary index, secondary index, dense index and sparse index, clustered
and un-clustered indexes.
250. Discuss some important properties of an index that affect the efficiency of searches
using the index.
251. Explain how data is organized in a hash based index? When would you use a hash-based
index?
252. What is an index data structure? How is data organized in a tree based index? When
would you use a tree-based index? Explain.
253. Construct B+ tree for(1,4,7,10,17,21,31,25,19,20,28,42) with order 4.
254. Describe how search, insert and delete operations work in ISAM indexes and B+ tree.
255. Explain hash based indexing briefly.
256. Evaluate the cost of various operations on heap file organization.

3MARKS:

257. List the different types of log records.

258. Explain WAL protocol.
259. What is checkpoint? Discuss.
260. What do you mean by steal and no force approach policies?
261. What are the pros and cons of using fuzzy dumps for media recovery?
262. What are the similarities and differences between checkpoints and fuzzy dumps?
263. Explain concept of Buffer Manager taking real time example.
264. Describe the term fuzzy checkpoint.
265. What are the tables used in ARIES recovery algorithm?
266. List the design issues of remote back up system.
267. Differentiate between two safe and two very safe.
268. Show the architecture of remote backup system.
269. Draw the structure of B+ tree.
270. How does the allocation of pages takes place in ISAM trees?
271. Illustrate the static hashing scheme.
272. List the operations used to evaluate the cost of various file organizations.

2MARKS:

273. What are the different types of failures?

274. What are the fields of ULR?
275. What are the data items present in the log record?
276. When the database system is restarted after a crash, recovery actions take place in two
phases. What are they?
277. Illustrate an example of actions logged during normal operation, and actions performed
during failure recovery.
278. What are the data structures used in ARIES?
279. Illustrates the recovery actions performed by ARIES, on an example log.
280. State the term one-safe.
281. Differentiate between Dense and sparse indices.
282. Represent an ISAM structure.
283. What is the minimum space utilization for a B+ tree index?
284. What are the main characteristics of B+ tree?
285. What do you mean by overflow chain?
286. What is the main disadvantage between linear and extendible hashing?
287. Define the terms global depth and local depth.
288. Which is an efficient file organization? Heap file, sorted file or Hash file.