Geethanjali College of Engineering and Technology

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

18CS2203 – DATABASE MANAGEMENT SYSTEMS
L T P/D C
II Year. B.Tech. CSE – II Sem 3 - -/- 3

Unit Wise Important Questions

PART – A (Short Answer Questions)

Blooms
Course
Q. No Questions Taxonomy
Outcome
Level
UNIT – I
1 List the advantages of DBMS. Knowledge 1
2 List the database Applications. Knowledge 1
3 Define instances and schemas of database. Knowledge 1
4 Discuss Data Independence. Understand 1
5 Explain database Access for applications Programs Understand 1
6 Define (i) Database (ii) DBMS Knowledge 1
7 Explain about Database storage structure. Understand 1
8 Discuss Transaction management. Understand 1
9 Explain the Query Processor. Understand 1
10 Define (i) Entity (ii) Attribute Knowledge 1
11 Define Relationship and Relationship set. Knowledge 1
12 Discuss about Data Definition language. Understand 1
13 Discuss about Data Manipulation language. Understand 1
14 Explain about querying relational data. Understand 1
15 Explain the History of Data base Systems. Understand 1
16 Discuss how can you change the data in the table. Understand 1
17 List various types of attributes. Knowledge 1
18 Discuss how can you alter and destroy tables. Understand 1
UNIT – II
1 Define relational database query. Knowledge 2
2 State about SELECT operation in Relational algebra. Knowledge 2
3 State about PROJECT operation in Relational algebra. Knowledge 2
4 Define Aggregate Functions. Knowledge 2
5 Discuss the use of rename operation. Understand 2
6 Illustrate division operation. Apply 2
7 Discuss the basic form of SQL query. Understand 2
8 Define Null Values. Knowledge 2
9 Define tuple variable with its syntax. Knowledge 2
10 Define Dynamic SQL. Knowledge 2
11 Define Assertions. Knowledge 2
12 Discuss about trigger. Understand 2
13 Demonstrate how to add a NOT NULL column to a table. Apply 2
UNIT – III
1 Define redundancy. Knowledge 3
2 Define functional dependency. Why are some functional dependencies trivial. Knowledge 3
3 Discuss normalization. Understand 3
4 Illustrate functional dependency with example Apply 3
5 Illustrate fully functional dependency with example. Apply 3
6 Demonstrate transitive dependency with an example. Apply 3
7 Discuss Domain-Key Normal Form. Understand 3
8 Define Armstrong axioms for Functional dependencies. Knowledge 3

1
 9 Define First Normal Form. Knowledge 3
10 Define Second Normal Form. Knowledge 3
11 Define Third Normal Form. Knowledge 3
12 Define Fourth Normal Form. Knowledge 3
13 Define BCNF. Knowledge 3
UNIT – IV
1 Define a Transaction.List the properties of transaction. Knowledge 4
2 Discuss different phases of transaction. Understand 4
3 Discuss recoverable schedules. Understand 4
4 Discuss cascade less schedules. Understand 4
5 Define Two Phase Commit protocol. Knowledge 4
6 Demonstrate the implementation of Isolation. Apply 4
7 Discuss the Procedure to test Serializability. Understand 4
8 Explain about different types of locks. Understand 4
9 Discuss about Failure Classification. Understand 4
10 Define a checkpoint. Knowledge 4
11 Discuss the failures that can occur with loss of Non-volatile storage. Understand 4
12 Demonstrate Conflict Serializability. Apply 4
13 Discuss View Serializability. Understand 4
UNIT – V
1 Discuss about data on External storage. Understand 5
2 Explain Clustered Indexes? Understand 5
3 Discuss the Primary and Secondary indexes? Understand 5
4 Define Tree Indexing? Knowledge 5
5 Explain Hash based Indexing? Understand 5
6 Discuss the intuition for Tree Indexes? Understand 5
7 Define Indexed Sequential Access Method? Knowledge 5
8 Discuss about Overflow pages and Locking considerations of ISAM? Understand 5
9 Discuss the Cost model of Heap files? Understand 5
Discuss the Cost model of Sorted files? Understand 5
9 Discuss the Cost model of Clustered files? Understand 5
10 Discuss the impact of Workload on Indexes? Understand 5
PART – B (Long Answer Questions)

Blooms
Course
Q. No Questions Taxonomy
Outcome
Level
UNIT – I
1 Compare and Contrast file Systems with database systems? Apply 1
2 Define Data Abstraction and discuss levels of Abstraction? Knowledge 1
3 Discuss about different types of Data models? Understand 1
4 Describe the Structure of DBMS? https://www.geeksforgeeks.org/structure-of-database-management-system/Understand 1
5 Discuss additional features of the ER-Models. Understand 1
6 Discuss about the Concept Design with the ER Model? Understand 1
7 Write about views. Are views updatable? Expalin. Knowledge 1
8 Explain different
https://www.geeksforgeeks.org/different-types-of-database-users/
types of database users and write the functions of DBA. Understand 1
9 Explain about different types of integrity constraints. Understand 1
10 Discuss about the logical database Design. Understand 1
11 Distinguish strong entity set with weak entity set. Draw an ER diagram to Apply 1
illustrate weak entity set. https://www.geeksforgeeks.org/difference-between-strong-and-weak-entity/

