Scribd Logo
Upload

Welcome to Scribd!

  • 47 views

    114CQ052015 PDF

    Uploaded by

    Archana
    This document is an exam paper for a Database Management Systems course. It contains 10 questions split into 2 parts - Part A contains 9 short answer questions worth a total of 25 marks, and Part B contains 5 longer answer questions worth 10 marks each for a total of 50 marks. The questions cover a range of topics in database systems including data models, relational algebra, SQL, transaction management, concurrency control, crash recovery, indexing, and file organizations.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    114CQ052015 PDF

    Uploaded by

    Archana
    47 views2 pages
    This document is an exam paper for a Database Management Systems course. It contains 10 questions split into 2 parts - Part A contains 9 short answer questions worth a total of 25 marks, and Part B contains 5 longer answer questions worth 10 marks each for a total of 50 marks. The questions cover a range of topics in database systems including data models, relational algebra, SQL, transaction management, concurrency control, crash recovery, indexing, and file organizations.

    Original Title

    114CQ052015.pdf

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document is an exam paper for a Database Management Systems course. It contains 10 questions split into 2 parts - Part A contains 9 short answer questions worth a total of 25 marks, and Part B contains 5 longer answer questions worth 10 marks each for a total of 50 marks. The questions cover a range of topics in database systems including data models, relational algebra, SQL, transaction management, concurrency control, crash recovery, indexing, and file organizations.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    47 views2 pages

    114CQ052015 PDF

    Uploaded by

    Archana
    This document is an exam paper for a Database Management Systems course. It contains 10 questions split into 2 parts - Part A contains 9 short answer questions worth a total of 25 marks, and Part B contains 5 longer answer questions worth 10 marks each for a total of 50 marks. The questions cover a range of topics in database systems including data models, relational algebra, SQL, transaction management, concurrency control, crash recovery, indexing, and file organizations.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    of 2

    Code No: 114CQ R13

    JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD


    B.Tech II Year II Semester Examinations, May-2015
    DATABASE MANAGEMENT SYSTEMS
    (Common to CSE, IT)
    Time: 3 Hours Max. Marks: 75

    Note: This question paper contains two parts A and B.


    Part A is compulsory which carries 25 marks. Answer all questions in Part A.
    Part B consists of 5 Units. Answer any one full question from each unit. Each
    question carries 10 marks and may have a, b, c as sub questions.

    PART- A (25 Marks)

    1.a) Differentiate between schema and data model. [2M]


    b) Give an example for total participation and partial participation. [3M]
    c) List the primitive operators in Relational Algebra. [2M]
    d) What is an active database? [3M]
    e) Define SECOND Normal form. [2M]
    f) Write about join dependencies. [3M]
    g) What methods are used to assign timestamps to transactions? [2M]
    h) What is the significance remote backup system? [3M]
    i) What is meant by secondary index? [2M]
    j) How to compute the disk access time? [3M]

    PART - B (50 Marks)

    2.a) List various categories of database users and discuss their interfaces to DBMS.
    b) Discuss the functionality of query evaluation engine. [5+5]
    OR
    3. Construct an Entity-Relationship diagram for a online shopping systems such as
    Jabong/Flipcart. Quote your assumptions and list the requirements considered by
    you for conceptual database design for the above system. [10]

    4.a) With a suitable example explain division operation in relational algebra.


    b) What is the usage of ‘group by’ and ‘having’ clauses in SQL? [5+5]
    OR
    5. Consider the following schema to write queries in Domain relational calculus:
    Sailor(sid, sname, age, rating)
    Boats(bid, bname, bcolor)
    Reserves(sid,bid,day)
    a) Find the boats reserved by sailor with id 567.
    b) Find the names of the sailors who reserved ‘red’ boats.
    c) Find the boats which have at least two reservations by different sailors. [10]

    6. What is meant by closure of F? Where F is the set of functional dependencies.


    Explain computing F+ with suitable examples. [10]
    OR
    7.a) www.ManaResults.co.in
    Differentiate between FD and MVD.
    b) Explain the problems related to decomposition. [5+5]
    8.a) Explain transaction states and desirable properties.
    b) How to test serializability of a schedule? Explain with an example. [5+5]
    OR
    9.a) Explain Failure classification.
    b) What is log? What is log tail? Explain the concept of checkpoint log record. [5+5]

    10. Explain extendable hashing techniques for indexing data records. Consider your
    class students data records and roll number as index attribute and show the hash
    directory. [10]
    OR
    11.a) Is disk cylinder a logical concept? Justify your answer.
    b) Compare heap file organization with hash file organization. [5+5]

    ---ooOoo---

    www.ManaResults.co.in

    You might also like

    pFad - Phonifier reborn

    Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

    Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


    Alternative Proxies:

    Alternative Proxy

    pFad Proxy

    pFad v3 Proxy

    pFad v4 Proxy