UNIT I 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. 11. 12. 13. 14. 15. 16. 17. 18. 19. 20.

. List out any two differences between FPS and DBMS List out the advantages of DBMS Define Consistency and Redundancy Define Entity, Attibute and Relationship set Define Normalization and 2NF Define 3NF What is the difference between 3NF and BCNF? Define Functional Dependency and Define 1NF List out the six steps involved in database design process. Write about Participation Constraints Differentiate between weak and strong entities Define Specialization Define Generalization Define Aggregation What are integrity constraints? What is a Relational Model? How do you create a relation using SQL? What are domain constraints? What is a foreign constraint? What is a view? How do you update a view? UNIT-II 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. 11. 12. 13. 14. 15. 16. 17. 18. 19. 20. Write about Relational Algebra. List out the operators in relational algebra. What the conditions for two relations to be union compatible? List out the set operations in relational algebra Write about join operation in RA Write about division operator in RA Write about select, project and rename operator in RA Write about Tuple Relational Calculus Write about Domain Relational Calculus List out the features of SQL. Write the complete syntax of SELECT statement. What are Nested Queries? What are Correlated Nested Queries? Which Aggregate Operators does SQL support? Explain GROUP BY and HAVING clause. What is a trigger and what are its parts? What is a Cursor? What is Dynamic SQL? What is Embedded SQL? What are assertions?

UNIT-III

1. 2. 3. 4. 5. 6. 7. 8. 9. 10. 11. 12. 13. 14. 15. 16. 17. 18. 19. 20.

Where does a DBMS store persistent data? What is file organization? What is the search key for an index and what is a data entry in an index? What is the difference between clustered index and primary index? How data is organized in a tree based index? How data is organized in hash based index? What is a composite search key? Which operations are used to compare the file organizations? Why tree structured indexes good for searches especially range selections? What is the order of B+ tree? What is the main difference between ISAM and B+ tree indexes? Describe how search operation works in ISAM index What is static hashing? What is a hashing function? What is local depth and global depth? What is directory doubling in extendible hashing? What is linear hashing? What is the relationship between Extendible and Linear hashing? Explain why local and global depth are needed What are collisions? UNIT-IV

1. 2. 3. 4. 5. 6. 7. 8. 9. 10. 11. 12. 13. 14. 15.

List out the ACID properties. Define the terms transaction and schedule? What is a complete schedule? What is a serial schedule? What is a serializable schedule? List out anomalies due to interleaved execution of transitions What is dirty read and dirty page? Write about blind write. What is a lost update? Define Locking protocol. List out the rules of strict two phase locking. What is the difference between recoverable schedule and irrecoverable schedule? What is a deadlock? When do you say two schedules as conflict equivalent? What is conflict serializable and view serializable ?

16. 17. 18. 19. 20. 21.

What is a serializability graph? Write about Two Phase Locking(2PL). When can you say that two schedules are view equivalent? What is a phantom problem? What are the phases of optimistic concurrency control? What is Thomas write rule?

UNIT-V 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. 11. 12. 13. 14. 15. 16. 17. 18. 19. 20. What are the phases of ARIES recovery algorithm? What are the three main principles behind ARIES recovery algorithm? What is WAL protocol? What is a LOG? Define the terms log tail, LSN. List out the actions for which a log record is written. What is CLR? What is a transaction table? What is a dirty page table? What are the contents of update log record? Define Checkpoint and list the three steps of check pointing in ARIES algorithm Write about Analysis phase in ARIES Write about REDO in ARIES Write about media recovery. How does SQL support discretionary access control? Write about the Bell LaPadula Model What is Simple Security Property? What are the different classes in Bell-LaPadula model? What is the role of DBA? Write the syntax of GRANT and REVOKE commands UNIT-I Fill in the blanks: 1. A DBMS is a piece of software designed to make the preceding tasks easier. 2. A data model is a collection of high level data description constructs that hide many low level storage details. 3. A semantic data model is a more abstract, high level data model that makes it easier for a user to come up with a good initial description of the data in an enterprise. 4. The central data description construct in relational model is relation. 5. Relation is a set of records. 6. A description of data in terms of a data model is called a schema.

