DBMS

Unit I: Introduction Topic 1.1: Overview, Database System vs File System

 17-18(1.b) Write Advantages of Database.

 22-23(1.a) List any four disadvantages of file system approach over database approach.
Topic 1.2: Database System Concept and Architecture

 17-18(2.a) Discuss the role of database administrator.

 18-19(1.b) Discuss three level of abstractions of schemas architecture of DBMS.

 18-19(2.e) Draw overall structure of DBMS and explain its components in brief.

 20-21(3.a) What is Data Abstraction? How the Data Abstraction is achieved in DBMS?

 21-22(2.a) Draw the overall structure of DBMS and explain its various components.

 22-23(3.a) Describe the three-schema architecture. Why do we need mappings between

schema levels? How do different schema definition languages support this architecture?

 23-24(2.a) Discuss three level of abstractions or schemas architecture of DBMS.

 23-24(3.b) Discuss the role of database administrator & explain the database
architecture.

 24-25(2.a) Explain the architecture of DBMS in terms of its components with a proper
diagram. Topic 1.3: Data Model Schema and Instances

 21-22(3.a) What are the different types of Data Models in DBMS? Explain them.

 22-23(3.b) What are the different types of Data Models in DBMS? Explain them. Topic
1.4: Data Independence and Database Language and Interfaces

 17-18(1.d) Explain Logical data Independence.

 19-20(2.a) Explain data independence with its types.

 20-21(1.a) What is Data Independency in DBMS?

 21-22(1.a) What is the significance of Physical Data Independence?

 22-23(1.b) Differentiate between physical and logical data independence.

 24-25(3.a) Illustrate the concept of data independence and its type with example. Why is
it required?

 17-18(1.c) Define DML.

 17-18(7.a) Explain all database languages in detail with example.

 18-19(7.a) Explain all database languages in detail with example.

 19-20(3.b) Discuss the following terms (i) DDL Command (ii) DML Command

 20-21(1.b) Write the difference between DDL and DML.

 23-24(3.a) State the procedural DML and nonprocedural DML with their differences.
Topic 1.5: Data Definitions Language, DML

 See above for DDL, DML. Topic 1.6: Overall Database Structure

 See architecture topics. Topic 1.7: ER Model Concepts, Notation for ER Diagram,
Mapping Constraints

 18-19(1.a) Explain the difference between weak and strong entity set with example.

 19-20(1.e) What is Strong & Weak Entity set?

 20-21(2.a) What is ER Diagram? Explain different Components of an ER Diagram with

thier Notation. Also make an ER Diagram for Employee Project Management System.

 21-22(1.c) When a relation set is called a recursive relationship set?

 22-23(2.a) A database is being constructed to keep track of the teams and games of a
sport league. A team has a number of players, not all of whom participate in each game.
It is desired to keep track of players participating in each game for each team, the
positions they play in that game and the result of the game. (i) Design an E-R schema
diagram for this application. (ii) Map the E-R diagram into relational model.

 23-24(4.a) What is ER Diagram? Explain different components of an ER Diagram with

employee project Management system.

 23-24(1.b) What is strong & weak entity set?

 24-25(3.b) Explain the process of reducing an ER diagram to tables. Provide a simple

example. Given the following ER diagram representing a university database: Entities:
Student: Attributes - StudentID (Primary Key), Name, Email Course: Attributes - CourseID
(Primary Key), CourseName, Credits Enrollment: Attributes - EnrollmentID (Primary Key),
DateEnrolled Relationships: Enrolls: A many-to-many relationship between Student and
Course, represented by the Enrollment entity. a) Reduce the ER diagram to relational
 tables by listing the tables and their corresponding attributes. b) Identify primary keys
and foreign keys in the tables you created.

 19-20(2.b) Describe mapping constraints with its types. Topic 1.8: Keys, Concepts of
Super Key, Candidate Key, Primary Key, Generalization, Aggregation

 17-18(5.a) Explain the Primary Key, Super Key, Foreign Key and Candidate key with
example.

 18-19(1.e) Write the difference between super key and candidate key.

 18-19(2.d) Explain Primary Key, Super Key, Foreign Key and Candidate key with example.

 19-20(1.d) Define Super Key, Candidate key, Primary key & Foreign key

 19-20(2.c) Explain Key. Explain various types of keys.

 23-24(1.a) What is the concept of keys in database?

 24-25(1.a) Define candidate key and super key with example. Topic 1.9: Generalization,
