2020 question paper
Database Management System
23 questions
Q1a. The way a particular application views the data from the database that the application uses is a (i) module (ii) relational model (iii) schema (iv) subschema20202m
Module 1: Database System Architecture
View this question on its own page →The way a particular application views the data from the database that the application uses is a
(i) module
(ii) relational model
(iii) schema
(iv) subschemaQ1b. A relational database developer refers to a record as (i) a criterion (ii) a relation (iii) a tuple (iv) an attribute20202m
Module 2: Relational Query Languages & Design
View this question on its own page →A relational database developer refers to a record as
(i) a criterion
(ii) a relation
(iii) a tuple
(iv) an attributeQ1c. Key to represent relationship between tables is called (i) primary key (ii) secondary key (iii) foreign key (iv) None of the above20202m
Module 1: Database System Architecture
View this question on its own page →Key to represent relationship between tables is called
(i) primary key
(ii) secondary key
(iii) foreign key
(iv) None of the aboveQ1d. It is better to use files than a DBMS when there are (i) stringent real-time requirements (ii) multiple users wish to access the data (iii) complex relationships among data (iv) All of the above20202m
Module 1: Database System Architecture
View this question on its own page →It is better to use files than a DBMS when there are
(i) stringent real-time requirements
(ii) multiple users wish to access the data
(iii) complex relationships among data
(iv) All of the aboveQ1e. Which of the following are the five built-in functions provided by SQL? (i) COUNT, SUM, AVG, MAX, MIN (ii) SUM, AVG, MIN, MAX, MULT (iii) SUM, AVG, MULT, DIV, MIN (iv) SUM, AVG, MIN, MAX, NAME20202m
Module 2: Relational Query Languages & Design
View this question on its own page →Which of the following are the five built-in functions provided by SQL?
(i) COUNT, SUM, AVG, MAX, MIN
(ii) SUM, AVG, MIN, MAX, MULT
(iii) SUM, AVG, MULT, DIV, MIN
(iv) SUM, AVG, MIN, MAX, NAMEQ1f. A B-tree of order 4 and of height 3 will have a maximum of ____ keys. (i) 255 (ii) 63 (iii) 127 (iv) 18820202m
Module 3: Storage Strategies
View this question on its own page →A B-tree of order 4 and of height 3 will have a maximum of ____ keys.
(i) 255
(ii) 63
(iii) 127
(iv) 188Q1g. Consider the following action : TRANSACTION..... Commit; ROLLBACK; What does rollback do? (i) Undoes the transactions before commit (ii) Clears all transactions (iii) Redoes the transactions before commit (iv) No action20202m
Module 4: Transaction Processing
View this question on its own page →Consider the following action :
TRANSACTION.....
Commit;
ROLLBACK;What does rollback do?
(i) Undoes the transactions before commit
(ii) Clears all transactions
(iii) Redoes the transactions before commit
(iv) No actionQ1h. Which of the following is used to get back all the transactions back after rollback? (i) Commit (ii) Rollback (iii) Flashback (iv) Redo20202m
Module 4: Transaction Processing
View this question on its own page →Which of the following is used to get back all the transactions back after rollback?
(i) Commit
(ii) Rollback
(iii) Flashback
(iv) RedoQ1i. ____ is an attack which forces an end user to execute unwanted actions on a Web application in which he/she is currently authenticated. (i) Two-factor authentication (ii) Cross-site request forgery (iii) Cross-site scripting (iv) Cross-site scoring scripting20202m
Module 5: Database Security
View this question on its own page →____ is an attack which forces an end user to execute unwanted actions on a Web application in which he/she is currently authenticated.
(i) Two-factor authentication
(ii) Cross-site request forgery
(iii) Cross-site scripting
(iv) Cross-site scoring scriptingQ1j. ____ allows a system administrator to associate a function with a relation; the function returns a predicate that must be added to any query that uses the relation. (i) OpenID (ii) Single-site System (iii) Security Assertion Markup Language (SAML) (iv) Virtual Private Database (VPD)20202m
Module 5: Database Security
View this question on its own page →____ allows a system administrator to associate a function with a relation; the function returns a predicate that must be added to any query that uses the relation.
(i) OpenID
(ii) Single-site System
(iii) Security Assertion Markup Language (SAML)
(iv) Virtual Private Database (VPD)Q2a. What are the five main functions of a database administrator?20207m
Module 1: Database System Architecture
View this question on its own page →What are the five main functions of a database administrator?
Q2b. What are four main differences between file-processing system and a DBMS?20207m
Module 1: Database System Architecture
View this question on its own page →What are four main differences between file-processing system and a DBMS?
Q3. Construct an *E-R diagram* for a university registrar's office. The office maintains data about each class, including the instructor, the enrollment, and the time and place of the class meetings. For each class pair, a grade is recorded. Document all assumptions that you make about the mapping constraints.202014m
Module 1: Database System Architecture
View this question on its own page →Construct an E-R diagram for a university registrar's office. The office maintains data about each class, including the instructor, the enrollment, and the time and place of the class meetings. For each class pair, a grade is recorded. Document all assumptions that you make about the mapping constraints.
Q4a. What is the use of relational query language in DBMS? Use the example to explain tuple and domain relational calculus.20207m
Module 2: Relational Query Languages & Design
View this question on its own page →What is the use of relational query language in DBMS? Use the example to explain tuple and domain relational calculus.
Q4b. Explain the following operations with the help of examples: (i) Generalized projection (ii) Outer join (iii) Aggregate function20207m
Module 2: Relational Query Languages & Design
View this question on its own page →Explain the following operations with the help of examples:
(i) Generalized projection
(ii) Outer join
(iii) Aggregate functionQ5. Construct the B+ tree for the following set of key values: (2, 3, 5, 7, 11, 17, 19, 23, 29, 31) Assume that tree is initially empty and values are added in ascending order. Construct B+ tree for the cases where the number of pointers that will fit in one node is as follows: (a) Four (b) Six (c) Eight202014m
Module 3: Storage Strategies
View this question on its own page →Construct the B+ tree for the following set of key values:
(2, 3, 5, 7, 11, 17, 19, 23, 29, 31)
Assume that tree is initially empty and values are added in ascending order. Construct B+ tree for the cases where the number of pointers that will fit in one node is as follows:
(a) Four
(b) Six
(c) EightQ6a. List the ACID properties. Explain the usefulness of each.20207m
Module 4: Transaction Processing
View this question on its own page →List the ACID properties. Explain the usefulness of each.
Q6b. What benefit is provided by rigorous two-phase locking? How does it compare with other forms of two-phase locking?20207m
Module 4: Transaction Processing
View this question on its own page →What benefit is provided by rigorous two-phase locking? How does it compare with other forms of two-phase locking?
Q7a. What is the purpose of having separate categories for index authorization and resource authorization?20207m
Module 5: Database Security
View this question on its own page →What is the purpose of having separate categories for index authorization and resource authorization?
Q7b. Explain the data mining and data warehousing related to DBMS.20207m
Module 6: Advanced Topics
View this question on its own page →Explain the data mining and data warehousing related to DBMS.
Q8. Compute the closure (F+) of the following set of functional dependencies for the relational schema (A, B, C, D, E) = R. List the candidate keys for R: A → BC CD → E B → D E → A202014m
Module 2: Relational Query Languages & Design
View this question on its own page →Compute the closure (F+) of the following set of functional dependencies for the relational schema
(A, B, C, D, E) = R. List the candidate keys forR:A → BCCD → EB → DE → AQ9a. Write short notes on the following: (a) RBAC model20207m
Module 5: Database Security
View this question on its own page →Write short notes on the following:
(a) RBAC modelQ9b. Write short notes on the following: (b) Concurrency control20207m
Module 4: Transaction Processing
View this question on its own page →Write short notes on the following:
(b) Concurrency control