7. The entity-relationship data model allows us to describe the data involved in a real world enterprise in terms of objects and their relationships and is widely used to develop an initial database design. 8. An entity is an object in the real world that is distinguishable from other objects. 9. An entity is described using a set of attributes. 10. A key is a minimal set of attributes whose values uniquely identify an entity in the set. 11. A relationship is an association among two or more entities. 12. Descriptive attributes are used to record information about the relationship rather than about any one of the participating entities. 13. An instance of a relationship set is a set of relationships. 14. A participation that is not total is said to be partial. 15. A weak entity can be identified uniquely only by considering some of its attributes in conjunction with the primary key of another entity, which is called the identifying owner. 16. The weak entity set must have total participation in the identifying relationship set. 17. Specialization is the process of identifying subsets of any entity set that share some distinguishing characteristic. 18. Generalization consists of identifying some common characteristics of a collection of entity sets and creating a new entity set that contains entities possessing these common characteristics. 19. Overlap constraints determine whether two subclasses are allowed to contain the same entity. 20. Covering constraints determine whether the entities in the subclasses collectively include all entities in the super class. 21. Aggregation allows us to indicate that a relationship set participates in another relationship set. 22. A relation consists of relation schema and relation instance 23. A domain is referred to in a relation schema by the domain name and has a set of associated values. 24. An instance of a relation is a set of tuples also called records. 25. The degree/arity of a relation is the number of fields. 26. The cardinality of a relation instance is the number of tuples in it. 27. A relational database is a collection of relations with distinct relation names. 28. An instance of a relational database is a collection of relation instances, one per relation schema in the database schema. 29. The CREATE TABLE statement is used to define a new table. 30. Tuples are inserted using the INSERT command. 31. Tuples can be deleted using DELETE command. 32. An integrity constraint is a condition specified on a database schema and restricts the data that can be stored in an instance of the database. 33. If a database instance satisfies all the integrity constraints specified on the database schema, it is a legal instance. 34. A key constraint is a statement that a certain minimal subset of the fields of a relation is a unique identifier for a tuple. 35. A set of fields that uniquely identifies a tuple according to a key constraint is a called a candidate key for the relation. 36. Two distinct tuples in a legal instance cannot have identical values in all the fields of a key. 37. No subset of the set of fields in a key is a unique identifier for a tuple.

38. The most common integrity constraint involving two relations is a foreign key constraint. 39. A query language is a specialized language for writing queries. 40. An entity in A is associated with at most one entity in B, and an entity in B is associated with at most one entity in A represents one to one relationship. 41. When all the entities from an entity set participate in a relationship type, is called total participation. 42. A view is a table whose rows are not explicitly stored in the database but are computed as needed from a view definition. 43. DROP TABLE is used to remove the table permanently from the database. 44. -----------------first developed the process of normalization 45. A relation is in first normal form if every field contains only atomic values. 46. The lossless join property enables us to recover any instance of the decomposed relation from corresponding instances of the smaller relations. 47. The dependency preservation property enables us to enforce any constraint on the original relation by simply enforcing some constraints on each of the smaller relations. 48. A relation is in BCNF if and only if every determinant is a candidate key. 49. A relation is said to be in the ______________ when transitive dependencies are removed. 50. Normalization involves decomposition of a relation in to smaller relations based on the concept of functional dependency to overcome undesirable anomalies UNIT-II Relational Algebra defines basic set of operations for manipulating relational data. Relational algebra is a procedural query language. The operation union returns a relation consisting of all tuples appearing in either or both of two specified relations. Two relations are union compatible if names of attributes are the same in both the relations. Union compatible relations can be combined using union, intersection and set difference. Select operator in relational algebra is _________ Project operator in relational algebra is ___________ The cross product operation is sometimes called as Cartesian product. The tuple variable is a variable that takes on tuples of a particular relation schema as values. A tuple relational calculus query has the form {T|p(T)} A variable is said to be free in a formula if the formula does not contain an occurrence of a quantifier that binds it. A domain variable is a variable that ranges over the values in the domain of some attribute. If a query language can express all the queries that we can express in relational algebra it is said to be relationally complete. Embedded SQL features allow SQL code to be called from a host language such as C or COBOL. Dynamic SQL features allow a query to be constructed and executed at run-time. An active database has a collection of triggers, which are specified by the DBA. DISTINCT keyword is used in SELECT statement to eliminate duplicate rows. A nested query is a query that has another query embedded within it. An embedded query is called a subquery.

1. 2. 3. 4. 5. 6. 7. 8. 9. 10. 11. 12. 13. 14. 15. 16. 17. 18. 19.