Aggregation, Reduction of an ER Diagrams to Tables, Extended ER Model, Relationship of
Higher Degree

 17-18(1.a) Explain Specialization.

 17-18(4.b) Draw an ER diagram of Hospital or Bank with showing the Specialization,

Aggregation, Generalization. Also convert it in to relational schemas and SQL DDL.

 18-19(3.a) Compare Generalization, Specialization and aggregation with suitable

example.

 19-20(1.c) What do you mean by Aggregation?

 20-21(3.b) Explain the following with example (i) Generalization (ii) Specialization (iii)
Aggregation

 21-22(4.b) What do you mean by trigger? Explain it by a suitable example.

Unit II: Relational data Model and Language

Topic 2.1: Relational Data Model Concepts

 19-20(1.a) What is Relational Algebra?

 21-22(1.e) What is Relational Calculus? Topic 2.2: Integrity Constraints, Entity Integrity,
Referential Integrity, Keys Constraints, Domain Constraints

 17-18(1.e) Explain Entity Integrity Constraints.

 18-19(1.c) Define constraint and its types in DBMS.

 20-21(1.c) What are different Integrity Constraints?

 22-23(1.d) What are different Integrity Constraints?

 23-24(1.c) Explain referential integrity.

 23-24(1.d) Explain entity integrity constraints. Topic 2.3: Relational Algebra

 17-18(4.a) Consider the following relation. The Primary key is Rollno, Isbn,
Student(RollNo, Name, Branch), Book(Isbn, Title, Author, Publisher) Issue(Rollno, Isbn,
te_of_issue). Write the query in Relational algebra and SQL of the following- i) List the
Roll Number and Name of All CSE Branch Student. ii) Find the name of students who
have issued a book of publication ‘BPB’. iii) List the title and author of all books which are
issued by a student name started with a. iv) List the title of all books issued on or before
20/09/2012. v) List the name of student who will read the book of author named
‘Sanjeev’.

 20-21(2.b) What is Relational Algebra? Explain Different Operations of Relational Algebra

with Example.

 21-22(2.b) Which relational algebra operations require the participating tables to be

union-compatible? Give the Reason in detail.

 21-22(4.a) Consider the following schema for institute library: Student (RollNo, Name,
Father_ Name, Branch) Book (ISBN, Title, Author, Publisher) Issue (RollNo, ISBN, Date-of
–Issue) Write the following queries in SQL and relational algebra: I) List the Roll Number
and Name of all CSE Branch Student. II) Find the name of students who have issued a
book of publication ‘ABC’. III) List the title and author of all books which are issued by a
student name 'RAM'. IV) List the title of all books issued on or before 1/12/2020. V) List
all books published by publisher ‘ABC’.

 22-23(4.a) Consider the following schema for institute library: Student (RollNo, Name,
Father_ Name, Branch) Book (ISBN, Title, Author, Publisher) Issue (RollNo, ISBN, Date-of
–Issue) Write the following queries in SQL and relational algebra: (i) List roll number and
name of all students of the branch ‘CSE’. (ii) Find the name of student who has issued a
book published by ‘ABC’ publisher. (iii) List title of all books and their authors issued to a
 student ‘RAM’. (iv) List title of all books issued on or before December 1, 2020. (v) List all
books published by publisher ‘ABC’

 19-20(6.b) Give the following queries in the relational algebra using the relational
schema student(id, name, code) enrolled(id, code) subject(code, lecturer) i) What are
the names of students enrolled in cs3020? ii) Which subjects is Hector taking? iii) Who
teaches cs1500? iv) Who teaches at least two different subjects? v) What are the names
of students in both cs1500 and cs1200?

 19-20(7.b) Consider the following relational schema. Company (Company_name, city)

Employee(person name, street , city) Works(person name, company name, salary)
Managed(person name, manager name) Give an expression in SQL for the following
queries. i) Find the name of all employees who works for the ABC bank ii) Find the name
of all employees who live in the same city and on the same street as do their managers
iii) Find the name of all employees who earn more than 7,000 per annum iv) XYZ the
name of all employees who earn more than every employee of XYZ v) Give all tuples in
the works relation for employees of ABC a 7% salary raise. vi) Find the name of all
company for which they work who live in the same city as the company

 24-25(4.b) Consider the following three relation schema S, P and SP in which S# is

