Scribd Logo
Upload

Welcome to Scribd!

  • 117 views

    DBMS 2013 Question Paper

    Uploaded by

    sachin verma
    The document is an exam for a Database Management Systems course covering 5 units: 1) Database structure and ER diagrams 2) Logical database design, views, and relational algebra 3) SQL queries and keywords 4) Functional dependencies, attribute closures, and normalization 5) Concurrency control, recovery algorithms, and media recovery Students must answer all questions from each unit, choosing between multiple options, within the allotted time of 3 hours.

    Copyright:

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

    DBMS 2013 Question Paper

    Uploaded by

    sachin verma
    117 views2 pages
    The document is an exam for a Database Management Systems course covering 5 units: 1) Database structure and ER diagrams 2) Logical database design, views, and relational algebra 3) SQL queries and keywords 4) Functional dependencies, attribute closures, and normalization 5) Concurrency control, recovery algorithms, and media recovery Students must answer all questions from each unit, choosing between multiple options, within the allotted time of 3 hours.

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document is an exam for a Database Management Systems course covering 5 units: 1) Database structure and ER diagrams 2) Logical database design, views, and relational algebra 3) SQL queries and keywords 4) Functional dependencies, attribute closures, and normalization 5) Concurrency control, recovery algorithms, and media recovery Students must answer all questions from each unit, choosing between multiple options, within the allotted time of 3 hours.

    Copyright:

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

    DBMS 2013 Question Paper

    Uploaded by

    sachin verma
    The document is an exam for a Database Management Systems course covering 5 units: 1) Database structure and ER diagrams 2) Logical database design, views, and relational algebra 3) SQL queries and keywords 4) Functional dependencies, attribute closures, and normalization 5) Concurrency control, recovery algorithms, and media recovery Students must answer all questions from each unit, choosing between multiple options, within the allotted time of 3 hours.

    Copyright:

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

    [Nov-13]

    [EURCS-504/EURIT-504]
    B.Tech. Degree Examination
    CSE & IT
    V SEMESTER
    DATABASE MANAGEMENT SYSTEMS
    (Effective from the admitted batch 2007–08)
    Time: 3 Hours Max.Marks: 60
    ----------------------------------------------------------------------------------------------------
    Instructions: Each Unit carries 12 marks.
    Answer all units choosing one question from each unit.
    All parts of the unit must be answered in one place only.
    Figures in the right hand margin indicate marks allotted.
    ---------------------------------------------------------------------------------------------------
    UNIT-I
    1. Discuss the structure of the DBMS 12
    OR
    2. What is an ER diagram end discuss several choices to be made
    when generating an ER diagram 12
    UNIT-II
    3. a) What do you understand by logical database design? Explain 8
    b) What is a view? What is update restriction on a view? 4
    OR
    4. Explain the following unary operations in Relational Algebra
    a) Selection b) Projection c) Rename 12
    UNIT-III
    5. Give one example of SQL Query for the following keywords
    a) ROLLBACK b) CONTINUE c) EXISTS d) ANY
    e) GROUP BY … HAVING f) LIKE 12
    OR
    6. a) Explain how performance and reliability can be improved
    through RAID 2
    b) Explain how the hash based indexing can be performed 10
    UNIT-IV
    7. Explain how do you compute the following with example
    a) Dependency closure F + of a set F of FDs
    P P 6
    b) Attribute closure X + of a set of attributes X w.r.t a set of FDs F
    P P

    6
    OR
    8. Take a un-normalized relation and apply the rules of 1 st , 2 nd , 3 rd
    P P P P P P

    normal forms show the transformations at each stage 12


    UNIT-V
    9. Why concurrency control is needed in the databases? Explain with
    examples 12
    OR
    10. a) Explain ARIES recovery algorithm 6
    b) Explain about media recovery 6

    [3,7/V S/113]

    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