Database Management systems (DBMS) SPPU Endsem Question Paper May 2025
All 8 questions from this SPPU endsem paper, as printed. Read them here or open the PDF.
- Subject code
- 310241
- Pattern
- 2019 pattern
- Exam
- Endsem
- Session
- May 2025
- Max. marks
- 70
- Time
- 2½ Hours
- Semester
- V
- Paper code
- [6403]-35
Printed for: T.E. (Computer Engineering) (AI.D.S)
Instructions to the candidates
- Answers Q.1 or Q.2, Q.3 or Q.4, Q.5 or Q.6, Q.7 or Q.8.
- Neat diagrams must be drawn wherever necessary.
- Figures to the right indicate full marks.
- Assume suitable data, if necessary.
Questions
Q1
ORQ2
- a)[8]
What are the desirable properties of decomposition? Explain it with example.
- b)[9]
Explain partial, full and transitive dependency with examples.
- a)
Q3
ORQ4
- a)[9]
What is conflict serializability? How to check schedule is conflict serializable schedule? Explain with one example.
- b)[9]
This part has equations that don’t show as text. Open the PDF to read it.
- a)
Q5
- a)[8]
Explain the CAP theorem referred during the development of any distributed application.
- b)[9]
Explain the NOSQL database types with examples and write down the real time applications.
Also asked:Dec 2025
OR- a)
Q6
Q7
- a)[9]
What is the significance of XML databases? Explain with example the use of XML databases.
- b)[9]
What is Deductive Database. Explain its features and state its advantages over traditional database.
Also asked:May 2024
OR- a)
Q8