20. A trigger is a procedure that is automatically invoked by the DBMS in response to specified changes to the database and it is specified by the DBA. 21. The three parts of a trigger are Event, condition and action. 22. Condition is a query or test that is run when the trigger is activated. 23. Action is a procedure that is executed when the trigger is activated and its condition is true. 24. Event is a change to the database that activates the trigger. 25. The execution of the action part of a trigger can again activate the same trigger, such triggers are called recursive triggers. 26. In row level triggers, an event is triggered for each row updated, inserted or deleted. 27. In statement level triggers, and event is triggered for each SQL statement executed. 28. A cursor is a temporary work area created in the system memory when a SQL statement is executed. 29. The FETCH command is used to read the first row of the cursor into host language variables 30. The cursor declaration is processed at compile time and open command is executed at run-time. 31. If the keyword INSENSITIVE is specified the cursor behaves as if it is ranging over a private copy of the collection of answer rows. 32. A holdable cursor is specified using the WITH HOLD clause and is not closed when the transaction is committed. 33. A cursor is updatable by default. 34. Join is used to combine rows from two or more tables, based on a common field between them. 35. The execution of the action part of a trigger could in turn activate another trigger. 36. SQL supports the creation of assertions, which are constraints associated with more than one table. 37. A new domain can be defined using the CREATE DOMAIN statement. 38. The INNER JOIN keyword selects all rows from both tables as long as there is a match
between the columns in both tables.

39. The LEFT JOIN keyword returns all rows from the left table (table1), with the matching rows in
the right table (table2).

40. The RIGHT JOIN keyword returns all rows from the right table (table2), with the matching
rows in the left table (table1).

41. NULL is used when the column value is either unknown or inapplicable.
42. The GROUP BY clause can be used in an SQL SELECT statement to collect data across multiple records and group the results by one or more columns. 43. The SQL HAVING clause is used in combination with the SQL GROUP BY clause. 44. Count() returns the number of values in a column 45. Sum() returns the sum of all values in a column 46. AVG() returns the average of all values in a column 47. MAX() returns the maximum value in a column 48. MIN() returns the minimum value in the column. 49. The query to display all the columns and rows in a table is Select * from table; 50. Query to display system date select sysdate() from dual

UNIT-III 1. The basic abstraction of data in a DBMS is a collection of records. 2. A file organization is a method of arranging the records in a file when the file is stored on disk. 3. Disks are the most important external storage devices.

4. Tapes are sequential access devices and force us to read data one page after the other. 5. Space on disk is managed by the disk space manager. 6. Data is read in to memory for processing and written to disk for persistent storage, by a layer of software called the buffer manager. 7. Scan operation allows us to step through all the records in the file one at a time. 8. The simplest file structure is an unordered file/heap file. 9. Index is a data structure that organizes data records on disk to optimize certain kinds of retrieval operations. 10. An index on a set of fields that includes the primary key is called a primary index. 11. Two data entries are said to be duplicates if they have the same value for the search key field associated with the index. 12. If the search key contains some candidate key , we call the index a unique index. 13. In hash based indexing files are grouped in buckets. 14. The bucket to which a record belongs can be determined by applying a special function called a hash function to the search key. 15. The hash function coverts the search key value to its binary representation and uses the two least significant bits as the bucket identifier. 16. The lowest level of the tree is called leaf level. 17. The B+ tree is an index structure that ensures that all paths from the root to a leaf in a given tree are of the same length, that is the structure is always balanced in height. 18. In tree based indexing all searches begin at the topmost node called the root. 19. The height of a balanced tree is the length of a path from root to leaf. 20. The average number of children for a non-leaf node is called the fan-out of the tree. 21. UNIT-IV UNIT-V 1. In analysis phase the recovery manager identified ____________ in the buffer pool 2. In redo phase, ____________ all actions and restore the database state to what it was at the time of crash. 3. In undo phase, ______________ the actions of transactions that did not commit. 4. ARIES algorithm is designed to work with ________ approach 5. The recovery manager when invoked after a crash, restart proceeds in ________ number of phases. 6. __________ is a part of DBMS that is responsible for the restorage of the database to a consistent state after a system crash 7. ___________ is a history of actions executed by DBMS, that is stored in a __________ that is assumed to service crashes. 8. Main principles of ARIES algorithm are write- ahead logging, repeating history during redo and ________________ 9. Every log record has an associated _____________ that is monotonically increasing and indicates the address of log record on the disk. 10. ________________is the most recent portion of the log, which is kept in main M/O. 11. Transaction table contains TransID,________________ and _____________ fields. 12. Dirty page table contains ____________, ______________ fields.

13. In addition to log, ________________, __________________ are other recovery related structures that are used by recovery manager to restore from crash. 14. ______________ is written into log just before the change recorded in an update log record is undone. 15. The CLR contains a field called ____________ which is the LSN of the next log record that is to be undone. 16. Unique Id for every log