2022 question paper
Database Management System
27 questions
Q1a. Four DML commands are : (i) create, update, delete, select (ii) insert, update, drop, select (iii) create, alter, delete, select (iv) insert, modify, delete, select20222m
Module 1: Database System Architecture
View this question on its own page →Four DML commands are :
(i) create, update, delete, select
(ii) insert, update, drop, select
(iii) create, alter, delete, select
(iv) insert, modify, delete, selectQ1b. View is a : (i) temporary table (ii) virtual table (iii) dynamic table (iv) permanent table20222m
Module 1: Database System Architecture
View this question on its own page →View is a :
(i) temporary table
(ii) virtual table
(iii) dynamic table
(iv) permanent tableQ1c. The different levels of data abstraction are: (i) Physical level (ii) Logical level (iii) View level (iv) all of the above20222m
Module 1: Database System Architecture
View this question on its own page →The different levels of data abstraction are:
(i) Physical level
(ii) Logical level
(iii) View level
(iv) all of the aboveQ1d. Which of the following is true? (i) a super-key is always a candidate key. (ii) every 3NF schema is also a BCNF. (iii) generalization is bottom-up approach. (iv) none of these.20222m
Module 2: Relational Query Languages & Design
View this question on its own page →Which of the following is true?
(i) a super-key is always a candidate key.
(ii) every 3NF schema is also a BCNF.
(iii) generalization is bottom-up approach.
(iv) none of these.Q1e. What is the purpose of project operation: (i) It selects certain columns. (ii) It selects certain rows. (iii) It selects certain strings. (iv) It selects certain integers.20222m
Module 2: Relational Query Languages & Design
View this question on its own page →What is the purpose of project operation:
(i) It selects certain columns.
(ii) It selects certain rows.
(iii) It selects certain strings.
(iv) It selects certain integers.Q1f. The weak entity set does not have sufficient attributes to form. (i) Primary key (ii) Candidate key (iii) Both (i) and (ii) (iv) Super key20222m
Module 1: Database System Architecture
View this question on its own page →The weak entity set does not have sufficient attributes to form.
(i) Primary key
(ii) Candidate key
(iii) Both (i) and (ii)
(iv) Super keyQ1g. Which normal form is considered adequate for normal relational database design? (i) 2 NF (ii) 5 NF (iii) 4 NF (iv) 3 NF20222m
Module 2: Relational Query Languages & Design
View this question on its own page →Which normal form is considered adequate for normal relational database design?
(i) 2 NF
(ii) 5 NF
(iii) 4 NF
(iv) 3 NFQ1h. Which of the following is not a super key in R(V, W, X, Y, Z) with primary key VY? (i) VXYZ (ii) VWXZ (iii) VWXY (iv) VWXYZ20222m
Module 2: Relational Query Languages & Design
View this question on its own page →Which of the following is not a super key in R(V, W, X, Y, Z) with primary key VY?
(i) VXYZ
(ii) VWXZ
(iii) VWXY
(iv) VWXYZQ1i. Consider R (A, B, C, D, E) with following FDs:- A → B, A → C, CD → E, B → D, E → A which of the following FDs is not implied by above set? (i) CD → AC (ii) BD → CD (iii) BC → CD (iv) AC → BC20222m
Module 2: Relational Query Languages & Design
View this question on its own page →Consider R (A, B, C, D, E) with following FDs:-
A → B, A → C, CD → E, B → D, E → A which of the following FDs is not implied by above set?
(i) CD → AC
(ii) BD → CD
(iii) BC → CD
(iv) AC → BCQ1j. Which of the following is a concurrency control protocol. (i) Strict 2-phase locking protocol (ii) Timestamp based protocol (iii) Graph based protocol (iv) All of the above20222m
Module 4: Transaction Processing
View this question on its own page →Which of the following is a concurrency control protocol.
(i) Strict 2-phase locking protocol
(ii) Timestamp based protocol
(iii) Graph based protocol
(iv) All of the aboveQ2a. What is attribute closure X⁺ of a set of attributes X with respect to a set of FDs F? Give the algorithm for commuting X⁺ for X.20227m
Module 2: Relational Query Languages & Design
View this question on its own page →What is attribute closure X⁺ of a set of attributes X with respect to a set of FDs F? Give the algorithm for commuting X⁺ for X.
Q2b. Relation R (ABCDEFGH) contains only atomic values for all of its attributes. F = {CH → G, A → BC, B → CFH, E → A, F → EG} is a set of functional dependencies (FDs) so that F is exactly the set of FDs that hold for R. (i) Find all the candidate keys the relation R have? (ii) Find the highest normal form with justification in which R exist?20227m
Module 2: Relational Query Languages & Design
View this question on its own page →Relation R (ABCDEFGH) contains only atomic values for all of its attributes. F = {CH → G, A → BC, B → CFH, E → A, F → EG} is a set of functional dependencies (FDs) so that F is exactly the set of FDs that hold for R.
(i) Find all the candidate keys the relation R have?
(ii) Find the highest normal form with justification in which R exist?Q3a. Briefly explain the ACID properties of the transactions to ensure integrity of the data.20227m
Module 4: Transaction Processing
View this question on its own page →Briefly explain the ACID properties of the transactions to ensure integrity of the data.
Q3b. Consider the transactions T1, T2 and T3 and schedules S1 and S2 given below: T1 : r1 (X); r1(Z); w1 (X); w1 (Z), T2 : r2 (Y); r2 (Z); w2 (Z) T3 : r3 (Y); r3 (X); w3 (Y) S1 : r1 (X); r3(Y); r3(X); r2 (Y); r2(Z); w3(Y); w2 (Z); r1 (Z); w1(X), w1 (Z). S2 : r1 (X); r3 (Y); r2(Y); r3(X); r1(Z); r2(Z); w3 (Y); w1 (X); w2(Z), w1 (Z). Determine which of the above schedules are conflict – serializable.20227m
Module 4: Transaction Processing
View this question on its own page →Consider the transactions T1, T2 and T3 and schedules S1 and S2 given below:
T1 : r1 (X); r1(Z); w1 (X); w1 (Z),
T2 : r2 (Y); r2 (Z); w2 (Z)
T3 : r3 (Y); r3 (X); w3 (Y)
S1 : r1 (X); r3(Y); r3(X); r2 (Y); r2(Z); w3(Y); w2 (Z); r1 (Z); w1(X), w1 (Z).
S2 : r1 (X); r3 (Y); r2(Y); r3(X); r1(Z); r2(Z); w3 (Y); w1 (X); w2(Z), w1 (Z).
Determine which of the above schedules are conflict – serializable.Q4a. Explain the reasons for the update, insertion and deletion anomalies.20227m
Module 2: Relational Query Languages & Design
View this question on its own page →Explain the reasons for the update, insertion and deletion anomalies.
Q4b. With example discuss candidate key, super key, primary key and foreign key.20227m
Module 1: Database System Architecture
View this question on its own page →With example discuss candidate key, super key, primary key and foreign key.
Q5a. What are the typical phases of query processing? With a sketch, discuss these phases in high level query processing.20227m
Module 2: Relational Query Languages & Design
View this question on its own page →What are the typical phases of query processing? With a sketch, discuss these phases in high level query processing.
Q5b. When is the decomposition of relation schema R into two relation schemes X and Y, said to be a loss-less-join decomposition? Why is this property so important? Explain with example.20227m
Module 2: Relational Query Languages & Design
View this question on its own page →When is the decomposition of relation schema R into two relation schemes X and Y, said to be a loss-less-join decomposition? Why is this property so important? Explain with example.
Q6a. Explain the terms ‘partial functional dependency’ and ‘transitive dependency’. Define 2NF and 3 NF in relation with these terms.20227m
Module 2: Relational Query Languages & Design
View this question on its own page →Explain the terms ‘partial functional dependency’ and ‘transitive dependency’. Define 2NF and 3 NF in relation with these terms.
Q6b. Discuss the concept of generalization, specialization and aggregation.20227m
Module 1: Database System Architecture
View this question on its own page →Discuss the concept of generalization, specialization and aggregation.
Q7a. Consider the following employee database, primary keys are underlined. Employee (ename, street, city) Works (ename, cname, salary) Company (cname, city) Manages (ename, manager-name) Write SQL queries to (i) Find the names of all the employees who work for XYZ. (ii) Find all employees who live in the same city as the company for which they work. (iii) Find all employees who live in the same cities and on the same streets as do their managers. (iv) Find all employees who earn more than the average salary of all employees of their company.202214m
Module 2: Relational Query Languages & Design
View this question on its own page →Consider the following employee database, primary keys are underlined.
Employee (ename, street, city)
Works (ename, cname, salary)
Company (cname, city)
Manages (ename, manager-name)Write SQL queries to
(i) Find the names of all the employees who work for XYZ.
(ii) Find all employees who live in the same city as the company for which they work.
(iii) Find all employees who live in the same cities and on the same streets as do their managers.
(iv) Find all employees who earn more than the average salary of all employees of their company.Q8a. Discuss the advantages and disadvantages of using DBMS as compared to a conventional file system.20227m
Module 1: Database System Architecture
View this question on its own page →Discuss the advantages and disadvantages of using DBMS as compared to a conventional file system.
Q8b. What is weak entity set? Explain with suitable example. How weak entities are represented as relational schemas.20227m
Module 1: Database System Architecture
View this question on its own page →What is weak entity set? Explain with suitable example. How weak entities are represented as relational schemas.
Q9a. Write short notes on: SQL Injection20227m
Q9b. Write short notes on: Two-phase locking protocol20227m
Module 4: Transaction Processing
View this question on its own page →Write short notes on: Two-phase locking protocol
Q9c. Write short notes on: Object Oriented DBMS20227m
Module 6: Advanced Topics
View this question on its own page →Write short notes on: Object Oriented DBMS
Q9d. Write short notes on: Armstrong's Axioms20227m
Module 2: Relational Query Languages & Design
View this question on its own page →Write short notes on: Armstrong's Axioms