Scribd Logo
Upload

Welcome to Scribd!

  • 25 views

    Sem DBMS 2022

    Uploaded by

    mdafsarurdu90
    The document contains 10 questions related to database management systems. The questions cover topics such as relational algebra, functional dependencies, normalization, ACID properties, SQL, locking protocols, transaction management, ERD modeling and database design concepts. Students are asked to answer any 8 questions out of the 10 questions provided.

    Copyright:

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

    Sem DBMS 2022

    Uploaded by

    mdafsarurdu90
    25 views2 pages
    The document contains 10 questions related to database management systems. The questions cover topics such as relational algebra, functional dependencies, normalization, ACID properties, SQL, locking protocols, transaction management, ERD modeling and database design concepts. Students are asked to answer any 8 questions out of the 10 questions provided.

    Original Title

    Sem_DBMS_2022

    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 contains 10 questions related to database management systems. The questions cover topics such as relational algebra, functional dependencies, normalization, ACID properties, SQL, locking protocols, transaction management, ERD modeling and database design concepts. Students are asked to answer any 8 questions out of the 10 questions provided.

    Copyright:

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

    Sem DBMS 2022

    Uploaded by

    mdafsarurdu90
    The document contains 10 questions related to database management systems. The questions cover topics such as relational algebra, functional dependencies, normalization, ACID properties, SQL, locking protocols, transaction management, ERD modeling and database design concepts. Students are asked to answer any 8 questions out of the 10 questions provided.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    You are on page 1of 2

    Aliah University

    Database Management System [CSEUGPC11]


    Full Marks 80 Time 3 Hrs.

    Each Question carries 10 Marks

    Answer any eight

    1. Let emp {empid, Name, sal, deptid} and dept {did, dname, dloc} are two relations. Answer the
    following query in RA.
    i) Find the name of employee who earn more than the avg sal of her dept.
    ii) Find the name of the employee who earn the highest sal in ‘IT’ dept.
    iii) What is the total cost for salary of ‘CSE’ dept.
    iv) Which dept has highest employee strength?
    v) What is the avg sal of the employees working at ‘3rd floor’.

    2. Write an algorithm to find out candidate key(s) from the functional dependency set.
    Find the primary key of the table R(A,B,C,D,E,F,G,H), considering
    F= { A-->CD, AB-->EG, C-->G, D-->EF, AC-->D, G-->FH }.

    3. Define 2NF, 3NF, and BCNF with exmple. State and prove the Amstrong’s axioms V and VI.
    4. Describe ACID properties of transaction? What is Cascading Rollback? How it can be avoided?

    5. Consider the following Tables: Student {Roll, Name, Address}, Course {Course_id,
    Course_name, credit}, Student_Course { Roll , Course_id } and write the following in SQL
    statements
    i) Write SQL to create the above tables, assuming the appropriate data types
    ii) Find the student name who has taken ‘DBMS’ but not ‘Networking’
    iii) Find the total credit of the courses taken by ‘Ramiz’
    iv) Which course has been taken by the maximum students
    v) Print name and address of the students of who has have taken at least 2 courses

    6. What is serialization in schedule? Explain different types of serialization with example.

    7. Define an algorithm for checking loss-less decomposition. Test the following case:
    Given a relational schema R = { EMPID, NAME, , PROJ_NAME, PROJ_LOC, HOURS } is
    decomposed into the following tables
    R1 = {EMPID, NAME }
    R2 = { PROJ_NAME, PROJ_LOC} PROJ_ID
    R3 = { EMPID, PROJ_ID, HOURS }
    The functional dependencies are:
    FD = { EMPID → NAME, PROJ_ID → { PROJ_NAME, PROJ_LOC }, { EMPID, PROJ_ID }
    → HOURS }

    8. Describe time stamp based locking protocol. What are the methods used for deadlock prevention?
    Create an ERD for the following case study showing entity names, primary keys, attributes
    for each entity, relationships between the entities and cardinality.

    A manufacturing company produces products. The following product information is


    stored: product name, product ID and quantity on hand. These products are made up of
    many components. Each component can be supplied by one or more suppliers. The
    following component information is kept: component ID, name, description, suppliers
    who supply them, and products in which they are used.
     A supplier can exist without providing components.
     A component does not have to be associated with a supplier.
     A component does not have to be associated with a product. Not all components are used in
    products.
     A product cannot exist without components.

    9. What is Precedence Graph? Explain Two-phase Locking protocol. Describe the lifecycle of a
    transaction.

    10. Write Short Notes on any two:


    i) Data Independence
    ii) Role of Database Administrator (DBA)
    iii) Different types of Keys in database design

    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