supplier code, P# part number and qty is quantity and others carry their respective
meanings: S(S#, SNAME, SCITY, TURNOVER) P(P#,WEIGHT, COLOR, COST, SELLING PRICE)
SP(S#, P#, QTY) Construct the appropriate RA statement for the following queries. i Get
all details of supplier who operate from CALCUTTA with TURNOVER=80. ii Get part
numbers weighting between 25 and 55. iii Get the part# which has cost greater than
selling price. iv Get the part numbers whose color is red or black. v Get the SNAME
where S# is 101. Topic 2.4: Relational Calculus, Tuple and Domain Calculus

 19-20(4.a) What is tuple relational calculus and domain relational calculus? Topic 2.5:
Introduction on SQL: Characteristics, Advantage of SQL

 20-21(1.d) Explain different Features of SQL. Topic 2.6: SQL Data Type and Literals

 None specific. Topic 2.7: Types of SQL Commands

 22-23(1.c) What is the difference between DROP and DELETE command?

 24-25(1.b) Differentiate TRUNCATE and DELETE command Topic 2.8: SQL Operators and
Their Procedure

 None specific. Topic 2.9: Tables, Views and Indexes

 None specific. Topic 2.10: Queries and Sub Queries

 See the SQL queries in Topic 2.3

 17-18(2.b) Discuss Join and Types with suitable example.

 18-19(3.b) Write difference between Cross Join, Natural Join, left outer join and right
outer join with suitable example.

 18-19(1.g) What is Equi-Join in database?

 19-20(3.a) Define Join. Explain different types of join.

 21-22(1.f) What is Equi-Join in database?

 21-22(1.g) What is a CLAUSE in terms of SQL?

 22-23(2.b) What are Joins? Discuss all types of Joins with the help of suitable examples.

 23-24(4.b) Write difference between cross join, Natural join, left outer join and right
outer join with suitable example.

 24-25(2.b) Explain Joins? Discuss all types of Joins with the help of proper example of
each.

 20-21(4.b) Explain Procedure in SQL/PL SQL.

 24-25(4.a) Employee (ename, street, city) Worksfor (ename, company_name, salary)

Company (company_name, city) Construct the SQL statements for the following (i)
Create the above given tables with suitable data types and size. (ii) Find the name of
employees who live in the same city where they work. (iii) Find the name of employees
who have salary more than Rs. 50000. (iv) Find the name of employees who don’t work
in “tcs” company. (v) Find all employees whose name has second letter ‘A’. (vi) Find the
employee’s name having second highest salary. Topic 2.11: Aggregate Functions

 20-21(4.a) What is Aggregate Function in SQL? Write SQL query for different Aggregate
Function.

 23-24(2.b) What is Aggregate function in SQL? Write SQL query for aggregate function.
Topic 2.12: Insert, Update and Delete Operations

 None specific. Topic 2.13: Joins, Unions, Intersection, Minus

 See joins above. Topic 2.14: Cursors, Triggers, Procedures in SQL/PL SQL

 17-18(2.c) What is Trigger? Explain different trigger with example

 19-20(4.b) Describe the following terms : (i) Multivalued Dependency (ii) Trigger

 21-22(4.b) What do you mean by trigger? Explain it by a suitable example.

  22-23(4.b) Explain different types of Triggers in SQL/PL SQL.

 23-24(2.c) Describe the following terms: (i) Multivalued dependency (ii) Trigger

 24-25(1.c) Define triggers and its types.

 21-22(1.d) What do you mean by currency with respect to database?

Unit III: Data Base Design & Normalization

Topic 3.1: Functional dependencies

 18-19(4.a) Define partial functional dependency. Consider the following two set of
functional dependencies F = {A->C, AC->D, E->AD, E->H} and G = {A->CD, E->AH}. Check
whether or not they are equivalent.

 18-19(4.b) Define Minimal Cover. Suppose a relation R(A,B,C) has FD set F = {A->B, B->C,
A->C}. Convert this FD set into minimal cover.

 20-21(1.f) Write different Inference Rule for Functional Dependency?

 20-21(5.a) What is Functional Dependency? Explain the procedure of calculating the

Canonical Cover of a given Functional Dependency Set with suitable example.

 21-22(1.h) Define the closure of an attribute set.

 21-22(5.a) Describe Armstrong’s axioms in detail. What is the role of these rules in
database development process?

 22-23(2.c) A set of FDs for the relation R{A, B, C, D, E, F} is AB →C, C → A, BC → D,ACD →

B, BE → C, EC → FA, CF → BD, D→ E. Find a minimum cover forth is set of FDs

 23-24(1.e) Write different inference rule for functional dependency?

 24-25(1.d) Analyze and find the FDS in the following relation X Y Z 1 4 2 2 5 3 1 4 2 3 2 2

 23-24(5.a) What is functional dependency? Explain the procedure of calculating the

canonical cover of a given functional dependency set with suitable example. Topic 3.2:
Normal forms, first, second, third normal forms

 17-18(1.f) Define 2 NF.

 17-18(2.d) Write difference between BCNF Vs 3 NF.

 17-18([Link]) Normalization with advantages

 18-19(1.d) What are the different types of anomalies associated with database?

 18-19(1.f) Why do we normalize database?

 19-20(1.b) Explain normalization. What is normal form?

 20-21(1.e) What are advantages of normalization?

 20-21(2.c.i) What is highest normal form of the Relation R(W,X,Y,Z) with the set F= { WY
→ XZ, X →Y }

 21-22(2.c) What do you understand by transitive dependencies? Explain with an

example any two problems that can arise in the database if transitive dependencies are
present in the database.

 23-24(1.f) Why do we normalize database? Topic 3.3: BCNF

 17-18(2.d) Write difference between BCNF Vs 3 NF. Topic 3.4: Inclusion dependence

 None Topic 3.5: Loss less join decompositions

 20-21([Link]) Explain the Loss Less Decomposition with example.

 22-23(5.a) Given the following set of FDs on schema R (V,W,X,Y,Z) {Z→V, W→Y, XY→Z,
V→WX}State whether the following decomposition are loss-less-join decompositions or
not. (i) R1=(V,W,X) , R2=(V,Y,Z) (ii) R1=(V,W,X), R2=(X,Y,Z)

 24-25(2.c) Consider the relation R (P, Q, S, T, X, Y, Z, W) with the following functional

dependencies PQ → X; P → YX; Q → Y; Y → ZW Consider the decomposition of the
relation R into the constituent relations according to the following two decomposition
schemes. D1 : R = [(P, Q, S, T); (P, T, X); (Q, Y); (Y, Z, W)] D2 : R = [(P, Q, S); (T, X); (Q, Y); (Y,
Z, W)] Identify whether it is and lossy decomposition and justify your answer. Topic 3.6:
Normalization using FD, MVD, and JDs

 17-18(5.b.i) MVD or JD

 19-20(4.b.i) Multivalued Dependency

 20-21([Link]) Consider a relation R(A,B,C,D,E) with set F= { A→CD, C→B,B→AE} What are
the prime attributes of this Relation and Decompose the given relation in 3NF.

 20-21(5.b.i) Consider the relation R(a,b,c,d) with Set F={a→c,b→d}. Decompose this
relation in 2 NF.
  21-22(5.b) Describe the term MVD in the context of DBMS by giving an example. Discuss
4NF and 5NF also.

 22-23(1.e) List all prime and non-prime attributes In Relation R(A,B,C,D,E) with FD set F =
{AB→C, B→E, C→D}.

 22-23(5.b) Consider the universal relation R = {A, B, C, D, E, F, G, H, I, J} and the set of

functional dependencies F = { {A, B}→{C}, {A}→{D, E}, {B}→{F}, {F}→{G,H}, {D}→{I, J} }.
What is the key for R? Decompose R into 2NF and then3NF relations.

 23-24(2.c.i) Multivalued dependency

 23-24(5.b) Describe the term MVD in the context of DBMS by giving an example. Discuss
4NF and 5NF also.

 24-25(1.e) List all prime and non-prime attributes In Relation R(A,B,C,D,E) with FD set F =
{AB→C, B→E, C→D}.

 24-25(5.a) 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 Analyze and find the highest
normal form of the relation Book and Collection.

 24-25(5.b) Consider the universal relation R = {A, B, C, D, E, F, G, H, I, J} and the set of

functional dependencies F = { {A, B}→{C}, {A}→{D, E}, {B}→{F}, {F}→{G,H}, {D}→{I, J} }.
Identify the key for R? Also define MVD with example.

 22-23(1.f) Explain MVD with the help of suitable example. Topic 3.7: Alternative
approaches to database design

Unit IV: Transaction Processing Concept

Topic 4.1: Transaction System

 17-18(6.b) What do you mean by Transaction? Explain transaction property with detail
and suitable example.

 18-19(2.a) Define Transaction? What is its properties with suitable example.

 19-20(5.a) What do you understand by ACID properties of transaction ? Explain in

details.
 20-21(1.g) What are ACID properties of Transaction?

 20-21(1.h) What are various reasons for transaction failure?

 21-22(1.i) When is a transaction Rolled Back?

 21-22(2.d) List ACID properties of transaction. Explain the usefulness of each. What is
the importance of log?

 22-23(1.g) Discuss Consistency and Isolation property of a transaction.

 22-23(1.h) Draw a state diagram and discuss the typical states that a transaction goes
through during execution.

 24-25(1.f) Explain properties of Transaction.

 18-19(6.b) What do you mean by Transaction? Explain transaction property with detail
and suitable example. Topic 4.2: Testing of Serializability

 17-18(3.a) What do you mean by serializability? Discuss the conflict and view
serialzability with example. Discuss the testing of serializability also.

 20-21(2.d) Explain the method of testing the serializability. Consider the schedule S1 and
S2 given below S1: R1(A),R2(B),W1(A),W2(B) S2: R2(B),R1(A),W2(B), W1(A) Check
whether the given schedules are conflict equivalent or not?

 23-24(1.g) What do you mean by testing of serializability? Topic 4.3: Serializability of

Schedules

 19-20(1.f) What do you mean by Conflict Serializable Schedule?

 20-21(6.a) What is Conflict Serializable Schedule? Check the given Schedule S1 is Conflict
Serializable or not? S1: R1(X), R2(X),R2(Y),W2(Y),R1(Y),W1(X)

 21-22(6.a) Describe serializable schedule. Discuss conflict serializability with suitable

example.

 21-22(7.a) Given a schedule S for transactions T1 and T2 with set of read and write
operations, S: R1(X) R2(X) R2(Y) W2(Y) R1(Y) W1(X). Identify, whether given schedule is
equivalent to serial schedule or not?

 22-23(1.j) Describe how view serializability is related to conflict serializability.

 22-23(6.b) Consider the three transactions T1, T2, and T3, and the schedules S1 and
S2given below. State whether each schedule is serializable or not. If a schedule is
serializable, write down the equivalent serial schedule(s). T1: r1 (X); r1 (Z); w1 (X); T2: r2
(Z); r2 (Y); w2 (Z); w2 (Y); T3: r3 (X); r3 (Y); w3 (Y); S1: r1 (X); r2 (Z); r1 (Z); r3 (X); r3 (Y);
 w1 (X); w3 (Y); r2 (Y); w2 (Z); w2 (Y); S2: r1 (X); r2 (Z); r3 (X); r1 (Z); r2 (Y); r3 (Y); w1 (X);
w2 (Z); w3 (Y); w2 (Y);

 23-24(6.a) What is conflict serializable Schedule? Explain the difference between conflict
and view serializable schedule using suitable example?

 24-25(6.a) Illustrate Conflict Serializable Schedule. Check the given Schedule S1 is

Conflict Serializable or not? Also check is it view Serializable? S1: R1(X),
R2(X),R2(Y),W2(Y),R1(Y),W1(X) Topic 4.4: Conflict & View Serializable Schedule

 See above. Topic 4.5: Recoverability

 22-23(2.d) What is a schedule? Define the concepts of recoverable, cascade less and
strict schedules, and compare them in terms of their recoverability.

 22-23(6.a) Consider schedules S1, S2, and S3 below. Determine whether each schedule
is strict, cascade less, recoverable, or non recoverable. (Determine the strictest
recoverability condition that each schedule satisfies.) S1: r1 (X); r2 (Z); r1 (Z); r3 (X); r3
(Y); w1 (X); c1; w3 (Y); c3; r2 (Y); w2 (Z); w2 (Y); c2; S2: r1 (X); r2 (Z); r1 (Z); r3 (X); r3 (Y);
w1 (X); w3 (Y); r2 (Y); w2 (Z); w2 (Y); c1;c2; c3; S3: r1 (X); r2 (Z); r3 (X); r1 (Z); r2 (Y); r3
(Y); w1 (X); c1; w2 (Z); w3 (Y); w2 (Y);c3; c2;

 24-25(6.b) Explain schedule and transaction. Define the concepts of recoverable,

cascade less, and strict schedules, and compare them in terms of their recoverability.

 17-18(1.h) Define schedule.

 18-19(2.b) What is schedule? Write the steps for log based recovery of a system with
deferred database modification. Topic 4.6: Recovery from Transaction Failures

 20-21(1.h) What are various reasons for transaction failure?

 22-23(2.e) Discuss the immediate update recovery technique in both single-user and
multiuser environments. What are the advantages and disadvantages of immediate
update?

 24-25(2.d) Determine different types of failures in case of transactions and how it can be
recovered based on log file? Explain with suitable example. Topic 4.7: Log Based
Recovery

 17-18(6.a) What is Log? How is it maintained? Discuss the features of deferred database
modification and immediate database modification in brief.

 18-19(2.b) What is schedule? Write the steps for log based recovery of a system with
deferred database modification.
 21-22(2.d) List ACID properties of transaction. Explain the usefulness of each. What is
the importance of log?

 23-24(6.b) What is Log? How is it maintained? Discuss the features of deferred database
modification and immediate database modification in brief.

 18-19(6.a) What is Log? How is it maintained? Discuss the features of deferred database
modification and immediate database modification in brief. Topic 4.8: Checkpoints

 None Topic 4.9: Deadlock Handling

 18-19(2.c) What is deadlock? What are necessary conditions for it? How can it be
prevented?

 19-20(5.b) Discuss about deadlock prevention schemes.

 20-21(6.b) Explain Deadlock Handling with Suitable Example

 21-22(6.b) Discuss the procedure of deadlock detection and recovery in transaction?

 23-24(2.d) Discuss the procedure of deadlock detection and recovery in transaction?

 24-25(7.b) Explain deadlock. What are the necessary conditions for it? How it can be
detected and recovered? Topic 4.10: Distributed Database: Distributed Data Storage,
Concurrency Control, Directory System

 17-18(1.j) Define replication in distributed database.

 17-18(7.b) Explain data fragmentation with types.

 18-19(7.b) Explain data fragmentation with types.

 19-20(2.e) What are Distributed Database? List advantage and disadvantage of data
Replication and data Fragmentation.

 19-20(7.a) Explain Directory System in detail.

 23-24(1.h) Define replication in distributed database.

 21-22(7.b) Discuss 2 phase commit (2PC) protocol and time stamp based protocol with
suitable example. How the validation based protocols differ from 2PC?

 23-24(7.a) Discuss 2 phase commit (2PC) protocol and time stamp-based protocol with
suitable example. How the validation-based protocols differ from 2PC?

Unit V: Concurrency Control Techniques

Topic 5.1: Concurrency Control

 19-20(1.g) Define Concurrency Control.

 19-20(6.a) Explain Concurrency Control. Why it is needed in database system?

 20-21(1.i) What are Concurrent Transactions?

 23-24(1.i) Define concurrency control.

 24-25(2.e) Discuss Concurrency control. Why it is needed in DBMS? Also explain

timestamp based ordering in Concurrency control. Topic 5.2: Locking Techniques for
Concurrency Control

 17-18(1.i) Define Exclusive Lock.

 17-18(2.e) What is Two phase Locking (2PL)? Describe with the help of example.

 20-21(1.j) What is Lock in Transaction Management?

 21-22(1.j) List the various levels of locking?

 22-23(1.i) Discuss Conservative 2PL and Strict 2PL.

 23-24(1.j) Define exclusive lock.

 23-24(2.e) Write the salient features of graph based locking protocol with suitable
example. Topic 5.3: Time Stamping Protocols for Concurrency Control

 17-18(3.b) What are multi version schemes of concurrency control? Describe with the
help of an example. Discuss the various Time stamping protocols for concurrency control
also.

 19-20(2.d) Explain the phantom phenomenon. Discuss a Time Stamp Protocol that
avoids the phantom phenomenon.

 20-21(7.a) Explain Time Stamp Based Concurrency Control technique.

 21-22(2.e) What do you mean by time stamping protocol for concurrency controlling?
Discuss multi version scheme of concurrency control.

 22-23(7.a) Discuss the timestamp ordering protocol for concurrency control. How does
strict timestamp ordering differ from basic timestamp ordering?
 23-24(7.b) What are multi version schemes of concurrency control? Describe with the
help of an example. Discuss the various Time stamping protocols for concurrency control
also. Topic 5.4: Validation Based Protocol

 20-21(2.e) Explain the Validation Based protocol for concurrency control.

 22-23(7.b) How do optimistic concurrency control techniques differ from other

concurrency control techniques? Why they are also called validation or certification
techniques? Discuss the typical phases of an optimistic concurrency control method.

 24-25(7.a.i) Multi version protocol

 24-25([Link]) Validation based protocol Topic 5.5: Multiple Granularity

 24-25(1.g) Define multiple granuality. Topic 5.6: Multi Version Schemes

 See time stamping above. Topic 5.7: Recovery with Concurrent Transaction

 20-21(7.b) Explain Recovery from Concurrent Transaction. Topic 5.8: Case Study of
Oracle