12 Differentiate relation schema and relational instance. Define the terms arity and Understand 1
degree of s relation? What are domain constraints.
13 Illustrate outer joins with example. Apply 1
14 Describe logical connectives of SQL. https://beginner-sql-tutorial.com/sql-logical-operators.htm Understand 1
15 Understand 1
UNIT – II
1 Illustrate different set operations in Relational algebra with an example? w11 Apply 2
2 Define Join? Explain different types of joins? Knowledg 2
w10 e
2
 3 Discuss about Domain Relational calculus in detail? Understan 2
d
4 Define trigger and explain its three parts? Differentiate row level and statement Knowledg 2
level triggers? w13 e
5 Illustrate Group by and Having clauses with examples? 71&75 Apply 2
6 Discuss about Complex integrity constraints in SQL? Understan 2
https://www.javatpoint.com/dbms-integrity-constraints d
7 Discuss different types of aggregate operators with examples in SQL? 69 Understan 2
d
8 a. Define a nested query? 81 Knowledg 2
b. Write a nested query to find the names of sailors who have reserved both a red e
and green boat?
c. Write a nested query to find the names of sailors who have reserved all boats?

9 a. Discuss correlated nested queries? Understan 2

b. Write a query to find the names of sailors who have reserved a red boat? d
c. Write a query to find the names of sailors who have not reserved a red boat?
10 a. Explain Relational calculus? https://www.javatpoint.com/dbms-relational-calculus Understan 2
b. Write a TRC query to find the names of sailors who have reserved boat 103? d
c. Write a DRC query to find the names of sailors who have reserved boat 103?
11 Discuss about active databases? https://www.geeksforgeeks.org/active-databases/
UNIT – III
1 What is redundancy and write about the problems that it can cause to the Apply 3
database?
2 Define decomposition and how does it address redundancy? Discuss the problems Knowledge 3
that may be caused by the use of decompositions?
3 Define functional dependencies. How are primary keys related to FD’s? Knowledge 3
4 Define normalization? Explain 1NF, 2NF, 3NF Normal forms? Knowledge 3
5 Compare and contrast BCNF with 3NF. Apply 3
6 Describe properties of decompositions. Understand 3
7 Explain about Schema refinement in Database design. Understand 3
8
https://www.javatpoint.com/dbms-forth-normal-form
Illustrate Multivalued dependencies and Fourth normal form with example. Apply 3
9
https://www.javatpoint.com/dbms-fifth-normal-form
Discuss about Join dependencies and Fifth normal form. Understand 3
https://www.javatpoint.com/dbms-inclusion-dependence
10 Illustrate Inclusion dependencies with example. Apply 3
UNIT – IV
1 Explain ACID properties and Illustrate them through examples. Understand 4
2 Discuss How do you implement Atomicity and Durability. Understand 4
https://www.tutorialandexample.com/concurrent-execution-of-transaction
3 Illustrate Concurrent execution of transaction with examples. Apply 4
4 Discuss Serializability in detail. Understand 4
5 Discuss two phase locking protocol and strict two phase locking protocols. Understand 4
6 Describe Timestamp based locking protocols. Understand 4
7 Describe Validation-based locking protocols. Understand 4
8 Discuss in detail Multiple Granularity. Understand 4
9 Explain in detail Storage structure. Understand 4
10 Discuss Deferred database modification and Immediate database modification. Understand 4
11 Discuss how do you recover from Concurrent transactions. Understand 4
12 Explain Buffer Management. Understand 4
13 Explain different types of Advanced Recovery Techniques. Understand 4
14 Write in detail about Remote Backup systems. Apply 4
UNIT – V
1 Write in detail about Hash based Indexing and Tree based Indexing. Apply 5
2 Compare I/O costs for all File Organizations. Understand 5
3 Explain in detail about ISAM. Understand 5
4 Explain B+ trees? Discuss about this Dynamic Index Structure. Understand 5
5 Demonstrate searching a given element in B+ trees? Explain with example. Understand 5
6 Illustrate insertion of an element in B+ trees with example. Apply 5
7 Illustrate deletion of an element in B+ trees with example. Apply 5
8 Write in detail about Static Hashing. Apply 5
9 Explain in detail about Extendible Hashing. Understand 5
10 Explain in detail about Linear Hashing. Understand 5
11 Compare and Contrast Extendible Hashing with Linear Hashing. Apply 5
3
PART – C (Problem Solving and Critical Thinking Questions)
Blooms
Course
Q. No Questions Taxonomy
Outcome
Level
UNIT – I
1 Consider the following ER Diagram.

