Database Management System - B.Tech 5th Semester Exam., 2020

2020•Semester 3•Civil-CA•End Semester
Bihar Engineering University, Patna
B.Tech 5th Semester Exam., 2020

Database Management System

Time: 3 hoursCode: 105502Full Marks: 70

Instructions:

  1. The marks are indicated in the right-hand margin.
  2. There are NINE questions in this paper.
  3. Attempt FIVE questions in all.
  4. Question No. 1 is compulsory.
Q.1 Choose the correct answer of the following (any seven):[14]

  1. The way a particular application views the data from the database that the application uses is a

    1. module
    2. relational model
    3. schema
    4. subschema

  2. A relational database developer refers to a record as

    1. a criterion
    2. a relation
    3. a tuple
    4. an attribute

  3. Key to represent relationship between tables is called

    1. primary key
    2. secondary key
    3. foreign key
    4. None of the above

  4. It is better to use files than a DBMS when there are

    1. stringent real-time requirements
    2. multiple users wish to access the data
    3. complex relationships among data
    4. All of the above

  5. Which of the following are the five built-in functions provided by SQL?

    1. COUNT, SUM, AVG, MAX, MIN
    2. SUM, AVG, MIN, MAX, MULT
    3. SUM, AVG, MULT, DIV, MIN
    4. SUM, AVG, MIN, MAX, NAME

  6. A B-tree of order 4 and of height 3 will have a maximum of keys.

    1. 255
    2. 63
    3. 127
    4. 188

  7. Consider the following action: TRANSACTION..... Commit; ROLLBACK; What does rollback do?

    1. Undoes the transactions before commit
    2. Clears all transactions
    3. Redoes the transactions before commit
    4. No action

  8. Which of the following is used to get back all the transactions back after rollback?

    1. Commit
    2. Rollback
    3. Flashback
    4. Redo

  9. _____ is an attack which forces an end user to execute unwanted actions on a Web application in which he/she is currently authenticated.

    1. Two-factor authentication
    2. Cross-site request forgery
    3. Cross-site scripting
    4. Cross-site scoring scripting

  10. _____ 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.

    1. OpenID
    2. Single-site System
    3. Security Assertion Markup Language (SAML)
    4. Virtual Private Database (VPD)
Q.2 Solve both questions :[14]

  1. What are the five main functions of a database administrator?

  2. What are four main differences between file-processing system and a DBMS?

Q.3 Solve this question :[14]

  1. 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.

Q.4 Solve both questions :[14]

  1. What is the use of relational query language in DBMS? Use the example to explain tuple and domain relational calculus.

  2. Explain the following operations with the help of examples: (i) Generalized projection (ii) Outer join (iii) Aggregate function

Q.5 Solve this question :[14]

  1. 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) Eight

Q.6 Solve both questions :[14]

  1. List the ACID properties. Explain the usefulness of each.

  2. What benefit is provided by rigorous two-phase locking? How does it compare with other forms of two-phase locking?

Q.7 Solve both questions :[14]

  1. What is the purpose of having separate categories for index authorization and resource authorization?

  2. Explain the data mining and data warehousing related to DBMS.

Q.8 Solve this question :[14]

  1. 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 \rightarrow BC \)
    \( CD \rightarrow E \)
    \( B \rightarrow D \)
    \( E \rightarrow A \)

Q.9 Write short notes on the following:[14]
    • RBAC model
    • Concurrency control