Scribd
Upload
68 views

National Institute of Technology Rourkela

The document is a midterm exam for a Database Management Systems course. It contains 4 questions assessing different concepts: 1) Prove a pseudotransitive rule using Armstrong's axioms, define composite and multi-valued attributes with examples, and define data abstraction levels and how they are mapped. 2) Draw an ER diagram and analyze cardinality, dependencies, and normalization for an organization with employees and supervisors. 3) Analyze closure, super keys, candidate keys, and redundancy for relations with functional dependencies. 4) Retrieve information from a student-course-teacher database using relational algebra operations.

Uploaded by

Thanoj Kumar
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
68 views

National Institute of Technology Rourkela

The document is a midterm exam for a Database Management Systems course. It contains 4 questions assessing different concepts: 1) Prove a pseudotransitive rule using Armstrong's axioms, define composite and multi-valued attributes with examples, and define data abstraction levels and how they are mapped. 2) Draw an ER diagram and analyze cardinality, dependencies, and normalization for an organization with employees and supervisors. 3) Analyze closure, super keys, candidate keys, and redundancy for relations with functional dependencies. 4) Retrieve information from a student-course-teacher database using relational algebra operations.

Uploaded by

Thanoj Kumar
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

NATIONAL INSTITUTE OF TECHNOLOGY ROURKELA

 Database Management Systems CS222  Mid Sem Autumn 2017  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) State and prove pseudotransitive rule using Armstrong’s axioms.


(b) Define composite and multi valued attribute with a practical example.
(c) Define the levels of data abstraction in DBMS. Discuss how they are mapped.
(d) What is meant by degree of a relationship? [(1 + 2) + (1 + 1) + (1 + 1) + 1]

2. In an organization, employees are supervised by some employees only. The details recorded for an employee are:
employee ID (EMPID) which is unique for each employee, name (EMPNAME), salary (EMPSAL). One employee can be
supervised by only one employee. However one employee may supervise more than one employees. It is not
mandatory that every employee will have a supervisor. Also, there can be employees, who does not supervise any
other employee.
(a) Draw an ER diagram for this.
(b) What is cardinality and existence dependency constraint on the participating entities for this type of relation?
(c) Convert this ER diagram to relational model with minimum number of relations.
(d) State in which normal form the relations are (also state why)?
(e) What is weak entity and identifying relationship? Describe with an example. [1 + (1 + 1) + 1.5 + 1 + 1.5]

3. (a) For a given relation R(A,B,C,D,E,F,G,H,I,J,K), and a set of FDs on it FD: AB → C, BD → EF, AD → GH, A →
I, H → AJ,
(i) Find closure of every singular attribute,
(ii) Find the super keys and candidate keys.
(b) Consider Relation Schema T(MNOPQRS) with a set of FDs F = {SM → P, PO → Q, SR → M, OM → SN, MR → P,
MO → Q, R → S}.
(i) Find all redundant FDs through Membership Algorithm.
(ii) Verify the goodness of the Membership algorithm by applying Armstrong’s axioms. [(2 + 1) + (2.5 + 1.5)]

4. Consider a relational database with entities STUDENTS (SID, STUNAME, STUDOB), SUBJECTS (CID, SUBNAME, CREDIT),
TEACHERS (TID, TNAME, TDOB), and a relation derived from relationship TEACHES (SID, CID, TID, MARKS) with three
foreign keys SID, CID, TID. How to retrieve the following information from this database using relational algebra?
(a) Which students are studying subject named ‘PRP’ but not a subject named ‘DER’ ?
(b) Which students are studying both subjects named ‘PRP’ and named ’DER’ ?
(c) Which students are studying either the subject named ‘PRP’ or a subject named ‘DER’ ?
(d) Which students are studying subject named ‘PRP’ but not a subject named ‘DER’ ?
(e) Who are the students not taught any subject by a teacher named ‘XYZ’
(f) Which are the subjects not being learnt by any student?
(g) Which teacher is teaching maximum number of subjects?
(h) Which are the students who are being taught by all teachers?
(i) Find total marks for a student named ‘TDW’ ?
(j) Which courses are registered by a student named ‘ABC’ but not by any other student?
(k) What is the total credit of all subjects being taught by all teachers except two teachers named ‘XYZ’ and
‘PQR’.
(l) Which pairs of teachers teach exact same number of subjects? [(0.5 × 4) + (0.75 × 8)]

 BEST OF LUCK 

You might also like