2025 question paper

Database Management System

28 questions

1. Q1a. Which statement is FALSE? (i) Every weak entity depends on a strong entity (ii) A weak entity can have a partial key (iii) Every many-to-many relationship becomes a separate relation (iv) Every relation generated from ER always has a single candidate key20252m

   Module 1: Database System Architecture

   Which statement is FALSE?

   (i) Every weak entity depends on a strong entity
   (ii) A weak entity can have a partial key
   (iii) Every many-to-many relationship becomes a separate relation
   (iv) Every relation generated from ER always has a single candidate key

   View this question on its own page →

   CopySearch GoogleAsk AI
2. Q1b. For relation: R(A,B,C); FDs={A \rightarrow B, B \rightarrow A}. Which statement is true? (i) A and B both are candidate keys (ii) Only A is key (iii) Only B is key (iv) Neither A nor B is key20252m

   Module 2: Relational Query Languages & Design

   For relation: R(A,B,C); FDs={A $\rightarrow$ B, B $\rightarrow$ A}. Which statement is true?

   (i) A and B both are candidate keys
   (ii) Only A is key
   (iii) Only B is key
   (iv) Neither A nor B is key

   View this question on its own page →

   CopySearch GoogleAsk AI
3. Q1c. The relational algebra expression \pi_A(R) - \pi_A((\pi_A(R) \times S) - R) is equivalent to: (i) Selection (ii) Join (iii) Division (iv) Projection20252m

   Module 2: Relational Query Languages & Design

   The relational algebra expression $\pi_A(R) - \pi_A((\pi_A(R) \times S) - R)$ is equivalent to:

   (i) Selection
   (ii) Join
   (iii) Division
   (iv) Projection

   View this question on its own page →

   CopySearch GoogleAsk AI
4. Q1d. Which query is best solved using division operation? (i) Find students enrolled in DBMS (ii) Find students enrolled in all courses (iii) Find students with marks >80 (iv) Find students from CSE20252m

   Module 2: Relational Query Languages & Design

   Which query is best solved using division operation?

   (i) Find students enrolled in DBMS
   (ii) Find students enrolled in all courses
   (iii) Find students with marks >80
   (iv) Find students from CSE

   View this question on its own page →

   CopySearch GoogleAsk AI
5. Q1e. A relation is in BCNF if: (i) Every non-prime attribute depends on key (ii) Every FD is trivial (iii) Every determinant is a superkey (iv) Every attribute is atomic20252m

   Module 2: Relational Query Languages & Design

   A relation is in BCNF if:

   (i) Every non-prime attribute depends on key
   (ii) Every FD is trivial
   (iii) Every determinant is a superkey
   (iv) Every attribute is atomic

   View this question on its own page →

   CopySearch GoogleAsk AI
6. Q1f. Suppose relation R(A,B,C) is decomposed into: R1(A,B) and R2(B,C). The decomposition is lossless if: (i) B \rightarrow A or B \rightarrow C (ii) A \rightarrow B (iii) A \rightarrow C (iv) C \rightarrow B20252m

   Module 2: Relational Query Languages & Design

   Suppose relation R(A,B,C) is decomposed into: R1(A,B) and R2(B,C). The decomposition is lossless if:

   (i) B $\rightarrow$ A or B $\rightarrow$ C
   (ii) A $\rightarrow$ B
   (iii) A $\rightarrow$ C
   (iv) C $\rightarrow$ B

   View this question on its own page →

   CopySearch GoogleAsk AI
7. Q1g. Compared with B-tree indexing, hashing is preferred when queries mainly involve: (i) Range searches (ii) Ordered traversal (iii) Exact match search (iv) Sorting20252m

   Module 3: Storage Strategies

   Compared with B-tree indexing, hashing is preferred when queries mainly involve:

   (i) Range searches
   (ii) Ordered traversal
   (iii) Exact match search
   (iv) Sorting

   View this question on its own page →

   CopySearch GoogleAsk AI
