Skip to content
EndsemMay 20252019 patternSE IT

Database Management System (DBMS) SPPU Endsem Question Paper May 2025

All 8 questions from this SPPU endsem paper, as printed. Read them here or open the PDF.

Open the PDF
Subject code
214452
Pattern
2019 pattern
Exam
Endsem
Session
May 2025
Max. marks
70
Time
2½ Hours
Semester
IV
Paper code
[6402]-61

Printed for: S.E. (Information Technology)

Instructions to the candidates

  1. Answer Q.1 or Q.2, Q.3 or Q.4, Q.5 or Q.6. Q.7 or Q.8.
  2. Neat diagrams must be drawn wherever necessary.
  3. Figures to the right indicate full marks.
  4. Assume suitable data, if necessary.

Questions

  1. Q1

    1. a)

      What is view in SQL and how it is define? Discuss the problem that may arise when one attempt to update views. How views are typically updated?

      [8]
    2. b)

      Write a note on Database modification using SQL.

      [6]
    3. c)

      Differentiate between: WHERE and HAVING clauses in SQL.

      [4]

  2. Q2

    1. a)

      Describe the circumstances in which you would choose to use embedded SQL rather than using SQL alone or using only a general purpose programming language. Compare dynamic and embedded SQL with suitable example.

      [8]
    2. b)

      With suitable example explain SQL aggregate functions.

      [6]
    3. c)

      Explain the concept of trigger with suitable example.

      [4]

  3. Q3

    1. a)

      Define BCNF? How does it differ from 3NF? Why is it consider a stronger form of 3NF?

      [7]
    2. b)

      This part has equations that don’t show as text. Open the PDF to read it.

      [6]
    3. c)

      Write a note on Measures of Query cost.

      Also asked:Nov 2025

      [4]

  4. Q4

    1. a)

      This part has equations that don’t show as text. Open the PDF to read it.

      [6]
    2. b)

      Show that with suitable example: if a relation schema is in BCNF, then it is also in 3NF.

      [6]
    3. c)

      Write a note on evaluation of expression. 2

      [5]

  5. Q5

    1. a)

      Give test for conflict serializability. Check whether following schedule is conflict serializable. T1 T2 Read(A) Write(A) Read(A) Write(A) Read(B) Write(B) Read(B) Write(B)

      [6]
    2. b)

      Explain the concept of transaction. Describe ACID properties for transaction.

      [6]
    3. c)

      Discuss the problem with concurrency. Describe any two method based on locks to control concurrency.

      [6]

  6. Q6

    1. a)

      Differentiate between conflict and view serializability. Given precedence graph, is the corresponding schedule conflict serializable.

      [6]
    2. b)

      When do deadlock happen, how to prevent them and how to recover if deadlock takes place?

      [6]
    3. c)

      Explain deferred database modification and immediate database modification and their differences in the context of recovery.

      [6]

  7. Q7

    1. a)

      State which database system architecture you will prefer for following application. i) Railway reservation system ii) Search Engine iii) College admission system

      [6]
    2. b)

      Draw and explain architecture of parallel Databases.

      Also asked:Nov 2025

      [6]
    3. c)

      What are the characteristics of NoSQL cloud databases.

      [5]

  8. Q8

    1. a)

      What is fragment of a relation? What are the main type of fragmentation? Why is fragmentation a useful context in distributed database design.

      [6]
    2. b)

      Explain centralize and client server database architecture.

      [6]
    3. c)

      What are the requirement of mobile databases? List existing mobile databases. 

      [5]