15IT302J – DATABASE MANAGEMENT SYSTEMS

UNIT – 1
MULTIPLE CHOICE QUESTIONS

1. A _____collection of interrelated data and a set of programs to access those data.

(A) Object oriented programming
(B) Database management systems
(C) Java programming
(D) Python programming
ANSWER: B

2. The _____ system stores permanent records in various files, and it needs
different application programs to extract records from, and add records to, the
appropriate files.
(A) Object oriented programming
(B) Database management
(C) File processing
(D) Python programming
ANSWER: C

3. A major purpose of a database system is to provide users with an _____view of the data.
(A)Abstract
(B)Top down approach
(C) Bottom up approach
(D) Top
ANSWER: A

4. _____ is the lowest level of abstraction describes how the data are actually stored.
(A) top down level
(B) physical level
(C )logical level
(D)view level
ANSWER: B

5. ___ is the next-higher level of abstraction describes what data are stored in the database,
and what relationships exist among those data.
(A) top down level
(B) physical level
(C )logical level
(D)view level
ANSWER: C

6. ___ is the highest level of abstraction describes only part of the entire database.
(A) top down level
(B) physical level
(C )logical level
(D)view level
ANSWER: D
7. The collection of information stored in the database at a particular moment is called an ___
of the database.
(A) instance
(B) encapsulation
(C )operation
(D)abstraction
ANSWER: A

8. The overall design of the database is called the database _____.

(A) instance
(B) encapsulation
(C )Schema
(D)abstraction
ANSWER: C

9. A database may also have several schemas at the view level, sometimes called______ that
describe different views of the database.
(A) physical schema
(B) logical schema
(C )SubSchemas
(D)view schema
ANSWER: C

10. A ____ provides a way to describe the design of a database at the physical, logical, and view
levels.
(A) physical schema
(B) logical schema
(C )SubSchemas
(D)data model
ANSWER: D

11. The _____ model uses a collection of tables to represent both data and the relationships
among those data.
(A) relational
(B) logical
(C )object oriented
(D)entity relationship
ANSWER: A

12.The _______ data model uses a collection of basic objects, called entities,
andrelationships among these objects.
(A) entity-relationship
(B) relational
(C) object oriented
(D) logical
ANSWER: A

13.The _____ is widely used to represent semistructured data.

(A) hypertext markup language
(B)Exiensible markup language
(C) Java language
 (D) python language
ANSWER: B

14. A _____is a language that enables users to access or manipulate data as organized by the
appropriate data model.
(A) data manipulation language
(B)data definition language
(C )extensible markup language
(D)hytertext mark up language
ANSWER: A

15. The portion of a DML that involves information retrieval is called a ____ language.
(A) data manipulation
(B)data definition
(C )extensible markup
(D)query
ANSWER: D

16. An ____ is any condition that the database must always satisfy.
(A) abstraction
(B)instance
(C )encapsulation
(D)assertion
ANSWER: D

17. ______ data manipulation language require a user to specify what data are needed and
how to get those data.
(A)descriptive
(B)declarative
(C )procedural
(D)query
ANSWER: C

18. ______ data manipulation language require a user to specify what data are needed without
specifying how to get those data.
(A)descriptive
(B)declarative
(C )procedural
(D)query
ANSWER: B

19. _____ stores metadata about the structure of the database in particular the schema of
the database.
(A)data files
(B)data dictionary
(C )procedural data
(D)query information
ANSWER: B

20. _____ interprets DDL statements and records the definitions in the data dictionary.
(A)DDL interpreter
 (B)DML compiler
(C )Query optimizer
(D)Query evaluation engine
ANSWER: A

UNIT - 2
MULTIPLE CHOICE QUESTIONS

1. The _____data model was developed to facilitate database

design by allowing specification of an enterprise schema that represents the overall
logical structure of a database.
(A) entity-relationship
(B) relational
(C) object oriented
(D) logical
ANSWER: A

2. An ______ is a set of entities of the same type that share the same properties,
or attributes.
(A) Entity set
(B) Attribute set
(C) Instance set
(D) encapaulation
ANSWER: A

3. The same entity set participates in a relationship set more than once, in different roles. In
this type of relationship set,sometimes called a ________.
(A) Recursive entity set
(B) Recursive attribute set
(C) Recursive Instance set
(D) Recursive relationship set
ANSWER: D

4.______ attributes can be divided into sub parts.

(A) Composite
(B) Simple
(C) Multivalued
(D) Singlevalued
ANSWER: A

5. In _____mapping cardinality, an entity in A is associated with at most one entity in B .

(A) Many to many
(B) One to one
(C) One to many
(D) Many to one
ANSWER: D

6. In ___ mapping cardinality , an entity in A is associated with any number (zero or more)
of entities in B.
(A) Many to many
(B) One to one
(C) One to many
 (D) Many to one