8. Q1h. For a B-tree of order m, every non-root internal node must have at least: (i) m/2 children (ii) [m/2] children (iii) [m/2]-1 children (iv) m-1 children20252m

   Module 3: Storage Strategies

   For a B-tree of order m, every non-root internal node must have at least:

   (i) m/2 children
   (ii) [m/2] children
   (iii) [m/2]-1 children
   (iv) m-1 children

   View this question on its own page →

   CopySearch GoogleAsk AI
9. Q1i. Consider the schedule: R1(X), R2(X), W1(X), W2(X). The schedule is: (i) View serializable only (ii) Conflict serializable (iii) Not serializable (iv) Recoverable20252m

   Module 4: Transaction Processing

   Consider the schedule: R1(X), R2(X), W1(X), W2(X). The schedule is:

   (i) View serializable only
   (ii) Conflict serializable
   (iii) Not serializable
   (iv) Recoverable

   View this question on its own page →

   CopySearch GoogleAsk AI
10. Q1j. Under strict two-phase locking: (i) Exclusive locks are held until commit/abort (ii) Deadlocks are impossible (iii) Locks can be released anytime (iv) Transactions become serial20252m

    Module 4: Transaction Processing

    Under strict two-phase locking:

    (i) Exclusive locks are held until commit/abort
    (ii) Deadlocks are impossible
    (iii) Locks can be released anytime
    (iv) Transactions become serial

    View this question on its own page →

    CopySearch GoogleAsk AI
12. Q2a. Explain the three-level database architecture with a neat diagram. How does it support data abstraction and data independence?20257m

    Module 1: Database System Architecture

    Explain the three-level database architecture with a neat diagram. How does it support data abstraction and data independence?

    View this question on its own page →

    CopySearch GoogleAsk AI
13. Q2b. Explain integrity constraints in DBMS. Discuss different types with examples.20257m

    Module 1: Database System Architecture

    Explain integrity constraints in DBMS. Discuss different types with examples.

    View this question on its own page →

    CopySearch GoogleAsk AI
14. Q3a. Design an ER diagram for a Hospital Management System containing Patients, Doctors, Departments, and Appointments. Clearly identify entities, attributes, relationships, and cardinalities.20257m

    Module 1: Database System Architecture

    Design an ER diagram for a Hospital Management System containing Patients, Doctors, Departments, and Appointments. Clearly identify entities, attributes, relationships, and cardinalities.

    View this question on its own page →

    CopySearch GoogleAsk AI
15. Q3b. What is a JOIN in SQL? Explain various JOIN operations with a suitable example for each and discuss their applications in database systems.20257m

    Module 2: Relational Query Languages & Design

    What is a JOIN in SQL? Explain various JOIN operations with a suitable example for each and discuss their applications in database systems.

    View this question on its own page →

    CopySearch GoogleAsk AI
16. Q4a. Consider: * Student(SID, Name, Dept, Age) * Course(CID, CName, Faculty) * Enroll(SID, CID, Marks) 1. Write relational algebra expressions to find: * a) Students enrolled in DBMS * b) Students scoring >80 marks * c) Students not enrolled in any course 2. Write SQL queries: * a) Find highest marks * b) Find average marks department-wise * c) Display students enrolled in more than two courses 3. Translate the following query into tuple relational calculus: * "Find names of students from CSE department." 4. Convert the following relational algebra into SQL: * \pi_{Name}(\sigma_{Marks > 85}(Student \bowtie Enroll))202510m

    Module 2: Relational Query Languages & Design

    Consider:

    • Student(SID, Name, Dept, Age)
    • Course(CID, CName, Faculty)
    • Enroll(SID, CID, Marks)

    1. Write relational algebra expressions to find:
       • a) Students enrolled in DBMS
       • b) Students scoring >80 marks
       • c) Students not enrolled in any course
    2. Write SQL queries:
       • a) Find highest marks
       • b) Find average marks department-wise
       • c) Display students enrolled in more than two courses
    3. Translate the following query into tuple relational calculus:
       • "Find names of students from CSE department."
    4. Convert the following relational algebra into SQL:
       • $\pi_{Name}(\sigma_{Marks > 85}(Student \bowtie Enroll))$

    View this question on its own page →

    CopySearch GoogleAsk AI
