TGPSC HMWSSB Manager Database Management Systems previous year questions with answers
Every Database Management Systems question asked in the TGPSC HMWSSB Manager (Engineering) papers on this site, grouped by topic. Answers come from TSPSC's final key; each has a short explanation (free here for a sample, all of them in the practice app).
Practise Database Management Systems onlineER & Relational Model
The referential integrity rule requires that
- Every null foreign key value must reference an existing primary key value.
- It makes it possible for an attribute to have a corresponding value.
- Every non-null foreign key value must reference an existing primary key value.
- It makes it possible to delete a row in one table whose primary key does not have a matching foreign key value in another table.
Show answer
Answer: (3) Every non-null foreign key value must reference an existing primary key value.
Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.
The entity integrity rule requires that
- All primary key entries are unique
- A part of the key may be null
- Foreign key values do not reference primary key values
- Duplicate object values are allowed
Show answer
Answer: (1) All primary key entries are unique
Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.
SQL & Relational Algebra
Consider relations R(A,B) and S(C,D); and the following SQL query.
Select distinct A,B, from R,S
Under what conditions the result is guaranteed to be same as R.
- R has no duplicate and S is non-empty
- R and S have no duplicates
- S has no duplicates and R is non-empty
- R and S have the same number of tuples
Show answer
Answer: (1) R has no duplicate and S is non-empty
Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.
Which one of the following relational algebra transformations is incorrect?
- σ_C1(σ_C1(R)) → σ_C2(σ_C2(R))
- σ_C(π_A(R)) → π_A(σ_C(R))
- σ_C(R ∪ S) → σ_C(R) ∪ σ_C(S)
- σ_C(R) → π_A(R)
Show answer
Answer: (4) σ_C(R) → π_A(R)
Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.
If relation R has m tuples and S has n tuples, what is the maximum and minimum number of tuples in R ⋈ S?
- m + n and 0
- mn and 0
- m + n and |m − n|
- mn and m + n
Show answer
Answer: (2) mn and 0
Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.
Normalisation
Which of the following normal forms eliminates the anomalies of multivalued dependencies?
- 3NF
- BCNF
- 4NF
- 5NF
Show answer
Answer: (3) 4NF
Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.
Let R = (A, B, C, D) and F = {A → B, A → C, BC → D}, then which of the following is correct?
- B → D
- A → B
- A → D
- D → A
Show answer
Answer: (3) A → D
Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.
Which of the following statements is correct?
- Every relation in 2NF is also in BCNF
- Every relation in BCNF is also in 3NF
- No relation can be in both BCNF and 3NF
- Every relation is ZNF is also in 3 NF
Show answer
Answer: (2) Every relation in BCNF is also in 3NF
Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.
Transactions, Concurrency & Indexing
Which one of the following state transitions is made when the transaction has been rolled back and the database is restored to the state prior to the start of the transition?
- Active→Partially Committed
- Active→Committed
- Active→Aborted
- Partially Committed→Committed
Show answer
Answer: (3) Active→Aborted
Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.
Consider the schedule S and determine which one of the following schedules is conflict equivalent schedule to S. S: R₁(X); R₂(Z); R₁(Z); R₃(X); R₃(Y); W₁(X); W₃(Y); R₂(Y); W₂(Z); W₂(Y)
- T1→T2→T3
- T2→T1→T3
- T3→T1→T2
- T3→T2→T1
Show answer
Answer: (3) T3→T1→T2
Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.
Which one of the following file organization techniques provides very fast direct access?
- Hashed File Organization
- B-Tree Organization
- B+ Tree Organization
- Indexed-Sequential File Organization
Show answer
Answer: (1) Hashed File Organization
Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.