UTTARANCHAL UNIVERSITY

(Established vide Uttaranchal University Act, 2012, Uttarakhand Act No. 11 of 2013)
Premnagar-248007, Dehradun, Uttarakhand, INDIA

Database Management System

Question Bank ([Link])

1. Explain DBMS and compare Database System with File System.

2. Describe DBMS architecture with neat diagram.

3. Define schema, instance and data independence.

4. Explain ER model concepts and notations.

5. Differentiate Super Key, Candidate Key and Primary Key.

6. Explain weak entity set with example.

7. Explain Extended ER features with examples.

8. Design an ER diagram for an e-commerce system that supports:

 Customer registration
 Shopping cart
 Order placement
 Multiple payment modes

9. Design an ER diagram for an online shopping system that allows:

 Customers to rate and review products

 Each customer can review a product only once

[Link] an ER diagram for an online shopping portal that includes:

 Products
 Warehouses
 Inventory levels
 Orders

11. Explain relational data model concepts.

 UTTARANCHAL UNIVERSITY
(Established vide Uttaranchal University Act, 2012, Uttarakhand Act No. 11 of 2013)
Premnagar-248007, Dehradun, Uttarakhand, INDIA

12. Discuss integrity constraints with examples.

13. Explain relational algebra operations.

14. Explain different types of database users.

15. Explain all SQL language with respective

commands(DDL,DML,DCL,TCL,DQL).

16. Define SQL and explain its characteristics and advantages.

17 Explain SQL data types and literals.

18 Write SQL queries using aggregate functions.

19. Write SQL queries using JOIN operations.

20. Write SQL queries using UNION, INTERSECTION and MINUS.

21. Define Functional Dependency with example.

22 Explain First, Second and Third Normal Forms.

23. For relation R(A, B, C, D) with functional dependencies:

A→B
B→C
C→D

Find all candidate keys of R and the closure of all the attributes

24. For relation R(A, B, C, D, E) with FDs:

A → BC
CD → E
B→D

Find the candidate key(s) and the closure of all the attributes

25. For relation R(A, B, C, D, E), given:

 UTTARANCHAL UNIVERSITY
(Established vide Uttaranchal University Act, 2012, Uttarakhand Act No. 11 of 2013)
Premnagar-248007, Dehradun, Uttarakhand, INDIA

AB → C
C→D
D→E

Find all candidate keys and the closure of all the attributes

26. Relation R(A, B, C, D) has the following FDs:

A→B
C→D

Find the candidate keys and the closure of all the attributes

26. For relation R(A, B, C, D, E) with FDs:

A → BC
B→D
CD → E

Find candidate key(s) and the closure of all the attributes

27. Given relation R(M, N, O, P) and functional dependencies:

MN → O
O→P

Determine the candidate keys and the closure of all the attributes

28. For relation R(A, B, C, D, E, F) with FDs:

A → BC
C→D
DE → F

Find the candidate key(s) and the closure of all the attributes

29. Consider relation R(A, B, C, D) with FDs:

AB → C
C→A
B→D
 UTTARANCHAL UNIVERSITY
(Established vide Uttaranchal University Act, 2012, Uttarakhand Act No. 11 of 2013)
Premnagar-248007, Dehradun, Uttarakhand, INDIA

Find all candidate keys and the closure of all the attributes

30. For relation R(A, B, C, D, E), the functional dependencies are:

A→B
B→C
AC → D
D→E

Determine the candidate key(s) and the closure of all the attributes

31. Relation R(A, B, C, D) has:

A→C
B→D

Find candidate keys and justify your answer.

32. For relation R(A, B, C, D, E) with:

AB → C
C → AB
D→E

Find all candidate keys and the closure of all the attributes

33. Given relation R(X, Y, Z, W) and FDs:

X→Y
Y→Z
Z→X

Find candidate key(s) and the closure of all the attributes

34. For relation R(A, B, C, D, E) with FDs:

A→B
BC → D
D→E

Determine the candidate key(s) and the closure of all the attributes
 UTTARANCHAL UNIVERSITY
(Established vide Uttaranchal University Act, 2012, Uttarakhand Act No. 11 of 2013)
Premnagar-248007, Dehradun, Uttarakhand, INDIA

35. Relation R(A, B, C, D, E, F) has FDs:

AB → C
C→D
D→E
E→F

Find the candidate key(s) and the closure of all the attributes

36. Explain lossless join decomposition with example.

37. Explain canonical cover and Armstrong’s axioms.

38. Check equivalence of two sets of functional dependencies.

39 Explain Multivalued Dependency (MVD) and Join Dependency (JD).

[Link] relation R(A, B, C, D), the set of functional dependencies is:

A → BC
B→C
A→B
AB → D

Find the canonical cover of the given set of functional dependencies.

41. Find the canonical cover for the following functional dependencies:

AB → C
A→B
B→C
C→D

(Relation: R(A, B, C, D))

42. Consider relation R(A, B, C, D, E) with functional dependencies:

A → BC
B→C
A→B
 UTTARANCHAL UNIVERSITY
(Established vide Uttaranchal University Act, 2012, Uttarakhand Act No. 11 of 2013)
Premnagar-248007, Dehradun, Uttarakhand, INDIA

C→D
D→E

Determine the canonical cover.

[Link] relation R(A, B, C, D), given:

A → BC
B→C
C→D
A→D

Find the minimal (canonical) cover.

44. Find the canonical cover of:

AB → CD
A→C
B→D
C→E

(Relation: R(A, B, C, D, E))

45. Consider a relation schema

R = {P, Q, R, S, T}
with the following functional dependencies:
F = { P → Q, R → S }.
Assume that {P, R, T} is a candidate key for the relation.
Determine the total number of superkeys for the given relation.

46. For the following operations, identify the possibility of deadlock using a
wait-for graph:

T1: Lock-X(A), Lock-X(B)

T2: Lock-X(B), Lock-X(A)

47. Consider the following transactions:

 UTTARANCHAL UNIVERSITY
(Established vide Uttaranchal University Act, 2012, Uttarakhand Act No. 11 of 2013)
Premnagar-248007, Dehradun, Uttarakhand, INDIA

T1: Lock-S(A), Lock-X(B)

T2: Lock-X(B), Lock-X(A)

1. Draw the wait-for graph

2. Check whether a deadlock occurs
3. Justify your answer

48. Given the following lock requests:

T1 holds X(A) and requests X(B)

T2 holds X(B) and requests X(C)
T3 holds X(C) and requests X(A)

1. Construct the wait-for graph

2. Determine whether the system is in deadlock
3. Identify the cycle, if any

49. For the following schedule, analyze deadlock using a wait-for graph:

T1: Lock-X(A), Lock-X(B)

T2: Lock-X(B), Lock-X(C)
T3: Lock-X(C), Lock-X(A)
50. Consider the following lock sequence:
T1: Lock-S(A), Lock-X(B)
T2: Lock-X(B), Lock-S(A)

1. Draw the wait-for graph

2. Is the schedule deadlock-free?
3. Explain your reasoning

51. Define transaction and explain ACID properties.

52. Explain serializability and types of schedules.

53. Test conflict serializability using precedence graph.

54. Explain view serializability and blind writes.

 UTTARANCHAL UNIVERSITY
(Established vide Uttaranchal University Act, 2012, Uttarakhand Act No. 11 of 2013)
Premnagar-248007, Dehradun, Uttarakhand, INDIA

55. Explain recoverability and cascading rollback.

56. Describe log-based recovery techniques.

57. Explain checkpoint mechanism.

58. Explain deadlock handling techniques.

59. Consider the following schedule S:

R1(A), W1(A), R2(A), W2(A)

1. Construct the precedence graph

2. Check whether the schedule is conflict serializable
3. If yes, find the equivalent serial schedule

60. Given schedule S:

R1(A), R2(A), W1(A), R2(B), W2(B)

1. Draw the precedence graph

2. Determine whether S is conflict serializable

61. Consider the schedule:

R1(A), R2(A), W2(A), W1(A)

1. Is the schedule conflict serializable?

2. Is the schedule view serializable?
3. Justify your answer

62. Given schedule S:

R1(A), R2(B), W1(A), W2(B), R1(B), W1(B)

1. Check conflict serializability

2. Check view serializability

63. Given the schedule S1: T1(R(A)), T2(W(A)), T1(W(B)), T2(R(B)), draw
the precedence graph and determine whether the schedule is serializable.

64. Explain concurrency control and its importance.

 UTTARANCHAL UNIVERSITY
(Established vide Uttaranchal University Act, 2012, Uttarakhand Act No. 11 of 2013)
Premnagar-248007, Dehradun, Uttarakhand, INDIA

65. Explain locking techniques with examples.

66. Discuss the advantages and disadvantages of the Two-Phase Locking

protocol.

67. How does 2PL ensure serializability? Explain with a schedule.

68. Explain timestamp based concurrency control.

69. Explain validation based protocol.

70. Explain multiple granularity locking.

71. Explain multiversion concurrency control.

72. Explain recovery with concurrent transactions.

73. Consider the following schedule S:

Time Operation

1 T1: R(A)
2 T2: R(A)
3 T1: W(A)
4 T2: W(A)

1. Construct the precedence graph

2. Determine whether the schedule is conflict serializable
3. If yes, find the equivalent serial order

74. Given schedule S:

Time Operation

1 T1: R(A)
2 T2: R(A)
3 T2: W(A)
4 T1: W(A)
 UTTARANCHAL UNIVERSITY
(Established vide Uttaranchal University Act, 2012, Uttarakhand Act No. 11 of 2013)
Premnagar-248007, Dehradun, Uttarakhand, INDIA

1. Check whether S is conflict serializable

2. Check whether S is view serializable
3. Justify your answer

75. Transaction details:

T1: R(A), W(A), R(B), W(B)
T2: R(B), W(B)

Check whether deadlock can occur

76. Deadlock Detection (Wait-For Graph)

 T1 holds X(A), requests X(B)

 T2 holds X(B), requests X(A)

1. Draw Wait-For Graph

2. Identify deadlock
3. Suggest a deadlock resolution technique

77. Consider the following schedules:

S1: T1(R(A)), T2(W(A)), T1(W(B)), T2(R(B))

Test whether the schedule is conflict serializable.

78. Describe how database systems manage the trade-off between

concurrency and consistency.

79. Explain the design of a mixed concurrency control approach using

timestamps along with locking.

80. Explain the concept of triggers in database management systems and

describe their working mechanism.