ANSWER: C

7. The participation of an entity set E in a relationship set R is said to be _____ if every

entity in E participates in at least one relationship in R.
(A) partial
(B) total
(C) collective
(D) complete
ANSWER: B

8. If only some entities in E participate in relationships in R, the participation of entity set E in

relationship R is said to be ______.
(A) partial
(B) total
(C) collective
(D) complete
ANSWER: A

9. The _____ key of an entity set allows us to distinguish among the various
entities of the set.
(A) super
(B) foriegn
(C) primary
(D) referential integrity
ANSWER: C

10. _____ indicate total participation of an entity in a relationship set in an ER diagram.

(A) Rectangles
(B) Lines
(C) Dashed lines
(D) Double lines
ANSWER: D

11. ______ represent the attributes of a relationship set in an ER diagram.

(A)Rectangles
(B)Lines
(C) Dashed lines
(D) Undivided rectangles
ANSWER: D

12. A ______ key is a set of one or more attributes that, taken collectively, allow us
to identify uniquely a tuple in the relation.
(A) super
(B) foriegn
(C) primary
(D) referential integrity
ANSWER: A

13. A relation, say r1, may include among its attributes the primary key of another
relation, say r2. This attribute is called a ____ key from r1, referencing r2.
 (A) super
(B) foriegn
(C) primary
(D) candidate
ANSWER: B

14. ______ operation is used to return rows of the input relation that satisfy the predicate. In
relational algebra operations.
(A) selection
(B) projection
(C) union
(D) cartesian product
ANSWER: A

15. ______ operation is used to Output specified attributes from all rows of the input relation.
Remove duplicate tuples from the output in relational algebra operations.
(A) selection
(B) projection
(C) union
(D) cartesian product
ANSWER: B

16. ______ operation is used to Output pairs of rows from the two input relations that have the
same value on all attributes that have the same name in relational algebra operations.
(A) selection
(B) projection
(C) Natural join
(D) cartesian product
ANSWER: C

17. ______ operation is used to Output all pairs of rows from the two input relations (regardless of
whether or not they have the same values on common attributes) in relational algebra
operations.
(A) selection
(B) projection
(C) Natural join
(D) cartesian product
ANSWER: D

18. _____ operation is used to Output the union of tuples fromthe two input relations in relational
algebra operations.
(A) selection
(B) union
(C) Natural join
(D) cartesian product
ANSWER: B

19. The ____ operation allows the combining of two relations by merging pairs of
tuples, one from each relation, into a single tuple.
(A) selection
(B) union
 (C) join
(D) cartesian product
ANSWER: C

20. A ______ constraint requires that the values appearing in specified attributes of any tuple in
the referencing relation also appear in specified attributes of at least one tuple in the
referenced relation.
(A) super
(B) foriegn
(C) primary
(D) referential integrity
ANSWER: D

UNIT 3

1. The keyword used in the select query to eliminate the duplicate tuples is

a. ALL b.DISTINCT c.EXISTS d.NULL.

ANS: DISTINCT

2. Which is the comparison operator

a. BETWEEN b.GREATER THAN c.LESSER THAN d.EQUAL TO.

ANS: BETWEEN

3. Tuples variables are defined in the from clause using

a. AS CLAUSE b.SELECT CLAUSE c.WHERE CLAUSE d.ALL CLAUSE.

ANS: AS CLAUSE

4. Which is the operator used to find out the matching between the string

a. * b. / c. % d. +

ANS: %

5. The set operation union is represented by

a. --- b. / c. % d.U

ANS: U

6. The intersection operator is used to get the _____ tuples.

a. Different b. Common c.All d. Repeating
ANS: common

7. The aggregate function whch is usedto find the number of tuples in a table.
 a. COUNT b.MIN c. MAX d.AVG

ANS: COUNT
8. The number of attributes in relation is called as its
a.Cardinality b. Degree c.Tuples d.Entity
ANS: Degree

9. Which of the following is not an aggregate function?

a. Avg b. Sum c.With d.Min
ANS: With

10. The clause used to set condition in group by is

a. WHERE b.HAVING c.FROMd.SELECT

ANS: HAVING

11. What can be used in the predicate to checkfor null values

a. NULL b.ISNULL c.ISEMPTY d.EMPTY

ANS: ISNULL
12. . A _____ indicates an absent value that may exist but be unknown or that may not exist at
all.
a. Empty tuple b. New value c. Null value d. Old value
Ans. Null value
13. Views are otherwise called as

a. VIRTUAL TABLE b.RELATION c.TABLE d.FALSE TABLE

ANS: VIRTUAL TABLE

14. The____condition allows a general predicate over the relations being joined.
a. On b. Usingc. Set d. Where
Ans On

