MODULE 1
1. Define: database, DBMS, entity, attribute, entity type, entity set, key attribute, domains of
attributes, value set, degree of relationship type, role name.
2. Characteristics of database approach.
-
3. Types of database users.
4. Advantages of using DBMS approach.
5. Categories of data models.
6. Three schema architecture.
7. Data independence.
8. DBMS components modules and their interactions.
9. Two-tier client/server architecture for DBMS.
10. Three-tier client/server architecture for DBMS.
11. Types of attributes.
12. Cardinality ratio.
13. Participation constraints.
14. Weak entity types, role of partial key in the design of weak entity type.
15. ER diagram examples.
MODULE 2
1. Relational model constraints.
2. Update operations and dealing with constraint violations.
3. Unary relation operations: select and project
4. Relational algebra operations from set theory.
5. Binary relational operations: join and division
6. Discuss the E.R to Relational mapping algorithm with example for each step.
7. Examples queries.
MODULE 3
1. Update anomalies.
2. Functional dependencies
3. Normalization, 1NF, 2NF, 3NF
4. Data types in SQL
/
5. Informal Design Guidelines for Relation Schemas
6. Constraints in SQL.
7. Retrieval queries in SQL.
8. Substring pattern matching.
9. INSERT, DELETE, and UPDATE statements in SQL.
MODULE 4
1. Demonstrate the System Log in database transaction.
2. Explain triggers, views, assertions in detail with examples
The schema designer should use CREATE ASSERTION only in cases where it is not
possible to use CHECK on attributes, domains, or tuples, so that simple checks are
implemented more efficiently by the DBMS.
3. Aggregate function and grouping in SQL
4. Schema change statements in SQL: DROP and ALTER
5. Transactions
6. Acid properties
7. Discuss the types of problems that may encounter with transactions that run
concurrently.
Why Concurrency Control Is Needed :Several problems can occur when concurrent
transactions execute in an uncontrolled manner.
➢ The Lost Update Problem. This problem occurs when two transactions that access
the same database items have their operations interleaved in a way that makes the
value of some database items incorrect.
➢ The Temporary Update (or Dirty Read) Problem. This problem occurs when one
transaction updates a database item and then the transaction fails for some reason.
Meanwhile, the updated item is accessed (read) by another transaction before it is
changed back (or rolled back) to its original value.
➢ The Incorrect Summary Problem. If one transaction is calculating an aggregate
summary function on a number of database items while other transactions are
updating some of these items, the aggregate function may calculate some values
before they are updated and others after they are updated.
➢ The Unrepeatable Read Problem. Another problem that may occur is called
unrepeatable read, where a transaction T reads the same item twice and the item is
changed by another transaction T′ between the two reads. Hence, T receives different
values for its two reads of the same item
8. Correlated nested queries
9. DBMS specific buffer Replacement policies
MODULE 5
1. Two-Phase Locking Techniques for Concurrency Control
2. Explain different types of NSOL and mango DB crud operations
3. Explain schedule with example
4. CAP THEOREM:
5. Neo4j data model
6. Describe the wit-die and wound-wait protocols for deadlock prevention.
7. Concurrency Control Based on Timestamp Ordering
8. Multiple Granularity Level Locking
