Database Management systems (DBMS) SPPU Endsem Question Paper May 2024
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 2024
- Max. marks
- 70
- Time
- 2½ Hours
- Semester
- I
- Paper code
- [6262]-35
Printed for: T.E.(Computer Engineering/AIDS )
Instructions to the candidates
- Answer Q.1or 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
- a)[9]
What is functional dependency? Explain its use in database design. Consider the following schema. Student (RollNo, Branch_code, Marks_Obtained, Exam_Name, Total_Marks) Identify the functional dependencies and check whether the given schema is in 3NF or not. If not justify and convert the schema into 3NF.
Also asked:Dec 2025
- b)[8]
Explain following Codd’s rules with suitable examples: i) Guaranteed Access Rule ii) Comprehensive Data Sub-Language Rule iii) Integrity Independence iv) Systematic Treatment of NULL Values.
OR- a)
Q2
- a)[8]
What is the impact of insert, update & delete anomaly on overall design of database? How normalization is used to remove these anomalies?
Also asked:May 2025
- b)[9]
This part has equations that don’t show as text. Open the PDF to read it.
- a)
Q3
- a)[9]
What is recoverable schedule? Why is recoverability of schedule desirable?Are there any circumstance under Which it could be desirable to allow non recoverable schedular? Explain your answer.
- b)[9]
State and explain the ACID properties. During its execution a transaction passes through several states, until it finally commits or aborts. List all possible sequences of states through which a transaction may pass. Explain the situations when each state transition occours.
OR- a)
Q4
- a)[9]
What is R-timestamp (Q) and W-timestamp(Q). Explain the necessary condition used by time stamp ordering protocol to execute for a read/write operation.
- b)[9]
What is conflict serializability? Check following schedule is conflict serializable or not? Also, explain the concept of conflict equivalent schedule. T1 T2 T3 T4 R(X) R(Z) W(X) R(Y) W(Y) W(X) W(Y) W(Z) R(X) denotes read operation on data item X by transaction Ti. W(X) denotes read operation on data item X by transaction Ti.
- a)
Q5
- a)[8]
List the different NOSQL data models. Explain document store NOSQL data model with example.
- b)[9]
Draw and explain architecture of Distributed database system. State the reasons for building distributed database systems. 3
OR- a)
Q6
Q7
ORQ8