15. Which of the join operations do not preserve non matched tuples?
a. Left outer join b. Right outer join c. Inner join d. Natural join
Ans. Inner join

16. _____________ express the number of entities to which another entity can be associated
via a relationship set.

a.Mapping Cardinality b. Relational Cardinality c.Participation Constraints

d.Relational constraints
ANS:Mapping Cardinality

17. Which one of the following uniquely identifies the elements in the relation?
a.Secondary Key b. Primary key c.Foreign key d. Composite key
 ANS: Primary key

18. ____________ is preferred method for enforcing data integrity

a. Constraints b. Stored Procedure c.Triggers d. Cursors

Ans:Constraints

19. How can you find rows that do not match some specified condition?

a. EXISTS b. Double use of NOT EXISTS c. NOT EXISTS d.NULL

20. To display the salary from greater to smaller and name in ascending order which of the
following options should be used?
a.Ascending, Descending b. Asc, Desc c. Desc, Asc d. Descending, Ascending

UNIT – 4
1. If a is a set of attributes and b ⊆ a then a→b holds
a. Reflexivity rule. B. Augmentation c. Transitivity rule. D. multivalue rule
ANS: Reflexivity rule.
2.___________ attribute remove it without changing the closure of the set of functional
dependencies
a. Closure of Attribute b. extraneous attributes c. composite attribute d. functional
dependency
ANS: extraneous attributes
3. A functional dependency is a relationship between or among:
A) Tables B) Relations C) Rows D) Attributes
ANS: Attributes

4. The 2NF describes the tabular format in which:

A: there are no repeating groups in the table
B: all attributes are dependent on the primary key
C: A & B with no partial dependency
D: there is no partial dependency
ANS: there is no partial dependency

5. The process of converting complex object data structures into well-structured relations is called:
a. object-relational modeling. b. normalization.
c. referential integrity. d. determinant analysis.
ANS: normalization.
6. If one attribute is a determinant of a second, which in turn is a determinant of a third, then the
relation cannot be:
a. well-structured. b. in 1NF. c. in 2NF. d. in 3NF.
ANS: in 3NF
7. The essential characteristic of____________ normal form is that every determinant in the table
must be a candidate key.
a. Boyce Codd b. Domain Key c. Fourth d. Fifth
ANS: Boyce Codd
8. A table that is in 2NF and contains no transitive dependencies is said to be in
(check only one)
a. 1NF. b. 2NF. c. 3NF. d. 4NF.
ANS: 3NF

9. Consider the relation scheme R = (E, F, G, H, I, J, K, L, M, N) and the set of functional

dependencies {{E,F}® {G},{F}® {I, J},{E,H}®{K,L}®(M) , {K}®{M}, }
{L}®{N} on R. What is the key for R?
(A) {E, F} (B) {E, F, H} (C) {E, F, H, K, L} (D) {E}
ANS: {E, F, H}
10. Which ofthefollowingis NOT a superkeyinarelationalschemawithattributes V,W, X, Y, Z and
primarykey V Y?
(A) VXYZ (B) VWXZ (C) VWXY (D) VWXYZ
ANS: VWXZ

11. Which of the following is TRUE?

(A) Every relation is 3NF is also in BCNF
(B) A relation R is in 3NF if every non-prime attribute of R is fully functionally
dependent on every key of R
(C) Every relation in BCNF is also in 3NF
(D) No relation can be in both BCNF and 3NF
ANS: Every relation in BCNF is also in 3NF

12,. Which functional dependency types is/are not present in the following dependencies?
Empno -> EName, Salary, Deptno, DName
DeptNo -> DName
EmpNo -> DName

A. Full functional dependency

B. Partial functional dependency
C. Transitive functional dependency
D. Both B and C

ANS: Partial functional dependency

13. If one attribute is determinant of second, which in turn is determinant of third, then the relation
cannot be:

A. Well-structured
B. 1NF
 C. 2NF
D. 3NF
ANS: 3NF

14. Consider the schema R(S,T,U,V) and the dependencies S→T, T→U, U→V, V→S. Let R=
{R1,R2} such that R1∩R2=Φ. Then the decomposition is :

A. not in 2NF
B. in 2NF but not in 3NF
C. in 3NF but not in 2NF
D. in both 2NF and 3NF
ANS: in 2NF but not in 3NF

15.  A table has fields F1, F2, F3, F4, and F5, with the following functional dependencies:
F1->F3
F2->F4
(F1,F2)->F5
in terms of normalization, this table is in
(a) 1NF             (b) 2NF           (c) 3NF           (d) None of these
ANS: 1NF    