Apply 1

Discuss how many minimum numbers of tables are needed to represent M, N, P,

R1, R2?

2 Let E1 and E2 be two entities in an E/R diagram with simple single-valued

attributes. R1 and R2 are two relationships between E1 and E2, where R1 is one-
to-many and R2 is many-to-many. R1 and R2 do not have any attributes of their Apply 1
own. Calculate the minimum number of tables required to represent this situation
in the relational model?

3 Analyze and find whether View exists if the table is dropped from the database? Analyze 1

4 We can convert any weak entity set to strong entity set by simply adding
appropriate attributes. Analyze why, then, do we have weak entity sets? Analyze 1

UNIT – II
1 Consider the following relational schema
Employee (empno,name,office,age)
Books(isbn,title,authors,publisher)
Loan(empno, isbn,date)
Apply 2
Write the following queries in relational algebra.
a. Find the names of employees who have borrowed a book Published by
McGraw-Hill?
b. Find the names of employees who have borrowed all books Published by
McGraw-Hill?
c. Find the names of employees who have borrowed more than five different
books published by McGraw-Hill?
d. For each publisher, find the names of employees who have borrowed?
2 Given the Students relation as shown below

Apply 2

For (Student Name, Student Age) to be the key for this instance, analyze and find
value of X not be equal to?
3 Given the relations 2
employee(name,salary,deptno)
department (deptno, deptname, address) Apply
Solve which query cannot be expressed using the basic relational algebra
operations (U, -, x, , p)?
4 Write SQL Query to find second highest salary of Employee from Employee 2
table? Apply

4
 UNIT – III
1 Consider a relation scheme R = (A, B, C, D, E, H) on which the following
functional dependencies hold: {A–>B, BC–> D, E–>C, D–>A}. Write the Apply 3
candidate keys of R?
2 Consider the following relational schemes for a library database:

Book (Title, Author, Catalog_no, Publisher, Year, Price)

Collection (Title, Author, Catalog_no)
the following are functional dependencies:
Apply
a. Title Author --> Catalog_no 3
b. Catalog_no --> Title Author Publisher Year
c. Publisher Title Year --> Price
Assume {Author, Title} is the key for both schemes. Apply the appropriate
normal form for Book and Cancellation?
3 Consider a schema R (A, B, C, D) and functional dependencies A -> B and C -> 3
D. Solve and find whether the decomposition of R into R1 (A, B) and R2(C, D) Apply
belongs to which one or both (dependency preserving and loss less join)?
4 Show that: if α → β and α → γ then α → βγ Apply 3
UNIT - IV
1 Consider the following transactions with data items P and Q initialized to zero:
T1: read(P);
read(Q);
If P=0 then Q:=Q+1;
write(Q);
T2: read(Q); Apply 4
read(P);
If Q=0 then P:=P+1;
write(P);
Solve and find any non-serial interleaving of T1 and T2 for concurrent execution
leads to a serializable schedule or non serializable schedule. Explain?
2 Analyze which of the following concurrency control protocols ensure both 4
conflict serializability and freedom from deadlock? Explain the following:
Apply
a. 2-phase locking
b. Time-stamp ordering
3 Consider the transactions T1, T2, and T3 and the schedules S1 and S2 given 4
below.
T1: r1(X);r1(Z);w1(X);w1(Z) Apply
T2: r2(Y);r2(Z);w2(Z)
T3: r3(Y);r3(X);w3(Y)
S1: r1(X);r3(Y);r3(X);r2(Y);r2(Z);
w3(Y);w2(Z);r1(Z);w1(X);w1(Z)
S2: r1(X); r3(Y); r2(Y); r3(X); r1(Z);
r2(Z); w3(Y); w1(X); w2(Z); w1(Z)
Analyze which one of the schedules is conflict-serializable?
4 Suppose that there is a database system that never fails. Analyze whether a
Apply 4
recovery manager required for this system?
UNIT - V
1 Consider a B+-tree in which the maximum number of keys in a node is 5.
Apply 5
Calculate the minimum number of keys in any non-root node?
2 In the index allocation scheme of blocks to a file, Calculate on what maximum 5
Apply
possible size of the file depends?
3 A clustering index is defined on the fields of which type? Analyze them. Apply 5
4 Calculate the minimum space utilization for a B+ tree index? Apply 5

5
5 Consider the B+ tree index of order d = 2 shown in Figure

Apply 5

a. Show the tree that would result from inserting a data entry with key 9 into
this tree.
b. Show the B+ tree that would result from deleting the data entry with key
8 from the original tree, assuming that the left sibling is checked for
possible redistribution