Scribd Logo
Upload

Welcome to Scribd!

  • 9 views

    De 2023

    Uploaded by

    harshsharmaisgreat
    The document contains a multi-part question about database concepts. It includes questions about deleting tuples to preserve referential integrity, binary recursive relationships, drawbacks of file processing systems, mapping relationships between entities using ER diagrams, defining relational algebra operators, checking for redundant functional dependencies, soundness and completeness of Armstrong's axioms, proving non-commutativity of operations, properties of theta joins, mapping ternary relationships to relations, and conditions for relational completeness.

    Copyright:

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

    De 2023

    Uploaded by

    harshsharmaisgreat
    9 views1 page
    The document contains a multi-part question about database concepts. It includes questions about deleting tuples to preserve referential integrity, binary recursive relationships, drawbacks of file processing systems, mapping relationships between entities using ER diagrams, defining relational algebra operators, checking for redundant functional dependencies, soundness and completeness of Armstrong's axioms, proving non-commutativity of operations, properties of theta joins, mapping ternary relationships to relations, and conditions for relational completeness.

    Original Title

    de2023

    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 a multi-part question about database concepts. It includes questions about deleting tuples to preserve referential integrity, binary recursive relationships, drawbacks of file processing systems, mapping relationships between entities using ER diagrams, defining relational algebra operators, checking for redundant functional dependencies, soundness and completeness of Armstrong's axioms, proving non-commutativity of operations, properties of theta joins, mapping ternary relationships to relations, and conditions for relational completeness.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    9 views1 page

    De 2023

    Uploaded by

    harshsharmaisgreat
    The document contains a multi-part question about database concepts. It includes questions about deleting tuples to preserve referential integrity, binary recursive relationships, drawbacks of file processing systems, mapping relationships between entities using ER diagrams, defining relational algebra operators, checking for redundant functional dependencies, soundness and completeness of Armstrong's axioms, proving non-commutativity of operations, properties of theta joins, mapping ternary relationships to relations, and conditions for relational completeness.

    Copyright:

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

    NATIONAL INSTITUTE OF TECHNOLOGY ROURKELA

     Database Engineering CS2008  Mid Sem Spring 2022-23  UG  Pg 1  FM 30  2 Hrs

     Answer ALL questions.  All parts of a question MUST be answered together.  Mere answers without proper
    explanation will not fetch marks.  Variation in quality of answer will vary the secured marks.

    1. a. The table given beside has three attributes A, B and C where A is the primary key and B and A B C
    C are a foreign keys referencing A with on-delete cascade. Which tuples must be additionally 2 2 4
    deleted to preserve referential integrity when the tuple (3, 7, 4) is deleted? 3 7 4
    b. Give an example of binary recursive relationship where a single entity participates with two 4 6 3
    roles. 5 2 3
    c. Discuss drawbacks of conventional file processing systems. 7 3 2
    d. An organization has following rules: (i) Each employee works for exactly a particular 9 4 5
    department, (ii) Many employees can work in a single department, (iii) There can be 6 1 1
    departments where no employees work. Show the structural constraints between entities
    EMPLOYEE and DEPARTMENT through ER diagram using Min-Max representation. Decide whether
    EMPLOYEE is a existence dependent.
    e. Define devision operator with basic operators defined on relational database model.
    [2 × 5]

    2. a. Check if BD → E, AC → E individually are the redundant FDs in F = {A → B, C → D, BD → E, AC → E}


    b. What do you mean by soundness and completeness of Armstrong’s axioms?
    c. Give one example to prove that selection (σ) and Projection (π) are not commutative.
    d. What is the property of theta in theta-join?
    e. If a ternary relationship connecting three entities (with (0,N ) participation from two entities and (0,1)
    participation from one entity) is converted to a relation in relationship schema, minimum how many relations
    will be required to represent the entities and the relationship, and why? How many foreign keys will be required
    in total, and why? [3 + 1 + 2 + 1 + 3]

    3. a. When a language is called relationally complete?


    b. Find the content of tables G,H,I,J,K,L,M,N from the following tables R and S:
    G ← R ./A=D S H ← R nA=D S I ← R oA=D S J ← R /A=D S
    [2 + 1 × 8]
    K ← R .A=D S L ← R ./A=D S M ← R ./ A=D S N ← R ./ A=D S
    R(A, B, C) S(D, E, F)
    A B C D E F
    a1 b1 c1 a1 e1 f1
    a1 b2 c1 a1 e2 f3
    a2 b1 c1 a2 e2 f2
    a3 b2 c2 a2 e4 f4
    a4 b3 c3 a5 e2 f3

     BEST OF LUCK 

    You might also like