16. The relation schema Student_Performance (name, courseNo, rollNo, grade) has the following
FDs:
name,courseNo->grade
rollNo,courseNo->grade
name->rollNo
rollNo->name
The highest normal form of this relation scheme is
(a) 2NF              (b) 3NF              (c) BCNF               (d)4NF
ANS: 3NF

17. Let R(A,B,C,D,E,P,G) be a relational schema in which the following FDs are known to hold: 
AB->CD
DE->P
C->E
P->C
B->G
The relation schema R is
(a) in BCNF                                       (b) in 3NF, but not in BCNF
(c) in 2NF, but not in 3NF                   (d) not in 2NF

ANS: not in 2NF

18.  Which normal form is considered adequate for normal relational database design?
(a) 2NF           (b) 5NF          (c) 4NF         (d) 3NF
ANS: 3NF

19. Consider a schema R(A, B, C, D) and functional dependencies A -> B and C -> D. Then the
decomposition of R into R1 (A, B) and R2(C, D) is 
(a) dependency preserving and lossless join
(b) lossless join but not dependency preserving
(c) dependency preserving but not lossless join
(d) not dependency preserving and not lossless join
ANS: dependency preserving but not lossless join

20. Relation R with an associated set of functional dependencies, F, is decomposed into BCNF. The
redundancy (arising out of functional dependencies) in the resulting set of relations is  
(a) Zero 
(b) More than zero but less than that of an equivalent 3NF decomposition 
(c) Proportional to the size of F+
(d) Indeterminate

ANS: More than zero but less than that of an equivalent 3NF decomposition 

UNIT 5
1. The property of a transaction that persists all the crashes is
a. Atomicity b. Durability c. Isolation d.
concurrency
Ans. Durability

2. __________ states that only valid data will be written to the database.
a. Consistency b. Atomicity c. Durability d. Isolation
Ans: Consistency

3. The transaction said to be successfully executed when __________statement is

executed
a. Roll back b.commit c.Set transaction d.begin transaction
Ans: .commit

4. ____ means that the data used during the execution of a transaction cannot be used by
a second transaction until the first one is completed.
a. Consistency b. Atomicity c.Durability d. Isolation
Ans: isolation
5. In order to maintain transactional integrity and database consistency, what technology
does a DBMS deploy?
a. Triggers b. Pointers c.Locks d. Cursors
Ans: Locks

6. Which of the following are introduced to reduce the overheads caused by the log-based
recovery?
a.Checkpoints b. Indices c.Deadlocks d. Locks
Ans: checkpoints
7. Which refers to a property of computer to run several operation simultaneously and
possible as computers await response of each other
a. Concurrency b. Deadlock c. Backup d. Recovery
Ans: Concurrency

8.Which of the following is the oldest database model?

a.Relational b.Hierarchical c.Physical d.Network
Ans:Network

9. The process of saving information onto secondary storage devices is referred to as

a.Backingup b.Restoring c.Writing d. Reading
Ans:Writing

10. Which of the following belongs to transaction failure

a. Read error b. Boot error c. Logical error d. system crash
ANS: Logical error

11. The database is partitioned into fixed-length storage units called

a. Parts b. Blocks c. Reads d. Build
ANS: Blocks

12. 1. The log is a sequence of _________ recording all the update activities in the database.
a. Log records b. Records c. Entries d. Redo
ANS:Log records

13. The ____________ scheme uses a page table containing pointers to all pages; the page
table itself and all updated pages are copied to a new location.
a. Shadow copy b. Shadow Paging c. log records d. Log paging
ANS:shadow Paging.

14. Which RAID type doesn’t use parity for data protection?
a. RAID 1 b. RAID 4 c. RAID 6 d. RAID 5
ANS:RAID 1

15. What is the unique characteristic of RAID 6 (Choose one)?

a. Distributed Parity b. Striping c. Two independent distributed parity d. Mirroring
ANS:Two independent distributed parity

16. RAID level 0 refers to?

a. Disk arrays with striping at the level of blocks b. Disk mirroring with block striping
c. Memory style error correcting code d. Block interleaved distributed parity
ANS:Disk arrays with striping at the level of blocks.

17. RAID level 2 refers to?

a. Disk arrays with striping at the level of blocks b. Disk mirroring with block striping
c. Memory style error correcting code d. Block interleaved distributed parity
ANS:Memory style error correcting code

18. Data striping by splitting bits across multiple disks is called as _______
a. RAID striping b. Array stripingc. Bit level striping d. Block level striping
ANS: Bit level striping

19. Computer system of a parallel computer is capable of

a. Decentralized computing b. Parallel computing c. Centralized computing d.
Distributed computing
ANS:Parallel computing

20. A paradigm of multiple autonomous computer having the private memory

communicating through computer network is called
a. centralized computing b.cloud computing c.parallel computing d. distributed
computing
ANS: distributed computing.