Skip to content
SmartFigureEdu

CS 3492 Database Management Systems question paper, April/May 2024

Download PDFRepeated questions and unit-wise bank

Question Paper Code : 50905

B.E./B.Tech. DEGREE EXAMINATIONS, APRIL/MAY 2024.

Third/Fourth Semester

Computer Science and Engineering

CS 3492 — DATABASE MANAGEMENT SYSTEMS

(Common to : Computer Science and Design/Computer and Communication Engineering/Computer Science and Business Systems/Information Technology)

(Regulations 2021)

Time : Three hoursMaximum : 100 marks

Answer ALL questions.

PART A — (10 × 2 = 20 marks)

  1. 1.

    Differentiate File processing system and Database processing system.

  2. 2.

    List some relational algebra operations.

  3. 3.

    Define Entity, Relationship and attributes in ER model.

  4. 4.

    Why BCNF is preferred over 3NF?

  5. 5.

    List the properties of transactions.

  6. 6.

    How will you handle deadlock during two transactions in database?

  7. 7.

    What is hash based indexing?

  8. 8.

    List three components of Query processor.

  9. 9.

    Define Distributed Database.

  10. 10.

    What are the challenges faced when using an encrypted system?

PART B — (5 × 13 = 65 marks)

  1. 11.
    (a)

    What is datamodel? List its different types. Explain with suitable example.

  2. Or
  3. (b)

    Discuss about domain integrity. Give an example.

  4. 12.
    (a)

    What is normalizations? List its benefits and explain briefly about 3NF, 4NF and BCNF with suitable example.

  5. Or
  6. (b)
    • (i)Illustrate functional dependency with an example.(7)
    • (ii)Discuss about dependency preservation.(6)
  7. 13.
    (a)

    Demonstrate conflict serializability and view serializability.

  8. Or
  9. (b)
    • (i)Discuss in detail about Multiple Granularity.(7)
    • (ii)Explain different types of locks.(6)
  10. 14.
    (a)

    Explain B+ trees. Discuss about this Dynamic Index Structure.

  11. Or
  12. (b)

    Compare I/O costs for all File Organizations.

  13. 15.
    (a)

    Explain distributed database architecture in detail.

  14. Or
  15. (b)

    Explain in detail about key value stores and role based access control in advanced database management systems.

PART C — (1 × 15 = 15 marks)

  1. 16.
    (a)

    Consider the following relational schemes for a library database: Book (Title, Author, Catalog_no, Publisher, Year, Price) Collection (Title, Author, Catalog_no) the following are functional dependencies:

    • (i)Title Author -> Catalog_no
    • (ii)Catalog_no -> Title Author Publisher Year
    • (iii)Publisher Title Year -> Price
    • (iv)Assume {Author Title} is the key for both schemes. Apply the appropriate normal form for Book and Cancellation?
  2. Or
  3. (b)

    Consider a B+-tree in which the maximum number of keys in a node is 5. Calculate the minimum number of keys in any non-root node.

Other CS3492 papers