DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

DBMS (PCC-CS601)
Question Bank for CA3 Exam
Group-A [ True/False, Fill in the Bank, MCQ]
1.​ Mark each of the following statements as true or false.
(a)​ A derived attribute is an attribute whose values are computed from other attribute T
(b)​ Composite attributes cannot be divided into smaller subparts F
(c)​ Complex attribute is formed by nesting composite attributes and multivalued attributes in an
arbitrary way T
(d)​ Physical data independence and logical data independence are the same? F
(e)​ Outer-join is an extension of the join operation to deal with missing information. T
(f)​ It is always possible to obtain a third normal form design without sacrificing a lossless join or
dependency preservation. T
(g)​ Foreign key values can be NULL. T
(h)​ A table cannot be joined to itself. F
(i)​ In SQL relation, duplicate may present T

(j)​ If X → Y, then XZ → YZ. This rule is known as union rule. F

(k)​ A weak entity set has a primary key F

(l)​ It is not possible for several attributes to have the same domain F
(m)​ SQL is a non-procedural language T
(n)​ DISTINCT and UNIQUE do the same job in SQL. T
(o)​ An attribute, which has multiple components, each with an independent existence, is called a
composite attribute. T
(p)​ The ALTER TABLE command enables us to delete columns from a table. T
(q)​ A table can have only more than one candidate key. T
(r)​ The data catalog is required to get information about the structure of the database. T
(s)​ Data and metadata are the same F
(t)​ When the Division (or Quotient) operator in relational algebra divides a relation R of degree (m+n) by a
relation S of degree n, it produces a result relation of degree n. F

2.​ Fill in the blanks with one or more words:

Entity-Relationship (ER)
(a)​The logical structure of a relational database can be represented by a _____________ diagram.

(b)​ A relation is a subset of the _________________

Cartesian product of a set of domains
(c)​Graph structure is used to organized data in _____________
network data model
(d)​ SQL allows _____________values
NULL to indicate absence of information about the value of an attribute.
(e)​ If a where clause and a having clause appear in the same query, the predicate in the ____________clause
WHERE

is applied first.

(f)​ (R-S) union (S-R) is a ___________ operation symmetric difference

(g)​The cardinality
concept of relationship between an entity set and a relationship set is known as ______________________
(h)​Referential Integrity Constraints enforces match of primary key to _____________.
foreign key

(i)​ _____________
External Schema defines the view(s) of the database for a particular user(s).

(j)​ In the relational models, cardinality is termed as _________________________.

the number of tuples (rows) in a relation.

(k)​Double oval is used to represent _________________

multivalued attributes in ER Diagram

(l)​ The minimal set of super keys is known as ____________________.

candidate keys.

(m)​ Data in the database at a particular moment in time is called _________________.

database instance
(rho)
(n)​ _________
(rho)
(rho) is the rename operator in relation algebra.
(o)​Natural join of two relations is possible only when the relations have at least one __________________
common attribute.

(p)​ Join operationIs equivalent to a Cartesian product followed by a Selection T

3.​ Each question below has multiple choices of answers. Choose the most appropriate one.

(a)​ In the context of an E-R diagram which one of the following statements is correct?
(i)​ Ellipses are used to represent entity sets. (ii) Ellipses are used to represent relationship sets
(ii)​ Dashed Ellipses are used to represent derived attributes (iv) Diamonds are used to represent
attributes
(b)​ Which of the following operations is used if we are interested in only certain columns of a table ?
(i)​ PROJECTION (ii) SELECTION (iii) UNION (iv) JOIN
(c.) Transitive dependency is removed in
(i) 1 NF (ii) 2 NF (iii) 3 NF (iv) 4 NF
(d) Relational Algebra is
(i) procedural (ii) non-procedural (iii) object oriented (iv) none of these

(e)If X is {E, G, H, M} and Y is {G, M} then X→Y is

(A)​ Composition Rule ​ ​ (B) Augmentation Rule ​
(C) Transitive Rule​​ (D) Reflexivity Rule
(f) Which are the fundamental operations in relational algebra ?
(i) Natural join (ii) Division (iii) Set intersection (iv) Cartesian product
(g) Which of the following is not a super key in a relation with attributes V, W, X, Y, Z and primary key
(V Y)?
(i)​ V X Y Z (ii) V W X Z (iii) V W X Y (iv) V W X Y Z
 (h) A prime attribute of a relation schema R is an attribute that appears
(i) in all candidate keys of R (ii) in some candidate key of R
(iii) in a foreign key of R (iv) only in the primary of R

Group-B [ Short type Questions]

4.​ (a)Explain the difference between physical and logical data independence.
(b) Write the role of a DBA 3+2 = 5

5.Explain the E-R Model with a suitable example. 5

6. Explain with suitable example from relational algebra. 5

​ (i) Union (ii) Join

7. Briefly discuss the different schema architecture in DBMS with diagram 5

8. Describe the concept of specialization and generalization in the context of an E-R data model. 5
9.Explain with example the difference between strong and weak entity sets ? What is the partial key? 2+3=5
10.Construct an E-R diagram for the following problem:
A store has different counters managed by different employees. A counter has different items, but no
two counters have common items. Customers buy from different counters but bills are prepared at the Bill
counter only. Once in a month performance of managing counters is evaluated in items of sales. Items are
also reviewed and slow-moving items are identified.​ 5
11.Discuss the main advantages of database management systems over file management system 5
12.Explain with example super key, candidate key, and primary key. 5
13.What is the Cardinality Ratio?What are the different types of mapping constraint and explain it with
examples 5
13.Discuss the entity integrity and referential integrity constraints. 5
14.Discuss different anomalies with examples 5
15. Let R = (A, B, C, D, E) and F = {A→BC, CD→E, B→D, E→A}. ​ ​ 2+2+1
+
i)​Find (AB)
ii)Is AB a candidate key of R?
​ iii)Is there any other candidate key?

16.Relation R with eight attributes R(A, B, C, D, E, F, G, H) contains only atomic values and the FDs of
R is as below
F = { CH → G, A → BC , B → CFH , E → A , F → EG }
Find all candidate keys of the relation R. 5
17.Consider the following relation schema: 2+2+1
Student (ssn, name, address, major)
Course (code, title)
Registered (ssn, code)
(a)​ Write Relational Algebra expression SSNs of students who are registered for both ‘Database
Systems’ and ‘Analysis of Algorithms’.
(b)​Write SQL to display SSNs of students who are registered for both ‘Database Systems’ and ‘Analysis
of Algorithms’.
(c)​ Write Relational Algebra expression to rename Course relation into Subject.

18.Let R= (A, B, C, D, E, I) and F={AB →E, BE →I, E →C,CI →D}. Show F|= AB →CD 5

19. Given a relation schemaR(A, B, C, D) and fd set F= {AB→C,ABD→C, ABC→D,AC→D} Is the relation
R is in 2NF? ​ 5

20.Identify the highest normal form given a relation schema R(A, B, C, D, E) and set of fd set F= {A→B,
B→C, C→D, D→A } 5