17. Q4b. For relation R(A,B,C,D,E) functional dependencies are given as follows: * A \rightarrow BC * CD \rightarrow E * B \rightarrow D Find candidate keys.20254m

    Module 2: Relational Query Languages & Design

    For relation R(A,B,C,D,E) functional dependencies are given as follows:

    • A $\rightarrow$ BC
    • CD $\rightarrow$ E
    • B $\rightarrow$ D

    Find candidate keys.

    View this question on its own page →

    CopySearch GoogleAsk AI
18. Q5a. Explain different normal forms up to BCNF with examples.20257m

    Module 2: Relational Query Languages & Design

    Explain different normal forms up to BCNF with examples.

    View this question on its own page →

    CopySearch GoogleAsk AI
19. Q5b. Explain different indexing techniques used in databases.20257m

    Module 3: Storage Strategies

    Explain different indexing techniques used in databases.

    View this question on its own page →

    CopySearch GoogleAsk AI
20. Q6a. Consider a hash table of size 10 with the hash function h(k) = k \pmod{10}. Insert the keys 23, 43, 13, 27, 37, and 50 into the hash table. Construct the hash table using separate chaining for collision resolution and then reconstruct it using linear probing. Compare the final arrangements obtained using both methods.20257m

    Module 3: Storage Strategies

    Consider a hash table of size 10 with the hash function $h(k) = k \pmod{10}$. Insert the keys 23, 43, 13, 27, 37, and 50 into the hash table. Construct the hash table using separate chaining for collision resolution and then reconstruct it using linear probing. Compare the final arrangements obtained using both methods.

    View this question on its own page →

    CopySearch GoogleAsk AI
21. Q6b. Define serializability. Explain conflict and view serializability.20257m

    Module 4: Transaction Processing

    Define serializability. Explain conflict and view serializability.

    View this question on its own page →

    CopySearch GoogleAsk AI
23. Q7a. Explain two-phase locking protocol with an example.20257m

    Module 4: Transaction Processing

    Explain two-phase locking protocol with an example.

    View this question on its own page →

    CopySearch GoogleAsk AI
24. Q7b. Explain concurrency control problems such as lost update, dirty read, and unrepeatable read.20257m

    Module 4: Transaction Processing

    Explain concurrency control problems such as lost update, dirty read, and unrepeatable read.

    View this question on its own page →

    CopySearch GoogleAsk AI
25. Q8a. Explain authentication, authorization, and the role of encryption in DBMS security.20257m

    Module 5: Database Security

    Explain authentication, authorization, and the role of encryption in DBMS security.

    View this question on its own page →

    CopySearch GoogleAsk AI
26. Q8b. Explain object-oriented databases and discuss their advantages over relational databases.20257m

    Module 6: Advanced Topics

    Explain object-oriented databases and discuss their advantages over relational databases.

    View this question on its own page →

    CopySearch GoogleAsk AI
27. Q9a. Write a short note on: Dependency Preservation and Lossless Decomposition20257m

    Module 2: Relational Query Languages & Design

    Write a short note on:

    Dependency Preservation and Lossless Decomposition

    View this question on its own page →

    CopySearch GoogleAsk AI
28. Q9b. Write a short note on: Database Recovery Techniques20257m

    Module 4: Transaction Processing

    Write a short note on:

    Database Recovery Techniques

    View this question on its own page →

    CopySearch GoogleAsk AI
29. Q9c. Write a short note on: SQL injection attacks20257m

    Module 5: Database Security

    Write a short note on:

    SQL injection attacks

    View this question on its own page →

    CopySearch GoogleAsk AI
30. Q9d. Write a short note on: data mining20257m

    Module 6: Advanced Topics

    Write a short note on:

    data mining

    View this question on its own page →

    CopySearch GoogleAsk AI