Introduction to database systems: Approaches to building a database, Three-tier

architecture of a database, Challenges in building a DBMS, DBMS Architecture, Various

components of a DBMS, Types of Data models.

Sr. Question Options Answer

No.
1. Which of the following is a. DML(Data Manipulation d. DDL(Data
generally used for performing
tasks like creating the structure Language) Definition
of the relations, deleting b. b. Query Language)
relation? c. Relational Schema
d. DDL(Data Definition
Language)

2. Which of the following a. DML(Data Manipulation a. DML(Data

provides the ability to query
information from the database Language) Manipulation
and insert tuples into, delete b. DDL(Data Definition Language)
tuples from, and modify tuples
in the database? Language)
c. Query
d. Relational Schema

3. What is DBMS? a. DBMS is a d.DBMS stores,

collection of queries modifies and
b. DBMS is a high- retrieves data
level language
c. DBMS is a
programming
language
d. DBMS stores,
modifies and
retrieves data
4. A collection of tables to a. Entity b. relational model
represent both data and the relationship
relationships among data, is model
known as b. Relationship
c. Object based
data model
 d. Semi structured
model
5. The preface that converts the a. DML pre- d. DML precompiler
DML statements to normal executer
procedure calls in the host b. DML
language is known as executer
c. DML
compiler
d. DML
precompiler
6. The storage manager a. Buffer manager a. Buffer
component who decides what b. File manager manager
data to cache in main memory c. Transaction manager
is referred as d. Authorization and
integrity manager
7. Who created the first DBMS? a. Edgar Frank Codd b. Charles
b. Charles Bachman Bachman
c. Charles Babbage
d. Sharon B. Codd
8. In which of the following a. Image c. Table
formats data is stored in the b. Text
database management system? c. Table
d. Graph
9. Which of the following can be c. data
used to extract or filter the data a. Data redundancy mining
& information from the data b. Data recovery tool
warehouse? c. Data mining
d. Both B and C

10. Which one of the following

refers to the copies of the same a. Data Repository d. Data Redundancy
data (or information) occupying b. Data Inconsistency
the memory space at multiple
places. c. Data Mining
d. Data Redundancy

11. Which of the following refers

to the level of data abstraction a. Conceptual Level b. Physical
that describes exactly how the b. Physical Level Level
data actually stored?
c. File Level
 d. Logical Level

12. To which of the following the

term "DBA" referred? a. Data Bank b. Database
Administrator Administrator
b. Database
Administrator
c. Data Administrator
d. None of the above

13. In general, a file is basically a

collection of all related______. a. Rows & Columns d. Records
b. Fields
c. Database
d. Records

14. The term "Data" refers to:

a. The electronic c. Row Facts and
representation of the figures
information( or data)
b. Basic information
c. Row Facts and
figures
d. Both A and C

15. Rows of a relation are known as

the _______. a. Degree d. All of the above
b. Tuples
c. Entity
d. All of the above
16. Which of the following refers
to the number of tuples in a a. Entity c. Cardinality
relation? b. Column
c. Cardinality
d. None of the above

17. Which one of the following is a

type of Data Manipulation a. Create c. delete
Command? b. Alter
c. Delete
d. All of the above

18. Which of the following

command is a type of Data a. Create a. Create
Definition language command? b. Update
c. Delete
d. Merge

19. Which of the following is a top-

down approach in which the a. Aggregation c. Specialization
entity's higher level can be b. Generalization
divided into two lower sub-
entities? c. Specialization
d. All of the above

20. The term "TCL" stands

for_____. a. Ternary Control d. Transaction
Language Control Language
b. Transmission
Control Language
c. Transaction Central
Language
 d. Transaction Control
Language

21. Which of the following is used

in the application programs to a. Data Manipulation a. Data
request data from the database language Manipulation
management system? language
b. Data Definition
Language
c. Data Control
Language
d. All of the above

22. The term "SQL" stands for

a. Standard query c. Structured query
language language
b. Sequential query
language
c. Structured query
language
d. Server-side query
language

23. The term "Data independence"

refers to____ a. Data is defined d. Both B & C
separately and not included
in the programs
b. Programs are not
dependent on the
logical attributes of
the data
c. Programs are not
dependent on the
 physical attributes of
the data
d. Both B & C

24. Which one of the following

refers to the total view of the a. Conceptual view a. Conceptual
database content? b. Physical view view

c. Internal view
d. External view

25. The architecture of a database

can be viewed as the ________ a. One level c. Three-level
b. Two-level
c. Three-level
d. Four level

26. Which of the following levels is

considered as the level closed a. Internal Level b. External
to the end-users? b. External Level Level

c. Conceptual Level
d. Physical Level

27. Which one of the following is

commonly used to define the a. Application program c. schema
overall design of the database? b. Data definition
language
c. Schema
d. Source code

28. DDL stands for what a. Database Definition a. Database

Level Definition
Level
 b. Data Definition
Language
c. Data Device Latency
d. None of the above

29. An advantage of the database a. Data is dependent on c. Data is integrated

management approach is programs and can be accessed
b. Data by multiple programs
redundancy increases
c. Data is integrated and
can be accessed by
multiple programs
d. None of the above

30. Which two files are used during a. Query languages and c. Data
operation of the DBMS utilities dictionary and
b. DML and query transaction log
language
c. Data dictionary and
transaction log
d. None of the above
 Relational Data Model: Concept of relations, Schema-instance distinction, Keys, referential
integrity and foreign keys, Relational algebra operators, Tuple relation calculus, Domain
relational calculus. Physical and logical hierarchy: Concept of index, B-trees, hash index,
function index, bitmap index. Concepts of Functional dependency, Normalization (1NF, 2NF,
3NF, BCNF, etc).

Sr. Question Options Answer

No.
1. a. Subset of a b. Subset of a
A Relation is a Cartesian product Cartesian product
of a list of of a list of
attributes domains
b. Subset of a
Cartesian product
of a list of domains
c. Subset of a
Cartesian product
of a list of tuple
d. Subset of a
Cartesian product
of a list of relations
2. In mathematical term Table a. Relation a. relation
is referred as b. Attribute
c. Table
d. domain
3. In mathematical term Row is a. Relation c. tuple
referred as b. Attribute
c. Tuple
d. domain
4. _______ allow us to identify a. Superkey a. Superkey
uniquely a tuple in the b. Domain
relation. c. Attribute
d. Schema
5. Minimal Superkeys are a. Schema keys b. Candidate keys
called b. Candidate keys
c. Domain keys
d. Attribute keys
6. Who proposed the relational a. Bill Gates b. E.F. Codd
model? b. E.F. Codd
c. Herman Hollerith
d. Charles Babbage
7. Which of the following in a. Every primary-key c. Every foreign-key
true regarding Referential value must match a value must match
Integrity? primary-key value a primary-key
 in an associated value in an
table associated table
b. Every primary-key
value must match a
foreign-key value
in an associated
table
c. Every foreign-key
value must match a
primary-key value
in an associated
table
d. Every foreign-key
value must match a
foreign-key value
in an associated
table
8. How many types of keys in a. Candidate key d. All of these
Database Design? b. Primary key
c. Foreign key
d. All of these
9. Domain constraints, a. Foreign key c. Assertion
functional dependency and b. Primary key
referential integrity are c. Assertion
special forms of _________. d. Referential
constraint
10. Which one of the following a. Secondary Key b. Primary key
uniquely identifies the b. Primary key
elements in the relation? c. Composite key
d. Foreign key
11. A _____ is a property of the a. Rows b. rows
entire relation, rather than of b. Key
the individual tuples in which c. Attribute
each tuple is unique. d. Fields
12. Which one of the following a. Name c. Id
attribute can be taken as a b. Street
primary key ? c. Id
d. Department
13. A relation is considered a: a. Column c. two-dimensional table
b. one-dimensional
table
c. two-dimensional
table
d. three-dimensional
table
14. A key: a. must always be c. identifies a row.
composed of two
or more columns.
b. can only be one
column.
c. identifies a row.
d. identifies a
column.
15. In the relational models, a. Number of tuples a. Number of tuples
cardinality is termed as: b. Number of
attributes
c. Number of table
d. Number of
constraints
16. Key to represent relationship a. Primary key c. Foreign Key
between tables is called b. Secondary Key
c. Foreign Key
d. None of these
17. Which of the following is a. Reflexivity rule c. Pseudotransitivity rule
not Armstrong’s Axiom? c. Transitivity rule
c. Pseudotransitivity rule
d. Augmentation rule
18. Inst_dept (ID, name, salary, This comes under d) Both Lossy and Lossy-
dept name, building, budget) a) Lossy-join join decomposition
is decomposed into decomposition
b) Lossy decomposition
instructor (ID, name, dept c) Lossless-join
decomposition
name, salary)
d) Both Lossy and Lossy-
department (dept name, join decomposition
building, budget)

19. There are two functional This can be combined as a) A->BC

dependencies with the same a) A->BC
set of attributes on the left b) A->B
side of the arrow: c) B->C
A->BC d) None of the mentioned
A->B

20. Consider a relation The number of superkeys c) 10

R(A,B,C,D,E) with the of R is:
following functional a) 2
dependencies: b) 7
c) 10
ABC -> DE and d) 12
 D -> AB

21. Suppose we wish to find the Which, if any, of the two a) Both I and II
ID’s of the employees that queries above will
are managed by people who correctly (in SQL2) get the
are managed by the desired set of employee
employee with ID 123. Here ID’s?
are two possible queries: a) Both I and II
b) I only
I.SELECT ee.empID c) II only
d) Neither I nor I
FROM Emps ee, Emps ff
WHERE ee.mgrID =
ff.empID AND ff.mgrID =
123;
II.SELECT empID
FROM Emps
WHERE mgrID IN
(SELECT empID FROM
Emps WHERE mgrID =
123);

22. Suppose relation Which of the following is c) B, C

R(A,B,C,D,E) has the not a key?
following functional a) A
dependencies: b) E
c) B, C
A -> B d) D
B -> C
BC -> A
A -> D
E -> A
D -> E

23. Which of the following is

not a valid SQL type? a. FLOAT c. DECIMAL
b. NUMERIC
c. DECIMAL
 d. CHARACTER

24. Which of the following are

TCL commands? a. COMMIT and a. COMMIT and
ROLLBACK ROLLBACK
b. UPDATE and
TRUNCATE
c. SELECT and
INSERT
d. GRANT and
REVOKE

25. How many Primary keys can

have in a table? a. Only 1 a. Only 1
b. Only 2
c. Depends on no of
Columns
d. Depends on DBA

26. Which of the following is

not a valid aggregate a. COUNT b. COMPUTE
function? b. COMPUTE
c. SUM
d. MAX

27. Which operator is used to

compare a value to a a. ANY d. IN
specified list of values? b. BETWEEN
c. ALL
d. IN
28. What operator tests column
for absence of data a. NOT Operator c. IS NULL Operator
b. Exists Operator
c. IS NULL Operator
d. None of the above

29. If we have not specified

ASC or DESC after a SQL a. DESC b. ASC
ORDER BY clause, the b. ASC
following is used by default
c. There is no default
value
d. None of the
mentioned

30. Which of the following is

also called an INNER JOIN? a. SELF JOIN b. EQUI JOIN
b. EQUI JOIN
c. NON-EQUI JOIN
d. None of the above

31. The tree structure diagram in

which the pointers of data are a. Tree b. B+ tree
stored at the leaf nodes of b. B+ tree
diagram is classified as c. B2 tree
d. B. tree

32. Which of the following is a

fundamental operation in a) Set intersection b) Natural join
relational algebra? b) Natural join
c) Assignment
d) None of the mentioned
33. The ___________ operation,
denoted by −, allows us to a) Union b) Set-difference
find tuples that are in one b) Set-difference
relation but are not in
another.
 c) Difference
d) Intersection
34. The relational algebra query A. Analytical B. Procedural
language is ___. B. Procedural
C. Symmetrical
D. Instrumental

35. How many types of relational A. 6 B. 7

operations are there? B. 7
C. 8
D. 9

36. Select operation is denoted A. σ A. Σ

by - B. R
C. P
D. S

37. What is Project Operation A. P D.∏

denoted by – B. R
C. O
D. ∏

38. In ___ products, the rows in A. Cross C. Both A and B

one table are combined with B. Cartesian
the rows in another table. C. Both A and B
D. None of the above
Overview, measures of query cost, query optimization, selection operation, sorting, join, evaluation
of expressions, transformation of relational expressions, estimating statistics of expression results,
evaluation plans, materialized views.

Sr. No. Question Options Answer

1. A ________ explores the a. Cost based optimizer a. Cost based
space of all query evaluation b. b. Space based optimizer
plans that are equivalent to a optimizer
given query. c. c. Time based optimizer
d. d. None of the
mentioned
2. In query processing, the a. Index Search b. Linear search
___________ is the lowest- b. Linear search
level operator to access data. c. File scan
d. Access paths
3. Which oracle is the join a. Oracle 9i c.Pre-oracle 9i
condition is specified using the b. Oracle 8i
WHERE clause: c. Pre-oracle 9i
d. Pre-oracle 8i
4. Which are the join types in a. Cross join d. All of the
join condition: b. Natural join mentioned
c. Join with USING clause
d. All of the mentioned
5. ___________ combines the a. PL/SQL a. PL/SQL
data manipulating power of b. SQL
SQL with the data processing c. Advanced SQL
power of Procedural d. PQL
languages.
6. What is the disadvantage of a. It is too expensive a. It is too expensive
cost-based optimizers? b. It is inefficient in
producing results
c. It does not perform the
desired function
d. None of the mentioned
7. The rule that allows the a. Logical equivalence rule b. Physical
transformation of a logical b. Physical equivalence equivalence rule
operation to a physical rule
operation is called ----- c. Memory equivalence
rule
d. None of the mentioned
8. Size estimation can be done a. Projection d. All of the
for which of the following b. Aggregation mentioned
processes? c. Set operation
d. All of the mentioned
9. If the results of one operation a. Chain b. Pipeline
are passed on to the other, it b. Pipeline
is called as _____ c. Materialized
d. Tree
10. Which feature converts row a. Views c. Pivot
data to a column for better b. Join
analytical view? c. Pivot
d. Trigger
11. What is the disadvantage of a. It is too expensive a. It is too expensive
cost-based optimizers? b. It is inefficient in
producing results
c. It does not perform the
desired function
d. None of the mentioned
12. The process of finding a good a. Query optimization a. Query
strategy for processing a b. Query processing optimization
query is called c. Query management
d. Query cost
13. The modification to a relation a. Moderator a. Differential
or expression is referred to as b. Change
its c. Alterations
d. differential
14. The operations of Natural-join a. Commutative b. associative
are b. Associative
c. Distributive
d. conjunctive
15. The iterator operation of a a. open() d.all of the above
demand driven pipeline b. next()
provides the function of c. close()
d. all of the above
16. Incremental view a. Materialized views a. Materialized
maintenance is needed to b. Relational views views
efficiently update c. Rational views
d. Query views
17. Materialized views constitute a. Linear data d.redundant data
b. Uniform data
c. Unique data
d. Redundant data
18. Advanced optimization a. Top-K optimization d.all of the above
techniques include b. Join minimization
optimization of updates, c. Parametric query
multiquery optimization and optimization
d. All of the above
19. The optimizer that explores a. Cost-based a.Cost-based
the space of all query- b. Plan-based
evaluation plans is called c. Estimate-based
d. Count-based
20. The complex queries a. Disk accesses a.Disk accesses
evaluation plan involves many b. Sector accesses
c. Parameters
d. Differentials
21. The process of replacement of a. Correlation b.Decorrelation
a nested query by a query b. Decorrelation
with a join is called c. Materialization
d. Non-materialization
22. The technique chosen by the a. Relation c.Both a & b
database system for b. Distributed columns
evaluation of an operation c. Both a & b
depends on the size of d. Distribution of tuples
23. Each relational algebra a. Parameters c.Operatins
expression represents a b. Differentials
particular sequence of c. Operations
d. routines
24. The operations of theta-join a. distributive c.Commutative
are b. conjunctive
c. commutative
d. associative
25. Keeping a materialized view a. deferred maintenance c.View maintenance
up-to-date with respect to the b. immediate
underlying data is known as maintenance
c. view maintenance
d. data maintenance
26. Modern database system a. incremental view a.Incremental view
provides more direct support maintenance maintenance
for b. data view maintenance
c. deferred view
maintenance
d. immediate view
maintenance
27. The two expression generates a. Dependent c.Equivalent
the same set of tuples on b. Independent
every legal database instance, c. Equivalent
the relational are said to be d. Non-equivalent
28. Materialized views are used to a. Query optimization b.Query processing
speed up b. Query processing
c. Query management
d. Query cost
29. Optimizers use __________ to a. Analyzers c.Heuristic
reduce the cost of b. Statistics
optimization. c. Heuristics
d. Caches
30. The join orders where the a. Right deep join orders b. Left deep join
right operand of each join is in b. Left deep join orders orders
one of the initial relations are c. Outer join orders
called as ________ d. None of the mentioned
Transaction: Transaction concepts, properties of transactions, serializability of transactions,
testing for serializability, System recovery, Two- Phase Commit protocol, Recovery and
Atomicity, Log-based recovery, concurrent executions of transactions and related problems,
Locking mechanism, solution to concurrency related problems, deadlock, , two-phase locking
protocol, Isolation.

Sr. Question Options Answer

No.
1. An operation is part of a A. Logically A) Logically
transaction if it is ___ related. B. Analytically
C. Reasonably
D. None

2. To access the contents of the A. Single A) Single

database, ___ user performs B. Two
transactions. C. Three
D. Multiple

3. Which of the following is an A. Read D) All of the above

operation of transactions? B. Write
C. Commit
D. All of the above

4. X is read from a database and A. Read A) Read

stored in a buffer in main memory B. Write
with the ___ operation. C. Commit
D. Rollback

5. __ is used to permanently save the A. Read C) Commit

work. B. Write
C. Commit
D. Rollback

6. An undo operation is called a ___. A. Rollback A. Rollback

B. Commit
C. Write
D. Read
7. In a database, prior to and after a A. Consistency A) Consistency
transaction, properties are used to B. Redundancy
ensure ___. C. Latency
D. Anonymity

8. Which of the following is a A. Atomicity D. All of the above

property of transaction? B. Consistency
C. Durability
D. All of the above

9. ___ states that all operations of a A. Atomicity A. Atomicity

transaction must occur B. Consistency
simultaneously; otherwise, the C. Isolation
transaction will be aborted. D. Durability

10. With regards to transaction a. Ensuring that d. All of the

processing, any DBMS should be transactions are free above.
capable of: from interference
from other users.
b. Parts of a transaction
are not lost due to a
failure.
c. Transactions do not
make the database
inconsistent.
d. All of the above.

11. What is ACID properties of A. Atomicity, B. Atomicity,

Transactions? Consistency, Consistency,
Isolation, Database Isolation,
B. Atomicity, Durability
Consistency,
Isolation, Durability
C. Atomicity,
Consistency,
Inconsistent,
Durability
D. Automatically,
Concurrency,
Isolation, Durability
12. Database locking concept is used A. Lost Update D. All of the
to solve the problem of B. Uncommitted above
Dependency
C. Inconsistent Data
 D. All of the above

13. A system is in a ______ state if A. Idle C. Deadlock

there exists a set of transactions B. Waiting
such that every transaction in the C. Deadlock
set is waiting for another D. Ready
transaction in the set.
14. The deadlock state can be A. Commit B. Rollback
changed back to stable state by B. Rollback
using _____________ statement. C. Savepoint
D. Deadlock
15. _________ rollback requires the A. Total B. Partial
system to maintain additional B. Partial
information about the state of all C. Time
the running transactions. D. Commit
16. A transaction for which all A. Atomic D. durable
committed changes are permanent B. Consistent
is called: C. Isolated
D. durable

17. A transaction may not always A. Aborted A. Aborted

complete its execution B. Terminated
successfully. Such a transaction is C. Closed
termed D. All of the mentioned
18. Transaction management ensures A. Atomicity and B. Atomicity
____________ and __________ Intigrity and
properties. B. Atomicity and Durability
Durability
C. Atomicity and
Abstraction
D. None of these
19. Which of the following is the A. Rollback C. Switch to
preferred way to recover a B. Rollforward duplicate
database after a system failure? C. Switch to duplicate database
database
D. Reprocess
transactions
20. A shared lock allows which of the A. Delete C. READ
following types of transactions to B. INSERT
occur? C. READ
D. UPDATE

21. Locking may cause which of the A. Erroneous updates B. Deadlock

following problems? B. Deadlock
C. Versioning
 D. All of the above.

22. The transaction log includes a. The before-image of d. The essential data
which of the following? a record of the record
b. The after-image of a
record
c. The before and after-
image of a record
d. The essential data of
the record

23. The “all-or-none” property is a. Isolation c. Atomicity

commonly referred to as b. Durability
_________ c. Atomicity
d. None of the
mentioned

24. Which of the following is not a a. Atomicity b. Simplicity

property of a transaction? b. Simplicity
c. Isolation
d. Durability

25. A transaction that has not been a. Compensating b. Aborted

completed successfully is called transaction transaction
as _______ b. Aborted transaction
c. Active transaction
d. Partially committed
transaction

26. Which of the following is not a a. Active d. Compensated

transaction state? b. Partially committed
c. Failed
d. Compensated

27. The execution sequences in a. Serials b. Schedules

concurrency control are termed as b. Schedules
________ c. Organizations
d. Time tables

28. I and J are _________ if they are A. Conflicting A. Conflicting

operations by different B. Overwriting
transactions on the same data C. Isolated
item, and at least one of them is a D. Durable
write operation.
29. If a schedule S can be transformed A. Non conflict C. Conflict
into a schedule S’ by a series of equivalent equivalent
swaps of non-conflicting B. Equal
instructions, then S and S’ are C. Conflict equivalent
D. Isolation equivalent

30. A schedule is __________ if it is A. Conflict serializable A. Conflict

conflict equivalent to a serial B. Conflicting serializable
schedule. C. Non serializable
D. None of the
mentioned
Recovery System: failure classification, recovery and atomicity, log based recovery,
checkpoints, buffer management, advanced recovery techniques. Introduction to Web
databases, distributed databases, data warehousing and data mining, Data Security

Sr. No. Question Options Answer

1. Which of the following is a. Deferred update c.Two-phase
not a recovery technique? b. Immediate update commit
c. Two-phase commit
d. Recovery management
2. Checkpoints are a part of a. Recovery measures a. Recovery
b. Security measures measures
c. Concurrency measures
d. Authorization measures
3. Before a block of data in a. Read-write logging c. Write-ahead
main memory can be b. Read-ahead logging logging
output to the database, all c. Write-ahead logging
log records pertaining to d. None of the mentioned
data in that block must
have been output to
stable storage. This is
___
4. Writing the buffered log a. Memory d. Disk
to __________ is b. Backup
sometimes referred to as c. Redo memory
a log force. d. Disk
5. The a. Latches c. Dirty Block
__________________ b. Swap Space
contains a list of blocks c. Dirty Block
that have been updated in d. None of the mentioned
the database buffer.
6. A distributed database is a. A single logical database a. A single
which of the following? that is spread to multiple logical
locations and is database that
interconnected by a network is spread to
b. A loose collection of file multiple
that is spread to multiple locations and
locations and is is
interconnected by a network interconnected
c. A single logical database by a network
that is limited to one
location.
d. A loose collection of file
that is limited to one
location.
7. Which of the following is a. Reduced network traffic c. Each site
a disadvantage of b. If the database fails at one must have the
replication? site, a copy can be located same storage
at another site. capacity
 c. Each site must have the
same storage capacity.
d. Each transaction may
proceed without
coordination across the
network.
8. A distributed database a. Totally centralized at one d. All of the
can use which of the location and accessed by above
following strategies? many sites
b. Partially or totally
replicated across sites
c. Partitioned into segments at
different sites
d. All of the above

9. In a data mining task a. Perform all possible data d. Allow

when it is not clear about mining tasks interaction
what type of patterns b. Handle different with the user
could be interesting, the granularities of data and to guide the
data mining system patterns mining
should: c. Perform both descriptive process
and predictive tasks
d. Allow interaction with the
user to guide the mining
process
10. To detect fraudulent a. Feature selection c. Outlier
usage of credit cards, the b. Prediction analysis
following data mining c. Outlier analysis
task should be used: d. All of the above
11. In high dimensional a. It becomes difficult to a. It becomes
spaces, the distance distinguish between the difficult to
between data points nearest and farthest distinguish
becomes meaningless neighbors between the
because: b. The nearest neighbor nearest and
becomes unreachable farthest
c. The data becomes sparse neighbors
d. There are many
uncorrelated features
12. When we update any a. Select authorization b. update
tuple in the relation b. Update authorization authorization
which Authorization on a c. Grant authorization
relation allows a user to? d. Define authorization
13. The grants privileges on a. Specified attributes c. Entire
SQL authorization b. Specified tuples Entire relation
mechanism doesn’t have relation
___ c. Entire relation
d. None of the above
14. An Error that occurs a. System error c. Logical
because of some internal b. View error error
condition that interrupts c. Logical error
 the normal execution is d. Application Error
called
15. In which phase, the a. Repeating b. Redo
system replays updates of b. Redo
all transactions by c. Replay
scanning the log forward d. Undo
from the last checkpoint.
16. What is that part of main a. Buffer a. Buffer
memory available for b. Catalog
storage of copies of disk c. Storage
blocks. d. Secondary storage
17. In the buffer where there a. Pinned block strategy c. Buffer
is no space for another b. Forced output block replacement
block, the block can be c. Buffer replacement strategy strategy
inserted using ____ d. All of the mentioned
18. The frequently used a. Most recently used b. Least
buffer replacement b. Least recently used recently used
strategy is c. Longest block
d. All of the mentioned
19. The technique where the a. Replacement strategy d. Most
blocks which have been b. Forced strategy recently used
used are replaced is c. Crash recovery system
called ___ d. Most recently used
20. Which of the following is a. Network Transparency d. None of the
not a promise of b. Replication Transparency above
distributed database? c. Fragmentation
Transparency
d. None of the above
21. What is true about data a. Data Mining is defined as d. All of the
mining? the procedure of extracting above
information from huge sets
of data
b. Data mining also involves
other processes such as Data
Cleaning, Data Integration,
Data Transformation
c. Data mining is the
procedure of mining
knowledge from data
d. All of the above
22. What may be defined as a. Outlier Analysis a. Outlier
the data objects that do b. Evolution Analysis Analysis
not comply with the c. Prediction
general behavior or d. Classification
model of the data
available.
23. Which one of the a. Boot crash c. Transaction
following is a failure to a b. Read failure failure
system? c. Transaction failure
d. All of the mentioned
24. Which of the following a. Read error c. Logical
belongs to transaction b. Boot error error
failure? c. Logical error
d. All of the mentioned
25. The assumption that a. Stop assumption d. Fail-stop
hardware errors and bugs b. Fail assumption assumption
in the software bring the c. Halt assumption
system to a halt, but do d. Fail-stop assumption
not corrupt the
nonvolatile storage
contents, is known as the
26. Which kind of failure a. Transaction failure c. Disk failure
loses its data in head b. System crash
crash or failure during a c. Disk failure
transfer operation. d. All of the mentioned
27. Which of the following a. Bug in software d. All of the
causes system to crash b. Loss of volatile data mentioned
c. Hardware malfunction
d. All of the mentioned
28. The log is a sequence of a. Log records a. Log records
_________ recording all b. Records
the update activities in c. Entries
the database. d. Redo
29. Writing the buffered log a. Memory d. Disk
to __________ is b. Backup
sometimes referred to as c. Redo memory
a log force. d. Disk
30. The remote backup site is a. Primary Site b. Secondary
sometimes also called the b. Secondary Site Site
c. Tertiary Site
d. None of the mentioned
 DBMS Question Bank
Sr. No Question Answer

ROLLBACK in a database is ____ statement.

(A) DDL

(B) DML

(C) DCL

1 (D) TCL D

In a relational model, relations are termed as

(A) Rows

(B) Tables

(C) Attributes

2 (D) Tuples B

Which of the following is a procedural language?

(A) Relational algebra

(B) Query language

(C) Tuple relational calculus

3 (D) Domain relational calculus A

Which of the following types of tables constraints will prevent the entry of
duplicate rows?

(A) Primary keys

(B) Foreign keys

(C) Unique keys

4 A

In an E-R diagrams, ellipses represents

(A) Attributes

(B) Link between attributes and entity sets

(C) Relation among entity set

5 (D) Entity set A

 In a relational modes, a cardinality is termed as

(A) Number of constraints

(B) Number of tables

(C) Number of attributes

6 (D) Number of tuples D

Which of the following is not a type of database?

(A) Relational

(B) Hierarchical

(C) Network

7 (D) Transition D

The most commonly used operation in relational algebra for projecting a set
of tuple from a relation is

(A) Union

(B) Select

(C) Projection

8 (D)
TheJoin
_____ operation allows the combining of two relations by merging pairs B
of tubles, one from each relation, into a single tuple.

(A) Intersection

(B) Union
9 C
A _____ is an abstract model that describes how the data are organised and
represented.

(A) Database

(B) Schema

(C) Instances

10 (D) Data model D

 Which of the following is a set of one or more attributes taken collectively to
uniquely identify a record?

(A) Foreign key

(B) Super key

(C) Sub key

11 (D) Candidate key B

The ____ provides a set of operations that take one or more relations as input
and return a relation as an output.

(A) Relation flow

(B) Scheme diagram

(C) Relational algebra

12 (D) Schematic representation C

Where will we find the referential integrity command?

(A) Table

(B) Tools

(C) Format

13 (D) None of these D

____ represents raw facts, whereas ___ is data made meaningful.

(A) Data, information

(B) Information, reporting

(C) Information, bits

14 (D) Records, bytes A

When data changes in multiple lists and all lists are not updated, this causes

(A) Data redundancy

(B) Data inconsistency

(C) Duplicate data

15 (D) Information overload B

Which of the following is a Data Model?

(A) Entity-Relationship model
(B) Relational data model
(C) Object-Based data model
16 (D) All of the above D
 Snapshot of the data in the database at a given instant of time is called
(A) Database Schema
(B) Database Instance
(C) Database Snapshot
17 (D) All of the above B

A functional dependency between two or more non-key attributes is called

(A) Transitive dependency
(B) Partial transitive dependency
(C) Functional dependency
18 (D) Partial functional dependency A

The Primary key must be

(A) Non Null
(B) Unique
(C) Option A or B
19 (D) Option A and B C
In SQL, which of the following is not a data Manipulation Language
Commands?
(A) DELETE
(B) SELECT
(C) UPDATE
20 (D) CREATE D

A transaction completes its execution is said to be

(A) Saved
(B) Loaded
(C) Rolled
21 (D) Committed D

Which of the following is not a Schema?

(A) Database Schema
(B) Physical Schema
(C) Critical Schema
22 (D) Logical Schema C

Who proposed the relational model?

(A) Bill Gates
(B) E.F. Codd
(C) Herman Hollerith
23 (D) Charles Babbage B

The index consists of

(A) A list of keys
(B) Pointers to the master list
(C) Both (a) and (b)
24 (D) None of the above C
 In SQL, GRANT command is used to
(A) Allow user to access databases
(B) Allow user to create databases
(C) Grant system privileges, roles, and object privileges to uses and roles
25 (D) Choose auditing for specific SQL commands C

In an Entity-Relationship Diagram Rectangles represents

(A) Entity sets
(B) Attributes
(C) Database
26 (D) Tables A

Set of permitted values of each attribute is called

(A) Domain
(B) Tuple
(C) Relation
27 (D) Schema A

The attribute that can be divided into other attributes is called

(A) Simple Attribute
(B) Composite Attribute
(C) Multi-valued Attribute
28 (D) Derived Attribute B

Database locking concept is used to solve the problem of

(A) Lost Update
(B) Uncommitted Dependency
(C) Inconsistent Data
29 (D) All of the above D

Which of the following is Relation algebra Operation?

(A) Select
(B) Union
(C) Rename
30 (D) All of the above D

In an Entity-Relationship Diagram “Diamonds” represents

(A) Attributes
(B) Multi-valued attributes
(C) Weak entity set
31 (D) Relationship sets D

What are ACID properties of Transactions?

(A) Atomicity, Consistency, Isolation, Database
(B) Atomicity, Consistency, Isolation, Durability
(C) Atomicity, Consistency, Inconsistent, Durability
32 (D) Automatically, Concurrency, Isolation, Durability B
 A relation that has no partial dependencies is in which normal form
(A) First
(B) Second
(C) Third
33 (D) BCNF B

A command to remove a relation from an SQL database

(A) Delete table <table name>
(B) Drop table <table name>
(C) Erase table <table name>
34 (D) Alter
Which oftable <table name>
the following in true regarding Referential Integrity? B
(A) Every primary-key value must match a primary-key value in an associated
table
(B) Every primary-key value must match a foreign-key value in an associated
table
(C) Every foreign-key value must match a primary-key value in an associated
35 table C
A relation is ………………. if every field contains only atomic values that are, no
lists or sets.
A) 1 NF
B) 2 NF
C) 3 NF
36 D) BCNF A

A table is in the ………………….. if only candidate keys are the determinants.

A) functional dependency
B) transitive dependency
C) 4 NF
37 D) BCNF D
The rule that a value of a foreign key must appear as a value of some specific
table is called a
A. Referential constraint
B. Index
C. Integrity constraint
38 D. Functional A

Relational Algebra is
A. Data Definition Language
B. Meta Language
C. Procedural query Language
39 D. None of the above C

Relational calculus is a
A. Procedural language
B. Non-Procedural language
C. Data definition language
40 D. High level language B
 E-R model uses this symbol to represent the weak entity set?
A. Dotted rectangle
B. Diamond
C. Doubly outlined rectangle
41 D. None of these C

………. is an alternative of log based recovery.

A. Disk recovery
B. Shadow paging
C. Dish shadowing
42 D. Crash recovery B

Which of the following is not a property of transactions?

A. Atomicity
B. Concurrency
C. Isolation
43 D. Durability B

Which of the following ensures the atomicity of the transaction?

A. Transaction management component of DBMS
B. Application Programmer
C. The concurrency control component of DBMS
44 D. Recovery management component of DBMS A
……… protocol is used to perform multiple transactions that execute on a
different database.
A. commit
B. two-phase lock
C. two-phase commit
45 D. locking C

Which of the following represents a query in the tuple relational calculus?

a) { }{P(t) | t }
b) {t | P(t)}
c) t | P() | t
46 d) All of the mentioned B
A user executes a query which the ___ in the system uses to generate the
internal form of the query. In addition to checking the syntax of the query, the
____ verifies the name of the relation in the database, then the tuple, then the
attribute value.
A) Parser B) Translation
47 C) Optimization D) Evaluation A

The system must create a query ____ plan before it can fully evaluate a query.
A) Optimization B) Parser
48 C) Translation D) Evaluation D
 The concept whichchecks the syntax of query which is written according to
rules of the grammer is classified as
a) Query graph b) Query tree
49 c) Parser d) Scanner c

A relation that has no partial dependencies is in which normal form

a) First b) Second
50 c) Third d) BCNF b

Which of the following makes the transaction permanent in the database ?

a) View b) Commit
51 c) Rollback d) Flashback b

The system must create a query ____ plan before it can fully evaluate a query.
a) Optimization b) Parser
52 c) Translation d) Evaluation d

Collections of operations that form a single logical unit of work are called
__________?
a) Views b) Networks
53 c) Units d) Transactions d

The real use of the Two-phase commit protocol is ______________

a) Deadlock will not occur b) Concurrency control can be avoided
54 c) Atomicity, i.e, all-or-nothing commits at all sites d) None of the above c

Which of the following is a property of transactions?

a) Atomicity b) Durability
55 c) Isolation d) All of the mentioned d

Checkpoints are a part of

a)Recovery measures. b) Security measures.
56 c) Concurrency measures. d) Authorization measures. a
 Which of the following is not a recovery technique?
a) Deferred Database Modification
b) Immediate Database Modification
c) Two-phase commit
57 d) Recovery management c

The “all-or-none” property is commonly referred to as _________?

a) Isolation b) Durability
58 c) Atomicity d) None of the mentioned c

Transaction processing is associated with everything below except

a) Conforming a action or triggering a response
b) Producing detail summary or exception report
c) Recording a business activity
59 d) Maintaining a data a
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
60 d) BothofB the
Which andfollowing
C is the preferred way to recover a database after a b
transaction in progress terminates abnormally?
a.Rollback
b.Rollforward
c.Switch to duplicate database
d.Reprocess transactions
61 a
Database locking concept is used to solve the problem of
a)Lost Update
b)Uncommitted Dependency
c)Inconsistent Data
d)All of the above
62 d
The deadlock state can be changed back to stable state by using
_____________ statement.

a)Commit

b)Rollback

c)Savepoint

d)Deadlock
63 b
 Which of the following contains a complete record of all activity that affected
the contents of a database during a certain period of time?

a)report writer

b)query language

c)data manipulation language

d)transaction log
64 d

Concurrency control is important for which of the following reasons?

a)To ensure data integrity when updates occur to the database in a multiuser
environment
b)To ensure data integrity when updates occur to the database in a single-user
environment
c)To ensure data integrity while reading data occurs to the database in a
multiuser environment
d)To ensure data integrity while reading data occurs to the database in a
single-user environment
65 a
A deadlock exists in the system if and only if the wait-for graph contains a
___________.
a)Cycle
b)Direction
c)Bi-direction
d)Rotation
66 a

What is/are the step(s) involved in fetching the data from the database in
query processing?
a)Parsing and translation b) Optimization
67 c) Evaluation d) All of the above d

If one attribute is determinant of second, which in turn is determinant of third,

then the relation cannot be:
a) Well-structured b) 1NF
68 c) 2NF d) 3NF d

Which of the following is not a recovery technique?

a) Deferred update
b) Immediate update
c) Two-phase commit
69 d) Recovery management c

The simplest approach to introducing redundancy is to duplicate every disk is

called …..
a) mirroring b) imaging
70 c) copying d) All of the above a
 If database modifications occur while the transaction is still active, the
transaction is said to use the ___________technique.
a) Deferred-modification b) Late-modification
71 c) Immediate-modification d) Undo c
The log is a sequence of _________ recording all the update activities in the
database.
a) Log records b) Records
72 c) Entries d) Redo b
Let us suppose that in a distributed database, during a transaction T1, one of
the sites, say S1, is failed. When recovers, the site S1 has to check its log file
(log based recovery) to decide the next move on the transaction T1. If the log
contains a <T, Commit> record, what the site S1 has to do?
a) Need not do anything b) Perform Undo
73 c) Perform Redo d) Abort the transaction c
With regards to transaction processing, any DBMS should be capable of:
a)Ensuring that transactions are free from interference from other users.
b)Parts of a transaction are not lost due to a failure.
c)Transactions do not make the database inconsistent.
d)All of the above.
74 d

In case of any shut down during transaction before commit which of the
following statement is done automatically ?
a) View b)Commit
75 c) Rollback d) Flashback c
What is ACID properties of Transactions?
a)Atomicity, Consistency, Isolation, Database
b)Atomicity, Consistency, Isolation, Durability
c)Atomicity, Consistency, Inconsistent, Durability
d)Automatically, Concurrency, Isolation, Durability
76 b

A system is in a ______ state if there exists a set of transactions such that

every transaction in the set is waiting for another transaction in the set.
a) Idle b) waiting
77 c) Ready d) Deadlock d
A transaction completes its execution is said to be
a)Saved
b)Loaded
c)Rolled
d)Committed
78 d
A transaction may not always complete its execution successfully. Such a
transaction is termed
a)Aborted
b)Terminated
c)Closed
d)All of the mentioned
79 a
 Locking may cause which of the following problems?
a)Erroneous updates
b)Deadlock
c)Versioning
d)All of the above.
80 b
In database management system, the executing process or executing program
which considers the updating or reading of records stored in database is called
a)conceptualization
b)execution
c)implementation
d)transaction
81 d
Execution of translation in isolation preserves the _________ of a database
a)Atomicity
b)Consistency
c)Durability
d)All of the mentioned
82 b
Which of the following is not a property of a transaction?

a)Atomicity

b)Simplicity
83 b
X is read from a database and stored in a buffer in main memory with the ___
operation.
A. Read
B. Write
C. Commit
84 D. Rollback A

Which of the following is an operation of transactions?

A. Read
B. Write
C. Commit
85 D. All of the above D

An operation is part of a transaction if it is ___ related.

A. Logically
B. Analytically
C. Reasonably
86 D. None A
Writing the data from the buffer back to the database is accomplished by
using the _____ operation.
A. Read
B. Write
C. Commit
87 D. Rollback B
 In a database, prior to and after a transaction, properties are used to ensure
___.
A. Consistency
B. Redundancy
C. Latency
88 D. Anonymity A

All changes made in a transaction are ___ once it commits.

A. Visible
B. Not Visible
C. Broken
89 D. Not Broken A
What is TRUE about Consistency?
A. As a result of integrity constraints, the database remains consistent before
and after the transaction.
B. In most cases, a database remains either in its previous stable state or in a
new stable state following the execution of a transaction.
C. Every transaction undergoes a consistent database instance, which is the
consistent property of databases.
90 D. All of the above D
What is TRUE about Isolation?
A. By using the data used during a transaction, the second transaction will not
be able to use it until the first has been executed.
B. The data item X cannot be accessed by any other transaction T2 until the
transaction T1 is completed and the data item X is used by the transaction T1.
C. It enforced the isolation property via its concurrency control subsystem.
91 D. All of the above D

What is TRUE about atomicity?

A. The transaction cannot be partially completed, since there is no midway.
B. In each transaction, either the entire transaction is executed or it is not.
C. Both A and B
92 D. None of the above C

When dealing with database transactions, there is often a need for multiple
users to use a database to perform different operations. In this case, ___ of
the database occurs.
A. Concurrent Connection
B. Concurrent Reduction
C. Concurrent Execution
93 D. Concurrent Revolution C
During simultaneous execution, each operation should be performed
interleaved with the others, ensuring that there is no interference with the
other operations. This maintains a database ___.
A. Consistency
B. Redundancy
C. Concurrency
94 D. None C
What is TRUE about Durability?
A. The failure of the system or an error in a transaction cannot cause them to
be lost.
B. A consistent state is reached when a transaction is completed.
C. System failures cannot lead to the loss of that consistent state.
95 D. All of the above D
 The concurrency ___ allows us to maintain the concurrency of the database.
A. Protocols
B. Controls
C. Control Protocols
96 D. None C

What is the Dirty Read Problem also known as?

A. W-W Conflict
B. W-R Conflict
C. R-R Conflict
97 D. None B
 Priyadarshini College Of Engineering, Nagpur
Questions bank of DBMS

1) Which one of the following is a type of data manipulation command?

a. Create

b. Alter

c. Delete

d. All of the above

Answer C

2) Which of the following is generally used for performing tasks like creating the structure of
the relation, deleting relation?

a. DML

b. Query

c. Relational schema

d. DDL

Answer D

3) Which of the following the term 'DBA' referred?

a. Data bank administrator

b. Database administrator

c. Data admin

d. None of the above

Answer B

4) Which of the following refers to copies of the same data (or information) occupying the
memory space at multiple places?

a. Data responsibility
b. Data inconsistency

c. Data mining

d. Data redundancy

Answer D

5) Which of the following refers to the level of data abstraction that describes exactly how the
data actually stored?

a. Conceptual level

b. Physical level

c. File level

d. Logical level

Answer B

6) Which of the following is generally used for performing tasks like creating the structure of
the relations, deleting relation?

a)DML(Data Manipulation Language)

b)Query

c)Relational Schema

d)DDL(Data Definition Language)

Answer:d

7)A Database Management System is a type of _____software.

a)It is a type of system software

b)It is a kind of application software

c)It is a kind of general software

d)Both A and C

Answer:a

8) A huge collection of the information or data accumulated form several different sources is
known as ____:

a)Data Management
b)Data Mining

c)Data Warehouse

d)Both B and C

Answer:c

9) In general, a file is basically a collection of all related____.

a)Rows & Columns

b)Fields

c)Database

d)Records

Answer:d

10)Which of the following refers to the number of tuples in a relation?

a)Entity

b)Column

c)Cardinality

d)None of the above

Answer:c

11) which of the following is a feature of the database ?

a) No- backup for the data stored

b) User interface provided

c)Lack of Authentication

d)store data in multiple locations

Answer - b

12) which forms have a relation that contain information about a single entity ?

a) 4NF

b) 2NF

c) 5NF
d) 3NF

Answer - a

13)which of the following is not an example of DBMS ?

a) MYSQL

b) Microsoft acess

c) IBM DB2

d) Google

Answer - d

14) which of the following is a function of the DBMS ?

a) Storing data

b) providing multi- users access control

c) data integrity

d) All of the above

Answer - d

15) It is a better to use files than a DBMS when there are ........

a) stringent real - time requirements

b) multiple users wish to access the data

c) complex relationship among data

d) All of the above

Answer – b

16)In the architecture of a database system external level is the ...............

A. physical level

B. logical level

C. conceptual level

D. view level

Ans : view level

17) The ........ is used for creating and destroying table, indexes and other forms of structures.

A. data manipulation language

B. data control language

C. transaction control language

D. data definition language

Ans : data definition language

18) is, a table have more than one set of attributes that could be chosen as the key

A. foreign key

B. integrity key

C. relationship

D. candidate key

Ans : Candidate key

19) A ......... is used to define overall design of the database

A. schema

B. application program

C. data definition language

D. code

Ans : Schema

20) A ........... is a set of column that identifies every row in a table.

A. composite key

B. candidate key

C. foreign key

D. super key

Ans: super key

21) Which type of data can be stored in the database?

a) Image oriented data

b) Text, files containing data

c) Data in the form of audio or video

d) All of the above

Answer: d

22)In which of the following formats data is stored in the database management system?

a) Image

b) Text

c) Table

d) Graph

Answer: c

23)Which of the following is not a type of database?

a) Hierarchical

b) Network

c) Distributed

d) Decentralized

Answer: d

24)What does an RDBMS consist of?

a) Collection of Records

b) Collection of Keys

c) Collection of Tables

d) Collection of Fields

Answer: c

25)The DBMS acts as an interface between ______ and ______ of an enterprise-class system.

a) Data and the DBMS

b) Application and SQL

c) Database application and the database

d) The user and the software

Answer: c

26)What do you mean by one to many relationship between Teacher and Class table?

A.One class may have many teachers

B.One teacher can have many classes

C.Many classes may have many teachers

D.Many teachers may have many classes

Answer : [Option : B]

27)What are the different view to present a Table ?

A.Datasheet View

B.Design View

C.Pivote TableView

D.All Of Above

Answer : C

28)In one-to-many relationship the table on 'many' side is called ___

A.Parent

B.Child

C.Sister

D.Master

Answer : [Option : B]

29)In which state one gathers and list all the necessary fields for the database design project.

A.Data Definition

B.Data Refinement

C.Establishing Relationship

D.None Of The Above

Answer : [Option : A]
30)Which of the following enables us to view data from a table based on a specific criterion

A.Form

B.Query

C.Macro

D.Report

Answer : [Option : B]

31) Which of the following is a feature of DBMS?

a) Minimum Duplication and Redundancy of Data

b) High Level of Security

c) Single-user Access only

d) Support ACID Property

Ans:-C

32) Which of the following is a feature of the database?

a) No-backup for the data stored

b) User interface provided

c) Lack of Authentication

d) Store data in multiple locations

Ans :-B

33) Which of the following is a function of the DBMS?

a) Storing data

b) Providing multi-users access control

c) Data Integrity

d) All of the above

Ans :- D

34) Which of the following is a component of the DBMS?

a) Data
b) Data Languages

c) Data Manager

d) All of the above

Ans:-D

35) A Database Management System is a type of _____software.

a) It is a type of system software

b) It is a kind of application software

c) It is a kind of general software

d) Both A and C

Ans:- A

36) Which of the following can be used to extract or filter the data & information from the data
warehouse?

a) Data redundancy

b) Data recovery tool

c) Data mining

d) Both B and C

Ans:-C

37)______ is a set of one or more attributes taken collectively to uniquely identify a record.

a) Primary Key

b) Foreign key

c) Super key

d) Candidate key

Answer: c

38)The highest level in the hierarchy of data organization is called

a) Data bank

b) Data base

c) Data file
d) Data record

Answer: b

39)The property (or set of properties) that uniquely defines each row in a table is called the:

A. Identifier B. Index

C. Primary key

D. Symmetric key

Answer C. Primary key

40)What is a database?

a) Organized collection of information that cannot be accessed, updated, and managed

b) Collection of data or information without organizing

c) Organized collection of data or information that can be accessed, updated, and managed

d) Organized collection of data that cannot be updated

Answer: c

41)What does an RDBMS consist of?

a) Collection of Records

b) Collection of Keys

c) Collection of Tables

d) Collection of Fields

Answer: c

42)Which of the following schema concept provides different view of relational table to
different user?

1.Physical schema

2.External schema

3.Logical schema

4.Data model

Option 2 : External schema

43)Which symbol denote derived attributes in ER Model?

1.Double ellipse

2.Dashed ellipse

3.Squared ellipse

4.Ellipse with attribute name underlined

Option 2 : Dashed ellipse

44)Which of the following components is not a part of Entity Relationship Diagrams?

1.Ellipse

2.Double rectangle

3.Double lines

4.Hexagons

Option 4 : Hexagons

45) A collection of interrelated records is called a ____.

1.spreadsheet

2. management information system

3.database

4.utility file

Option 3 : database

46) The ER model describes data as

1.entities only

2.entities, relationships and attributes

3. attributes only

4.none of the above

Option 2 : entities, relationships and attributes

47)What are a database management system?

(a) Allows simultaneous access to multiple files

(b) Can do more than one record management system

(c) A file contains a collection of programs for managing data

(d) Both (a) and (b)

Answer: D

48)An attribute of a table cannot contain more than one value____

(a) First normal form (1NF)

(b) Second normal form (2NF)

(c) Third normal form (3NF)

(d) Fourth normal form (4NF)

Answer: A

49)Which of the following is a Data Model?

(a) Entity Relationship model

(b) Relational data model

(c) Object Based data model

(d) All

Answer: D

50) Which command is used in SQL to remove index from database?

(a) DELETE INDEX

(b) DROP INDEX

(c) REMOVE INDEX

(d) ROLL BACK INDEX

Answer: B

51)In hierarchical model, data is organized_____

(a) Logical structure

(b) Physical structure

(c) Tree like structure

(d) None of these

Answer: C

52)What does ‘Double Rectangles’ show in the Entity-Relationship diagram?

(a) Relationship Set

(b) Weak Entity Sets

(c) Derived Attributes

(d) Multi-valued Attributes

Answer: B

53)Database Management System (DBMS) is:

(a) Collection of interrelated data

(b) Collection of programs to access data

(c) Collection of data describing one particular enterprise

(d) All of the above

Answer: D

54)How many types of keys are there in Database Design?

(a) Candidate key

(b) Primary key

(c) Foreign key

(d) All of these

Answer: D

55)What is the name given to database management system which is capable of handling full
text data, image data, audio and video?

(a) Full media

(b) Graphics media

(c) Multimedia

(d) Hypertext

Answer: C
56)Relational model uses some unfamiliar terminology. One tuple is equal to __

(a) record

(b) field

(c) file

(d) data base

Answer: A

57)Which command is used to remove a relation from an SQL?

a) Drop table

b) Delete

c) Purge

d) Remove

Answer: a

58) ______ is a set of one or more attributes taken collectively to uniquely identify a record.

a) Primary Key

b) Foreign key

c) Super key

d) Candidate key

Answer: c

59)Which of the following is the subset of SQL commands used to manipulate Oracle
Structures, including tables?

a) Data Described Language

b) Data Retrieval Language

c) Data Manipulation Language

d) Data Definition Language

Answer: d

60)Which of the following is not the utility of DBMS?

i) Backup ii) Loading iii) Process Organization iv) File organization

a) i, ii, and iv only

b) i, ii and iii only

c) i, iii and iv only

d) All i, ii, iii, and iv

Answer: a

61)Which of the following command is correct to delete the values in the relation teaches?

a) Delete from teaches;

b) Delete from teaches where Id =’Null’;

c) Remove table teaches;

d) Drop table teaches;

Answer: a

62) Procedural language among the following is ____

a) Domain relational calculus

b) Tuple relational calculus

c) Relational algebra

d) Query language

Answer: c

63)Which of the following is not a function of the database?

a) Managing stored data

b) Manipulating data

c) Security for stored data

d) Analysing code

Answer: d

64) Which of the following is a component of the DBMS?

a) Data

b) Data Languages
c) Data Manager

d) All of the above

Answer: d

65)The DBMS acts as an interface between ______ and ______ of an enterprise-class system.

a) Data and the DBMS

b) Application and SQL

c) Database application and the database

d) The user and the software

Answer: c

66)The ability to query data, as well as insert, delete, and alter tuples, is offered by ____

a) TCL (Transaction Control Language)

b) DCL (Data Control Language)

c) DDL (Data Definition Langauge)

d) DML (Data Manipulation Langauge)

Answer: d

67) Procedural language among the following is ____

a) Domain relational calculus

b) Tuple relational calculus

c) Relational algebra

d) Query language

Answer: c

68)What is the full form of DBMS?

a) Data of Binary Management System

b) Database Management System

c) Database Management Service

d) Data Backup Management System

Answer: b

69)What is a database?

a) Organized collection of information that cannot be accessed, updated, and managed

b) Collection of data or information without organizing

c) Organized collection of data or information that can be accessed, updated, and managed

d) Organized collection of data that cannot be updated

Answer: c

70)Which type of data can be stored in the database?

a) Image oriented data

b) Text, files containing data

c) Data in the form of audio or video

d) All of the above

Answer: d

71)Which of the following is not a type of database?

a) Hierarchical

b) Network

c) Distributed

d) Decentralized

Answer: d

72)Which of the following is a feature of DBMS?

a) Minimum Duplication and Redundancy of Data

b) High Level of Security

c) Single-user Access only

d) Support ACID Property

Answer: c
73)In the __________ normal form, a composite attribute is converted to individual attributes.
A. First

B. Second

C. Third

D. Fourth

Answer: A

74) Tables in second normal form (2NF):

A. Eliminate all hidden dependencies

B. Eliminate the possibility of a insertion anomalies

C. Have a composite key

D. Have all non key fields depend on the whole primary key

Answer: A

75) Which-one of the following statements about normal forms is FALSE?

A. BCNF is stricter than 3 NF

B. Lossless, dependency -preserving decomposition into 3 NF is always possible

C. Loss less, dependency – preserving decomposition into BCNF is always possible

D. Any relation with two attributes is BCNF

Answer: C

76)Functional Dependencies are the types of constraints that are based on______

A. Key

B. Key revisited

C. Superset key

D. None of the mentioned

Answer: A

77)Which is a bottom-up approach to database design that design by examining the

relationship between attributes:

A. Functional dependency

B. Database modeling
C. Normalization

D. Decomposition

Answer: C

78) Which forms simplifies and ensures that there are minimal data aggregates and repetitive
groups:

A. 1NF

B. 2NF

C. 3NF

D. All of the mentioned

Answer: C

79) Which forms has a relation that possesses data about an individual entity:

A. 2NF

B. 3NF

C. 4NF

D. 5NF

Answer: C

80) Which forms are based on the concept of functional dependency:

A. 1NF

B. 2NF

C. 3NF sets at

D. 4NF

Answer: C

81) Empdt1(empcode, name, street, city, state, pincode). For any pincode, there is only one
city and state. Also, for given street, city and state, there is just one pincode. In normalization
terms, empdt1 is a relation in

A. 1 NF only

B. 2 NF and hence also in 1 NF

C. 3NF and hence also in 2NF and 1NF

D. BCNF and hence also in 3NF, 2NF and 1NF

Answer: B

82) We can use the following three rules to find logically implied functional dependencies. This
collection of rules is called

A. Axioms

B. Armstrong’s axioms

C. Armstrong

D. Closure

Answer: B

83) Which of the following is not Armstrong’s Axiom?

A. Reflexivity rule

B. Transitivity rule

C. Pseudotransitivity rule

D. Augmentation rule

Answer: C

84) The relation employee(ID,name,street,Credit,street,city,salary) is decomposed into

employee1 (ID, name) employee2 (name, street, city, salary) This type of decomposition is
called

A. Lossless decomposition

B. Lossless-join decomposition

C. All of the mentioned

D. None of the mentioned

Answer: D

85) Inst_dept (ID, name, salary, dept name, building, budget) is decomposed into instructor (ID,
name, dept name, salary) department (dept name, building, budget) This comes under

A. Lossy-join decomposition

B. Lossy decomposition
C. Lossless-join decomposition

D. Both Lossy and Lossy-join decomposition

Answer: D

86)There are two functional dependencies with the same set of attributes on the left side of the
arrow: A->BC A->B This can be combined as

A. A->BC

B. A->B

C. B->C

D. None of the mentioned

Answer: A

87) Consider a relation R(A,B,C,D,E) with the following functional dependencies: ABC -> DE and
D -> AB The number of superkeys of R is:

A. 2

B. 7

C. 10

D. 12

Answer: C

88) Which, if any, of the two queries above will correctly (in SQL2) desired set of employee ID’s?

A. Both I and II

B. I only

C. II only

D. Neither I nor I

Answer: A

89) Suppose now that R(A,B:) and S(A,B:) are two relations with r and s tuples, respectively
(again, not necessarily distinct). If m is the number of (not necessarily distinct) tuples in the
result of the SQL query: R intersect S; Then which of the following is the most restrictive,
correct condition on the value of m?

A. m = min(r,s)
B. 0 <= m <= r + s

C. min(r,s) <= m <= max(r,s)

D. 0 <= m <= min(r,s)

Answer: D

90)Which of the following is not a key? A. A B. E C. B, C D. D Answer: C 19. If a relation is in

BCNF, then it is also in

A. 1 NF B. 2 NF C. 3 NF D. All of the above

Answer: D

91) What action does ? operator perform in relational algebra

A. Output specified attributes from all rows of the input relation and remove duplicate tuples
from the output

B. Outputs pairs of rows from the two input relations that have the same value on all attributes
that have the same name

C. Output all pairs of rows from the two input relations (regardless of whether or not they have
the same values on common attributes)

D. Return rows of the input relation that satisfy the predicate

Answer: A

92) Statement 1: A tuple is a row in a relation

Statement 2: Existence of multiple foreign keys in a same relation is possible

A. Both the statements are true

B. Statement 1 is correct but Statement 2 is false

C. Statement 1 is false but Statement 2 is correct

D. Both the statements are false

Answer: A

93) The____condition allows a general predicate over the relations being joined.

A. On B. Using C. Set D. Where

Answer: A

94) 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

Answer: B

95)The normal form which satisfies multivalued dependencies and which is in BCNF is

A. 4 NF B. 3 NF C. 2 NF D. All of the mentioned

Answer: A

96) Which of the following is a tuple-generating dependencies?

A. Functional dependency B. Equality-generating dependencies

C. Multivalued dependencies D. Non-functional dependency

Answer: B

1. Collections of operations that form a single logical unit of work are called __________
a) Views
b) Networks
c) Units
d) Transactions

Answer: d
Explanation: Collections of operations that form a single logical unit of work are called
transactions. A database system must ensure proper execution of transactions.

2. The “all-or-none” property is commonly referred to as _________

a) Isolation
b) Durability
c) Atomicity
d) None of the mentioned

Answer: c
Explanation: The all or none policy is commonly referred to as atomicity. It ensures that a
work is either completed or not completed and there are no intermediate stages.

3. Which of the following is a property of transactions?

a) Atomicity
b) Durability
c) Isolation
d) All of the mentioned
Answer: d
Explanation: Atomicity, Durability and Isolation are all properties of transactions.

4. Execution of translation in isolation preserves the _________ of a database

a) Atomicity
b) Consistency
c) Durability
d) All of the mentioned

Answer: b
Explanation: Execution of translation in isolation preserves the consistency of a database. It
ensures that no other transaction is running concurrently.

5. Which of the following is not a property of a transaction?

a) Atomicity
b) Simplicity
c) Isolation
d) Durability

Answer: b
Explanation: Simplicity is not a property of a transaction. Atomicity, Isolation, Durability are
all parts of ACID properties.

6. Which of the following systems is responsible for ensuring durability?

a) Recovery system
b) Atomic system
c) Concurrency control system
d) Compiler system

Answer: a
Explanation: The recovery system is responsible for the maintenance of durability. In
addition, it also ensures atomicity.
7. Which of the following systems is responsible for ensuring isolation?
a) Recovery system
b) Atomic system
c) Concurrency control system
d) Compiler system

Answer: c
Explanation: The concurrency control system is responsible for ensuring isolation in a
database system.
8. State true or false: Information residing in the volatile storage does not usually survive
system crashes
a) True
b) False
Answer: a
Explanation: Information residing in the volatile storage does not usually survive system
crashes but the information in stable storage can survive system crashes efficiently.

9. A transaction that has not been completed successfully is called as _______

a) Compensating transaction
b) Aborted transaction
c) Active transaction
d) Partially committed transaction

Answer: b
Explanation: Aborted transaction is a state after the transaction has been rolled back and
the database has been restored to the state prior to the transaction.

10. Which of the following is not a transaction state?

a) Active
b) Partially committed
c) Failed
d) Compensated

Answer: d
Explanation: Compensated is not a transaction state. But active, partially committed and
failed are different states of a transaction.

11. The execution sequences in concurrency control are termed as ________

a) Serials
b) Schedules
c) Organizations
d) Time tables

Answer: b
Explanation: The execution sequences in concurrency control are known as schedules.
12. The scheme that controls the interaction between executing transactions is called as
_____
a) Concurrency control scheme
b) Multiprogramming scheme
c) Serialization scheme
d) Schedule scheme

Answer: a
Explanation: The scheme that controls the interaction between executing transactions is
called as concurrency control scheme.
This set of RDBMS Question Bank focuses on “Transaction Isolation Levels”.

1. Which of the following is a transaction isolation level as specified by SQL standard?

a) Serializable
b) Repeatable read
c) Read committed
d) All of the mentioned

Answer: a
Explanation: Serializable, repeatable read, read committed and read uncommitted are the
four levels of transactions.

2. State true or false: Serializable level may allow both serializable and non-serializable
executions
a) True
b) False

Answer: a
Explanation: Serializable level generally allows only serializable executions but in some
special cases, it may also allow non-serializable execution.

3. ________ allows only committed data to be read and further requires that no other
transaction is allowed to update it between two reads of a data item by a transaction.
a) Read uncommitted
b) Serializable
c) Repeatable read
d) Read committed

Answer: c
Explanation: Repeatable read allows only committed data to be read and further requires
that no other transaction is allowed to update it between two reads of a data item by a
transaction. However, the transaction may not be serializable with respect to other
transactions.

4. ________ allows only committed data to be read, but does not require repeatable reads
a) Read uncommitted
b) Serializable
c) Repeatable read
d) Read committed

Answer: d
Explanation: Read committed allows only committed data to be read, but does not require
repeatable reads. For instance, between two reads of a data item by the transaction,
another transaction may have updated the data item and committed.

5. ___________ allows uncommitted data to be read

a) Read uncommitted
b) Serializable
c) Repeatable read
d) Read committed

Answer: a
Explanation: Real uncommitted allows uncommitted data to be read. It is the lowest
isolation level allowed by SQL.
6. State true or false: All the isolation levels disallow dirty writes
a) True
b) False

Answer: a
Explanation: All the isolation levels above additionally disallow dirty writes, that is, they
Disallow writes to a data item that has already been written by another transaction that has
not yet committed or aborted.

7. When is a timestamp allotted

a) When execution begins
b) When execution is taking place
c) When execution is completed
d) None of the mentioned

Answer: a
Explanation: Timestamp is allotted when execution of a transaction begins.

8. In ___________ isolation each transaction is given its own version of the database
a) Timestamp
b) Snapshot
c) Lock based
d) All of the mentioned

Answer: b
Explanation: In snapshot isolation, each transaction is given its own version or snapshot of
the database on which it can operate.

9. What is the disadvantage of locking?

a) Does not control concurrency
b) Is not atomic
c) Is not durable
d) Has a poor degree of concurrency

Answer: Locking has a poor degree of concurrency. It in fact has no concurrency at all.

What is a view?
a) An brief description of the schema diagram.
b) A relation that is not a part of the schema but is a virtual relation
c) Any relation that is a part of the schema
d) A relation that is a part of the schema but which needs to be specified in every operation
made on that particular relation.

Answer: b
Explanation: A relation that is not a part of the schema but is a virtual relation is called as
view. Views improve writability as viewing the entire logical model is not feasible.

2. What is the command used to define view in SQL?

a) define view
b) new view
c) create view
d) none of the mentioned

Answer: c
Explanation: We use the create view command to define a view in SQL.
3. create view studentdet
select ID, address, name
from student;

What is the result of the above query?

a) It creates a view named studentdet with 3 attributes
b) It creates a view named studentdet with 1 attribute
c) It creates a view named ID with 2 attributes
d) It is syntactically wrong and does not give a result

Answer: d
Explanation: immediately after specifying the name of the view, we have to write the “as”
keyword. So this query does not give any result as it is syntactically incorrect.
4. State true or false: One view can be used in the expression defining another view
a) True
b) False

Answer: a
Explanation: One view can be used to define another view in its expression. This further
improves the writability of the code as we are reducing the entire logical model.

5. If the actual relations used in the view definition change, the view is updated immediately.
Such views are called _________
a) Instant views
b) Instantaneous views
c) Materialistic views
d) Materialized views

Answer: d
Explanation: If the actual relations used in the view definition change, the view is updated
immediately. Such views are called Materialized views. Materialized views help to keep the
database up-to-date.

6. The process of maintaining views up to date is called _________

a) View maintenance
b) View updating
c) View materialization
d) View isolation

Answer: a
Explanation: The process of maintaining views up to date is called View maintenance. View
maintenance can be done immediately when any of the views is updated.
7. How can we insert data into a view?
a) insert into ();
b) create data values ();
c) enter ();
d) insert into values ();

Answer: d
Explanation: We can insert data into a view using the inset into values (); statement. This
operation can be done only if the view is updatable.
8. State true or false: We can update a view if it has multiple database relations in the from
clause
a) True
b) False

Answer: b
Explanation: We can update a view only if it has a single database relation in the “from”
clause.
9. The _______ statement makes the updates performed by the transaction permanent.
a) Finalize work
b) Finish work
c) Commit work
d) None of the mentioned

Answer: c
Explanation: The Commit work statement makes the updates performed by the transaction
permanent. After a transaction is committed, a new transaction is automatically started.

10. The _______ statement causes the statements to undo all the updates performed on
the transaction
a) Undo work
b) Rollback work
c) Commit work
d) Replace work

Answer: b
Explanation: The Rollback work statement causes the statements to undo all the updates
performed on the transaction. The database is then restored to the state of what it was
before the first statement of the transaction was executed.

1.The activity of choosing an efficient execution strategy for processing a

query is called as
a) Query execution
b) Query optimization
c) Query plan evaluation
 d) Query parsing

Answer: (b) Query optimization

Query optimization is a process of choosing the cheapest and efficient of several equivalent
query execution plans by using the statistics about data. A query typically has many possible
execution strategies, and the process of choosing a suitable one for processing a query is known
as query optimization.

Why do we need to optimize the query?

As there are many equivalent transformations of the same high-level query, the aim of query
optimization is to choose the one that minimizes resource usage.

Need more clarity? Please read further.

A query which is written by the user may not be the efficient one. Also, the query written by
the user can be transformed into several equivalent (each one producing the same result)
expressions (queries).

The cost of processing each of these equivalent expressions is different. One may be costly and
the other may be cheap.

We do not expect users to write their queries so that they can be processed efficiently. Rather,
we expect the system to construct a query-evaluation plan that minimizes the cost of query
evaluation. This is where query optimization comes into play.

Query optimization is the process of selecting the most efficient query-evaluation plan from
among the many strategies usually possible for processing a given query, especially if the
query is complex.

Timestamp ordering protocol is said to be free from deadlock because of

this reason.
a) It is cascade free
b) It guarantees serializability
c) No transaction is made to wait
d) Every write operation updates the W-timestamp of the data item
Answer: (c) No transaction is made to wait

In timestamp ordering protocol, a transaction is either permitted to execute the operation or

rolled back. No transaction is made to wait for some other transaction. A transaction is
permitted to execute in all the following cases and rolled back otherwise;

A transaction T that tries to execute read(Q) operation will be permitted if and only if the
timestamp(T) >= W-timestamp(Q). That is, T is permitted to execute if it is started after a
successful write on Q by some transactions.

A transaction T that tries to execute write(Q) operation will be permitted if the timestamp(T)
is greater than both the R-timestamp(Q) and W-timestamp(Q). That is, T is permitted to write
a data item which was read/write by older transactions.

If a transaction is allowed to read a data item that was produced by an

uncommitted transaction, what do we call this read?
a) Repeatable read
b) Phantom read
c) Dirty read
d) Conflict read

Answer: (c) Dirty read

Reading the value of a data item that was produced by an uncommitted transaction is referred
as dirty read problem. This will be avoided if we permit transactions to read the values that
are produced by committed transactions.

Possible problems with dirty read in database

• It may result in non-recoverable schedule. This is possible if a transaction T1 consumes

the data written by T2 but commits before T2, and T2 decided to rollback.
• It may lead to cascading rollback. This situation is possible if a transaction T3
consumes the data written by T2 which in turn read the data from another transaction T1, and
T1 decided to rollback.
• A dirt read can cause duplicate rows to be returned where none exist. alternatively, a
dirty read can cause no rows to be returned when one (or more) exists. In some cases, dirty
reads can return data that was never in the database at all (eg. rolled back before commit).
How you may avoid dirty read?

You can set the TRANSACTION ISOLATION LEVEL as READ COMMITTED. This specifies
that the statements cannot read data that has been modified but not committed by other
transaction. This prevents dirty reads.

Consider the transaction T1 as given below; T1 enters into which of the

following states if there is a system crash after the instruction 5?
T1

1 Begin_transaction

2 Read(A)

3 A:=A-500;

4 Write(A);

5 Read(B)

6 B:=B+500;

7 Write(B);

8 Commit;

a) Partially committed
b) Committed
c) Aborted
d) Failed

Answer: (d) Failed

A transaction enters into FAILED state if the transaction cannot be committed or the
transaction is aborted while in the ACTIVE state, perhaps due to the user aborting the
transaction or as a result of system failures (system crash, transaction errors, disk failures
etc.) or as a result of the concurrency control protocol aborting the transaction to ensure
serializability.

The transaction at FAILED state is rolled back to undo the changes made to the data
items and ABORTED.

Transaction states

Active - if a transaction starts its execution it is said to be in active state

Partially committed - if a transaction successfully executed it last statement

Committed - if a transaction successfully executed commit statement.

Failed - if a transaction is not able to proceed for various reasons (refer above)

Aborted - if a transaction reached a failed state, then it will be aborted.

1. Consider the transaction T1 as given below; T1 enters from which of the

transaction states into which other state if there is a failure after executing
the instruction 7?
T1

1 Begin_transaction

2 Read(A)

3 A:=A-500;

4 Write(A);

5 Read(B)

6 B:=B+500;

7 Write(B);

8 Commit;
 a) Active, Partially committed
b) Partially committed, Committed
c) Active, Failed
d) Partially committed, Failed

Answer: (d) Partially committed, Failed

A transaction is said to be in PARTIALLY COMMITTED state if it has successfully executed

all the instructions in it.

At this point, it may be found that the transaction has stopped due to system failure and any
updates made to the data items by the transaction may not have been safely recorded on
secondary storage. Or the transaction might have violated serializability or an integrity
constraint and the transaction has to be aborted. In such cases, the transaction would go into
the FAILED state.

The transaction at FAILED state is rolled back to undo the changes made to the data items
and ABORTED.

Transaction states

Active - if a transaction starts its execution it is said to be in active state

Partially committed - if a transaction successfully executed it last statement

Committed - if a transaction successfully executed commit statement.

Failed - if a transaction is not able to proceed for various reasons (refer above)

Aborted - if a transaction reached a failed state, then it will be aborted.

Transaction-processing systems usually allow multiple transactions to run

concurrently. Which of the following best suits as the advantage(s) of
allowing concurrent execution of transactions?
a) Improved transaction throughput
b) Reduced execution complexity
c) Serializability
 d) Reduced waiting time

Answer: (a) Improved transaction throughput and (d) Reduced waiting time

Improved transaction throughput - Permitting multiple transactions to execute in parallel

will increase the number of transaction executed. The parallelism of the CPU and the IO
system can be used to handle concurrent execution of transactions.

Reduced waiting time – the short transaction need not wait for the longer ones to complete if
they are permitted to execute concurrently.

Concurrent execution reduces the unpredictable delays in running transactions. Moreover, it

also reduces the average response time: the average time for a transaction to be completed after
it has been submitted.

How would we improve the transaction throughput?

By permitting multiple transactions to work in parallel.

What is transaction throughput?

Number of transactions executed per second

How do we reduce waiting time of smaller transactions?

When we permit multiple transactions to work simultaneously, smaller transactions need not
wait for the longer one to finish. [Smaller transactions may have to wait for longer one to
finish if we permit them to execute serially, ie, one after the other]

To ensure integrity of the data, a database system should ensure transactions

to possess certain properties. The property which make sure that the partial
effects of incomplete transactions should not visible to the other transactions
is called
a) Atomicity
b) Consistency
c) Isolation
d) Durability

Answer: (c) Isolation

Isolation property is one of ACID properties that a transaction should possess. It
ensures that the changed made by a transaction should not be visible to other
concurrent transactions. It means that the data used during the execution of a
transaction cannot be used by a second transaction until the first one is completed.

ACID properties are the desirable properties that any transaction should possess in a
relational database management system. These properties help in safeguarding the
integrity of the data.

ACID properties should be enforced by concurrency control methodologies.

To ensure integrity of the data, a database system should ensure transactions

to possess certain properties. The property that makes sure that “either all
instructions executed successfully or none of them are” is called
a) Atomicity
b) Consistency
c) Isolation
d) Durability

Answer: (a) Atomicity

While executing a transaction, the most desirable property is to execute all the instructions of
the given transaction or execute none (if executed few, roll them back). This property helps to
avoid inconsistencies caused by an incomplete transaction. Atomicity is the property which
ensures this.

ACID properties are the desirable properties that any transaction should possess in a
relational database management system. These properties help in safeguarding the integrity
of the data.

ACID properties should be enforced by concurrency control methodologies.

Which of the following concurrency control protocol can avoid cascading

rollback?
a) Simple 2 Phase Locking protocol
b) Strict 2 Phase Locking protocol
c) Rigorous 2 Phase Locking protocol
d) Timestamp ordering protocol
Answer: (b) Strict 2 Phase Locking protocol and (c) Rigorous 2 Phase Locking protocol

Transactions that use either strict or rigorous 2PL protocols delay releasing the EXCLUSIVE
locks on their data items until the transaction commits. Hence, other
concurrent transactions cannot consume the data items that were modified by
the transactions under strict or rigorous 2PL until the later release the locks.

What is cascading rollback and how is it caused?

If a transaction consumes the data item that was written by an uncommitted

transaction, it may lead to cascading rollback, in case if the uncommitted transaction
is decided to abort.

Example: Suppose T1 and T2 are two concurrent transactions. If T1 writes a data item A and
T1 not yet committed. Now, T2 reads the value of A which was just modified by T1. This is
uncommitted read / dirty read. At this time, if for some reason T1 decides to rollback or abort.
This forces T2 to rollback because, T2 used the data produced by T1.

1. Consider the transactions T1 and T2 that are executing concurrently as

given below. Which of the following isolation levels can permit such
concurrently executing interleaved transactions to proceed?

T1 T2

Begin_transaction

Begin_transaction

Read(A)

Read(A)

Read(B)

Read(B)
 Commit;

Commit;

a) Serializable
b) Repeatable read
c) Read committed
d) All of the above

Answer: (d) All of the above

The given schedule consists of transactions that are read-only. Hence, the above sequence of
operations can occur at all levels of isolation since the transactions only read data without
writing.

If all transactions are read-only transactions in a schedule, then that schedule is a

serializable schedule.

What is dirty read?

Dirty read is the one where a transaction consumes a data item that was updated by
another ongoing not-yet-committed transaction. In this question, no WRITE
operation is involved.

In the question, the schedule does not have any WRITE operations. So, dirty reads are not
possible. For this reason, SERIALIZABLE, REPEATABLE READ and READ COMMITTED
isolation levels permit the given schedule.

1. In order to maintain transactional integrity and database consistency, what technology

does a DBMS deploy?
a) Triggers
b) Pointers
c) Locks
d) Cursors
View Answer
Answer: c
Explanation: Locks are used to maintain database consistency.

2. A lock that allows concurrent transactions to access different rows of the same table is
known as a
a) Database-level lock
b) Table-level lock
c) Page-level lock
d) Row-level lock
View Answer
Answer: d
Explanation: Locks are used to maintain database consistency.

3. Which of the following are introduced to reduce the overheads caused by the log-based
recovery?
a) Checkpoints
b) Indices
c) Deadlocks
d) Locks
View Answer
Answer: a
Explanation: Checkpoints are introduced to reduce overheads caused by the log-based
recovery.
4. Which of the following protocols ensures conflict serializability and safety from
deadlocks?
a) Two-phase locking protocol
b) Time-stamp ordering protocol
c) Graph based protocol
d) None of the mentioned
View Answer
Answer: b
Explanation: Time-stamp ordering protocol ensures conflict serializability and safety from
deadlocks.

5. Which of the following is the block that is not permitted to be written back to the disk?
a) Dead code
b) Read only
c) Pinned
d) Zapped
View Answer
Answer: c
Explanation: A block that is not permitted to be written back to the disk is called pinned.

6. If transaction Ti gets an explicit lock on the file Fc in exclusive mode, then it has an -
__________ on all the records belonging to that file.
a) Explicit lock in exclusive mode
b) Implicit lock in shared mode
c) Explicit lock in shared mode
d) Implicit lock in exclusive mode
View Answer
Answer: d
Explanation: If transaction Ti gets an explicit lock on the file Fc in exclusive mode, then it
has an implicit lock in exclusive mode on all the records belonging to that file.
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
View Answer
Answer: a
Explanation: Concurrency is a property of systems in which several computations are
executing simultaneously, and potentially interacting with each other.

8. All lock information is managed by a __________ which is responsible for assigning and
policing the locks used by the transactions.
a) Scheduler
b) DBMS
c) Lock manager
d) Locking agent
View Answer
Answer: c
Explanation: A distributed lock manager (DLM) provides distributed software applications
with a means to synchronize their accesses to shared resources.

9. The ____ lock allows concurrent transactions to access the same row as long as they
require the use of different fields within that row.
a) Table-level
b) Page-level
c) Row-level
d) Field-level
View Answer
Answer: d
Explanation: Lock is limited to the attributes of the relation.
10. Which of the following is a procedure for acquiring the necessary locks for a transaction
where all necessary locks are acquired before any are released?
a) Record controller
b) Exclusive lock
c) Authorization rule
d) Two phase lock
View Answer
Answer: d
Explanation: Two-phase lock is a procedure for acquiring the necessary locks for a
transaction where all necessary locks are acquired before any are released.

. A system is in a ______ state if there exists a set of transactions such that every
transaction in the set is waiting for another transaction in the set.
a) Idle
b) Waiting
c) Deadlock
d) Ready
View Answer
Answer: c
Explanation: When one data item is waiting for another data item in a transaction then
system is in deadlock.

2. The deadlock state can be changed back to stable state by using _____________
statement.
a) Commit
b) Rollback
c) Savepoint
d) Deadlock
View Answer
Answer: b
Explanation: Rollback is used to rollback to the point before lock is obtained.

3. What are the ways of dealing with deadlock?

a) Deadlock prevention
b) Deadlock recovery
c) Deadlock detection
d) All of the mentioned
View Answer
Answer: d
Explanation: Deadlock prevention is also called as deadlock recovery. Prevention is
commonly used if the probability that the system would enter a deadlock state is relatively
high; otherwise, detection and recovery are more efficient.

Note: Join free Sanfoundry classes at Telegram or Youtube

advertisement

4. When transaction Ti requests a data item currently held by Tj, Ti is allowed to wait only if
it has a timestamp smaller than that of Tj (that is, Ti is older than Tj). Otherwise, Ti is rolled
back (dies). This is
a) Wait-die
b) Wait-wound
c) Wound-wait
d) Wait
View Answer
Answer: a
Explanation: The wait–die scheme is a non-preemptive technique.

5. When transaction Ti requests a data item currently held by Tj, Ti is allowed to wait only if
it has a timestamp larger than that of Tj (that is, Ti is younger than Tj ). Otherwise, Tj is
rolled back (Tj is wounded by Ti). This is
a) Wait-die
b) Wait-wound
c) Wound-wait
d) Wait
View Answer
Answer: c
Explanation: The wound–wait scheme is a preemptive technique. It is a counterpart to the
wait–die scheme.

Take Database Management System Mock Tests - Chapterwise!

Start the Test Now: Chapter 1, 2, 3, 4, 5, 6, 7, 8, 9, 10

6. The situation where the lock waits only for a specified amount of time for another lock to
be released is
a) Lock timeout
b) Wait-wound
c) Timeout
d) Wait
View Answer
Answer: a
Explanation: The timeout scheme is particularly easy to implement, and works well if
transactions are short and if longwaits are likely to be due to deadlocks.
7. The deadlock in a set of a transaction can be determined by
a) Read-only graph
b) Wait graph
c) Wait-for graph
d) All of the mentioned
View Answer
Answer: a
Explanation: Each transaction involved in the cycle is said to be deadlocked.

8. A deadlock exists in the system if and only if the wait-for graph contains a ___________
a) Cycle
b) Direction
c) Bi-direction
d) Rotation
View Answer
Answer: a
Explanation: Each transaction involved in the cycle is said to be deadlocked.
9. Selecting the victim to be rollbacked to the previous state is determined by the minimum
cost. The factors determining cost of rollback is
a) How long the transaction has computed, and how much longer the transaction will
compute before it completes its designated task
b) How many data items the transaction has used
c) How many more data items the transaction needs for it to complete
d) All of the mentioned
View Answer
Answer: d
Explanation: We should roll back those transactions that will incur the minimum cost.
10. __________ rollback requires the system to maintain additional information about the
state of all the running transactions.
a) Total
b) Partial
c) Time
d) Commit
View Answer
Answer: b
Explanation: In total rollback abort the transaction and then restart it.

1. In a granularity hierarchy the highest level represents the

a) Entire database
b) Area
c) File
d) Record
View Answer
Answer: a
Explanation: This level is the root of the tree.

2. In a database the file is contained in ________

a) Entire database
b) Two area
c) One area
d) more than one area
View Answer
Answer: c
Explanation: This level is below the root of the tree.

3. If a node is locked in an intention mode, explicit locking is done at a lower level of the
tree. This is called
a) Intention lock modes
b) Explicit lock
c) Implicit lock
d) Exclusive lock
View Answer
Answer: a
Explanation: There is an intention mode associated with shared mode, and there is one with
an exclusive mode.

Subscribe Now: DBMS Newsletter | Important Subjects Newsletters

advertisement

4. If a node is locked in __________ explicit locking is being done at a lower level of the
tree, but with only shared-mode locks.
a) Intention lock modes
b) Intention-shared-exclusive mode
c) Intention-exclusive (IX) mode
d) Intention-shared (IS) mode
View Answer
Answer: a
Explanation: There is an intention mode associated with shared mode, and there is one with
an exclusive mode.
5. If a node is locked in ____________ then explicit locking is being done at a lower level,
with exclusive-mode or shared-mode locks.
a) Intention lock modes
b) Intention-shared-exclusive mode
c) Intention-exclusive (IX) mode
d) Intention-shared (IS) mode
View Answer
Answer: c
Explanation: There is an intention mode associated with shared mode, and there is one with
an exclusive mode.

Get Free Certificate of Merit in Database Management System Now!

6. If a node is locked in ______________ the subtree rooted by that node is locked explicitly
in shared mode, and that explicit locking is being done at a lower level with exclusive-mode
locks.
a) Intention lock modes
b) shared and intention-exclusive (SIX) mode
c) Intention-exclusive (IX) mode
d) Intention-shared (IS) mode
View Answer
Answer: b
Explanation: There is an intention mode associated with shared mode, and there is one with
an exclusive mode.

7. ____________ denotes the largest timestamp of any transaction that executed write(Q)
successfully.
a) W-timestamp(Q)
b) R-timestamp(Q)
c) RW-timestamp(Q)
d) WR-timestamp(Q)
View Answer
Answer: a
Explanation: The most common method for doing ordering transaction is to use a
timestamp-ordering scheme.
8. The _____________ ensures that any conflicting read and write operations are executed
in timestamp order.
a) Timestamp-ordering protocol
b) Timestamp protocol
c) W-timestamp
d) R-timestamp
View Answer
Answer: a
Explanation: The most common method for doing ordering transaction is to use a
timestamp-ordering scheme.

9. The __________ requires that each transaction Ti executes in two or three different
phases in its lifetime, depending on whether it is a read-only or an update transaction.
a) Validation protocol
b) Validation-based protocol
c) Timestamp protocol
d) Timestamp-ordering protocol
View Answer
Answer: a
Explanation: A concurrency-control scheme imposes the overhead of code execution and
possible delay of transactions. It may be better to use an alternative scheme that imposes
less overhead.

10. This validation scheme is called the _________ scheme since transactions execute
optimistically, assuming they will be able to finish execution and validate at the end.
a) Validation protocol
b) Validation-based protocol
c) Timestamp protocol
d) Optimistic concurrency-control
View Answer
Answer: a
Explanation: A concurrency-control scheme imposes the overhead of code execution and
possible delay of transactions. It may be better to use an alternative scheme that imposes
less overhead.

. The most recent version of standard SQL prescribed by the American National Standards
Institute is
a) SQL 2016
b) SQL 2002
c) SQL – 4
d) SQL2
View Answer
Answer: a
Explanation: SQL-2016 is the most recent version of standard SQL prescribed by the ANSI.
2. ANSI-standard SQL allows the use of special operators in conjunction with the WHERE
clause. A special operator used to check whether an attribute value is null is
a) BETWEEN
b) IS NULL
c) LIKE
d) IN
View Answer
Answer: b
Explanation: Exists is used to check whether an attribute value is null or not in conjunction
with the where clause.

3. A lock that prevents the use of any tables in the database from one transaction while
another transaction is being processed is called a
a) Database-level lock
b) Table-level lock
c) Page-level lock
d) Row-level lock
View Answer
Answer: a
Explanation: Data base-level lock prevents the use of any tables in the data base from one
transaction while another transaction is being processed.

Subscribe Now: DBMS Newsletter | Important Subjects Newsletters

advertisement

4. A condition that occurs when two transactions wait for each other to unlock data is known
as a(n)
a) Shared lock
b) Exclusive lock
c) Binary lock
d) Deadlock
View Answer
Answer: d
Explanation: Deadlock occurs when two transactions wait for each other to unlock data.

5. _______ means that data used during the execution of a transaction cannot be used by a
second transaction until the first one is completed.
a) Serializability
b) Atomicity
c) Isolation
d) Time stamping
View Answer
Answer: c
Explanation: Isolation means that data used during the execution of a transaction can’t be
used by a second transaction until the first one is completed.

Become Top Ranker in Database Management System Now!

6. A unit of storage that can store one or more records in a hash file organization is denoted
as
a) Buckets
b) Disk pages
c) Blocks
d) Nodes
View Answer
Answer: a
Explanation: Buckets are used to store one or more records in a hash file organization.

7. The file organization which allows us to read records that would satisfy the join condition
by using one block read is
a) Heap file organization
b) Sequential file organization
c) Clustering file organization
d) Hash files organization
View Answer
Answer: c
Explanation: Clustering file organization allows us to read records that would satisfy the join
condition by using one block read.

8. Which of the following is not true about B+ trees?

a) B+ tree index takes the form of balanced tree
b) Performance of B+ tree degrades as the file grows
c) Look-up in B+ tree is straightforward and efficient
d) Insertion and deletion in B+ tree is complicated but efficient
View Answer
Answer: b
Explanation: The answer is evident.

9. The extent of the database resource that is included with each lock is called the level of
a) Impact
b) Granularity
c) Management
d) DBMS control
View Answer
Answer: b
Explanation: The extent of the data base resource that is included with each lock is called
the level of Granularity.

10. DBMS periodically suspends all processing and synchronizes its files and journals
through the use of
a) Checkpoint facility
b) Backup facility
c) Recovery manager
d) Database change log
View Answer
Answer: a
Explanation: DBMS periodically suspends all processing and synchronizes its files and
journals through the use of Check point facility.

1. The recovery scheme must also provide

a) High availability
b) Low availability
c) High reliability
d) High durability
View Answer
Answer: a
Explanation: It must minimize the time for which the database is not usable after a failure.
2. Which one of the following is a failure to a system
a) Boot crash
b) Read failure
c) Transaction failure
d) All of the mentioned
View Answer
Answer: c
Explanation: Types of system failure are transaction failure, system crash and disk failure.

3. Which of the following belongs to transaction failure

a) Read error
b) Boot error
c) Logical error
d) All of the mentioned
View Answer
Answer: c
Explanation: Types of system transaction failure are logical and system error.

Note: Join free Sanfoundry classes at Telegram or Youtube

advertisement

4. The system has entered an undesirable state (for example, deadlock), as a result of
which a transaction cannot continue with its normal execution. This is
a) Read error
b) Boot error
c) Logical error
d) System error
View Answer
Answer: c
Explanation: The transaction, can be re-executed at a later time.

5. The transaction can no longer continue with its normal execution because of some
internal condition, such as bad input, data not found, overflow, or resource limit exceeded.
This is
a) Read error
b) Boot error
c) Logical error
d) System error
View Answer
Answer: c
Explanation: The transaction, can be re-executed at a later time.

Take Database Management System Tests Now!

6. The assumption that hardware errors and bugs in the software bring the system to a halt,
but do not corrupt the nonvolatile storage contents, is known as the
a) Stop assumption
b) Fail assumption
c) Halt assumption
d) Fail-stop assumption
View Answer
Answer: d
Explanation: Well-designed systems have numerous internal checks, at the hardware and
the software level, that bring the system to a halt when there is an error. Hence, the fail-stop
assumption is a reasonable one.
7. Which kind of failure loses its data in head crash or failure during a transfer operation.
a) Transaction failure
b) System crash
c) Disk failure
d) All of the mentioned
View Answer
Answer: c
Explanation: Copies of the data on other disks, or archival backups on tertiary media, such
as DVD or tapes, are used to recover from the failure.

8. The failure occurred sufficiently early during the transfer that the destination block
remains intact.
a) Partial Failure
b) Total failure
c) Successful completion
d) Data transfer failure
View Answer
Answer: a
Explanation: Copies of the data on other disks, or archival backups on tertiary media, such
as DVD or tapes, are used to recover from the failure.
9. The database is partitioned into fixed-length storage units called
a) Parts
b) Blocks
c) Reads
d) Build
View Answer
Answer: b
Explanation: Blocks are the units of data transfer to and from disk, and may contain several
data items.
10. Which of the following causes system to crash
a) Bug in software
b) Loss of volatile data
c) Hardware malfunction
d) All of the mentioned
View Answer
Answer: d
Explanation: The content of non-volatile storage remains intact, and is not corrupted.
1. The log is a sequence of _________ recording all the update activities in the database.
a) Log records
b) Records
c) Entries
d) Redo
View Answer
Answer: a
Explanation: The most widely used structure for recording database modifications is the log.
2. In the ___________ scheme, a transaction that wants to update the database first
creates a complete copy of the database.
a) Shadow copy
b) Shadow Paging
c) Update log records
d) All of the mentioned
View Answer
Answer: a
Explanation: If at any point the transaction has to be aborted, the system merely deletes the
new copy. The old copy of the database has not been affected.

3. 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) Update log records
d) All of the mentioned
View Answer
Answer: b
Explanation: Any page which is not updated by a transaction is not copied, but instead the
new page table just stores a pointer to the original page.

Subscribe Now: DBMS Newsletter | Important Subjects Newsletters

advertisement

4. The current copy of the database is identified by a pointer, called ____________ which is
stored on disk.
a) Db-pointer
b) Update log
c) Update log records
d) All of the mentioned
View Answer
Answer: a
Explanation: Any page which is not updated by a transaction is not copied, but instead the
new page table just stores a pointer to the original page.
5. If a transaction does not modify the database until it has committed, it is said to use the
___________ technique.
a) Deferred-modification
b) Late-modification
c) Immediate-modification
d) Undo
View Answer
Answer: a
Explanation: Deferred modification has the overhead that transactions need to make local
copies of all updated data items; further, if a transaction reads a data item that it has
updated, it must read the value from its local copy.

Get Free Certificate of Merit in Database Management System Now!

6. If database modifications occur while the transaction is still active, the transaction is said
to use the ___________technique.
a) Deferred-modification
b) Late-modification
c) Immediate-modification
d) Undo
View Answer
Answer: c
Explanation: We say a transaction modifies the database if it performs an update on a disk
buffer, or on the disk itself; updates to the private part of main memory do not count as
database modifications.

7. ____________ using a log record sets the data item specified in the log record to the old
value.
a) Deferred-modification
b) Late-modification
c) Immediate-modification
d) Undo
View Answer
Answer: d
Explanation: Undo brings the previous contents.

8. In the __________ phase, the system replays updates of all transactions by scanning the
log forward from the last checkpoint.
a) Repeating
b) Redo
c) Replay
d) Undo
View Answer
Answer: b
Explanation: Undo brings the previous contents.
9. The actions which are played in the order while recording it is called ______________
history.
a) Repeating
b) Redo
c) Replay
d) Undo
View Answer
Answer: a
Explanation: Undo brings the previous contents.

10. A special redo-only log record < Ti, Xj, V1> is written to the log, where V1 is the value
being restored to data item Xj during the rollback. These log records are sometimes called
a) Log records
b) Records
c) Compensation log records
d) Compensation redo records
View Answer
Answer: c
Explanation: Such records do not need undo information since we never need to undo such
an undo operation.

In order to reduce the overhead in retrieving the records from the storage space we use
a) Logs
b) Log buffer
c) Medieval space
d) Lower records
View Answer

Answer: b
Explanation: The output to stable storage is in units of blocks.

This set of Database Multiple Choice Questions & Answers (MCQs) focuses on
“Buffer Management”.

1. In order to reduce the overhead in retrieving the records from the storage space we
use
a) Logs
b) Log buffer
c) Medieval space
d) Lower records
View Answer

Answer: b
Explanation: The output to stable storage is in units of blocks.

2. The order of log records in the stable storage ____________ as the order in which
they were written to the log buffer.
a) Must be exactly the same
b) Can be different
c) Is opposite
d) Can be partially same
View Answer

Answer: a
Explanation: As a result of log buffering, a log record may reside in only main
memory (volatile storage) for a considerable time before it is output to stable
storage.

3. Before a block of data in main memory can be output to the database, all log
records pertaining to data in that block must have been output to stable storage. This is
a) Read-write logging
b) Read-ahead logging
c) Write-ahead logging
d) None of the mentioned
View Answer

Answer: c
Explanation: The WAL rule requires only that the undo information in the log has
been output to stable storage, and it permits the redo information to be written
later.

4. Writing the buffered log to __________ is sometimes referred to as a log force.

a) Memory
b) Backup
c) Redo memory
d) Disk
View Answer

Answer: d
Explanation: If there are insufficient log records to fill the block, all log records in
main memory are combined into a partially full block and are output to stable
storage.

5. The _______________ policy, allows a transaction to commit even if it has

modified some blocks that have not yet been written back to disk.
a) Force
b) No-force
c) Steal
d) No-steal
View Answer

Answer: b
Explanation: No-force policy allows faster commit of transactions.
6. ______________ policy allows multiple updates to accumulate on a block before it
is output to stable storage, which can reduce the number of output operations greatly
for frequently updated blocks.
a) Force
b) No-force
c) Steal
d) No-steal
View Answer

Answer: b
Explanation: No-force policy allows faster commit of transactions.

7. The ___________ policy, allows the system to write modified blocks to disk even if
the transactions that made those modifications have not all committed.
a) Force
b) No-force
c) Steal
d) No-steal
View Answer

Answer: c
Explanation: The no-steal policy does not work with transactions that perform a large
number of updates.

8. Locks on buffer blocks are unrelated to locks used for concurrency-control of

transactions, and releasing them in a non-two-phase manner does not have any
implications on transaction serializability. This is
a) Latches
b) Swap Space
c) Dirty Block
d) None of the mentioned
View Answer

Answer: a
Explanation: These locks, and other similar locks that are held for a short duration.

9. The __________________ contains a list of blocks that have been updated in the
database buffer.
a) Latches
b) Swap Space
c) Dirty Block
d) None of the mentioned
View Answer

Answer: c
Explanation: Dirty blocks are those that have been updated in memory, and the disk
version is not up-to-date.

10. The operating system reserves space on disk for storing virtual-memory pages that
are not currently in main memory; this space is called
a) Latches
b) Swap Space
c) Dirty Block
d) None of the mentioned
View Answer

Answer: b
Explanation: Almost all current-generation operating systems retain complete
control of virtual memory.

Which of the following refers to the problem of finding abstracted patterns (or structures) in
the unlabeled data?

a. Supervised learning
b. Unsupervised learning
c. Hybrid learning
d. Reinforcement learning

Hide Answer Workspace

Answer: b

Explanation: Unsupervised learning is a type of machine learning algorithm that is

generally used to find the hidden structured and patterns in the given unlabeled data.

2) Which one of the following refers to querying the unstructured textual data?
a. Information access
b. Information update
c. Information retrieval
d. Information manipulation

Show Answer Workspace

3) Which of the following can be considered as the correct process of Data Mining?

a. Infrastructure, Exploration, Analysis, Interpretation, Exploitation

b. Exploration, Infrastructure, Analysis, Interpretation, Exploitation
c. Exploration, Infrastructure, Interpretation, Analysis, Exploitation
d. Exploration, Infrastructure, Analysis, Exploitation, Interpretation

Hide Answer Workspace

Answer: a

Explanation: The process of data mining contains many sub-processes in a specific order.
The correct order in which all sub-processes of data mining executes is Infrastructure,
Exploration, Analysis, Interpretation, and Exploitation.

4) Which of the following is an essential process in which the intelligent methods are applied
to extract data patterns?

a. Warehousing
b. Data Mining
c. Text Mining
d. Data Selection

Hide Answer Workspace

Answer: b
Explanation: Data mining is a type of process in which several intelligent methods are
used to extract meaningful data from the huge collection ( or set) of data.

5) What is KDD in data mining?

a)Knowledge Discovery Database b)Knowledge Discovery Data

c)Knowledge Data definition d)Knowledge data house

Hide Answer Workspace

Answer: a

Explanation: The term KDD or Knowledge Discovery Database is refers to a broad process
of discovering the knowledge in the data and emphasizes the high-level applications of
specific Data Mining techniques as well.

) Which of the following is not a recovery technique?

A. Deferred update
B. Immediate update
C. Two-phase commit
D. Recovery management

2) Checkpoints are a part of

A. Recovery measures
B. Security measures
C. Concurrency measures
D. Authorization measures

3) ……. deals with soft errors, such as power failures.

A. system recovery
B. media recovery
C. database recovery
D. failure recovery

4) ……….. is an essential part of any backup system.

A. Filter
B. Recovery
C. Security
D. Scalability
5) Media recovery deals with ………..
A. disk errors
B. hard errors
C. system errors
D. power failures
6) For a backup/restore system, …………. is a prerequisite for service in a enterprise.
A. Filter
B. Recovery
C. Security
D. Scalability

7) Failure recovery and media recovery fall under ……..

A. transaction recovery
B. database recovery
C. system recovery
D. value recovery

8) The ………. consists of the various applications and database that play a role in a backup and
recovery strategy.
A. Recovery Manager environment
B. Recovery Manager suit
C. Recovery Manager file
D. Recovery Manager database

9) In which the database can be restored up to the last consistent state after the system
failure?
A. Backup
B. Recovery
C. Both
D. None

10) A ……….. is a block of Recovery Manager(RMAN) job commands that is stored in the
recovery catalog.
A. recovery procedure
B. recovery block
C. stored block
D. stored script

Table of Contents
READ ALSO: MCQ ON DISTRIBUTED DATABASE TRANSACTION
MANAGEMENT
11) In log based recovery, the log is sequence of ………
A. filter
B. records
C. blocks
D. numbers

12) The enrolling of a database in a recovery catalogue is called ………

A. set up
B. registration
C. start up
D. enrollment

13) ………. is an alternative of log based recovery.

A. Disk recovery
B. Shadow paging
C. Dish shadowing
D. Crash recovery

14) Most backup and recovery commands in ……….. are executed by server sessions.
A. Backup Manager
B. Recovery Manager
C. Backup and Recovery Manager
D. Database Manager

15) …….. systems typically allows to replace failed disks without stopping access to the system.
A. RAM
B. RMAN
C. RAD
D. RAID

16) An ……… is an exact copy of a single data-file, archived redo log file, or control file.
A. image copy
B. data file copy
C. copy log
D. control copy

17) ………. known as memory-style error correcting-code(ECC) organization, employs parity

bits.
A. RAID level 1
B. RAID level 2
C. RAID level 3
D. RAID level 4

18) The remote backup site is sometimes called the ………. site.
A. primary
B. secondary
C. ternary
D. None of the above

19) EXP command is used ………..

A. to take Backup of the Oracle Database
B. to import data from the exported dump file
C. to create Rollback segments
D. to create Schedule.

20) The simplest approach to introducing redundancy is to duplicate every disk is called …..
A. mirroring
B. imaging
C. copying
D. All of the above

ANSWERS:
1) C. Two-phase commit
2) A. Recovery measures
3) D. failure recovery
4) C. Security
5) A. disk errors
6) D. Scalability
7) C. system recovery
8) A. Recovery Manager environment
9) B. Recovery
10) D. stored script
11) B. records
12) B. registration
13) B. Shadow paging
14) B. Recovery Manager
15) D. RAID
16) A. image copy
17) B. RAID level 2
18) B. secondary
19) A. to take Backup of the Oracle Database
20) A. mirroring
 DBMS Question Bank
Sr. No Question Answer

ROLLBACK in a database is ____ statement.

(A) DDL

(B) DML

(C) DCL

1 (D) TCL D

In a relational model, relations are termed as

(A) Rows

(B) Tables

(C) Attributes

2 (D) Tuples B

Which of the following is a procedural language?

(A) Relational algebra

(B) Query language

(C) Tuple relational calculus

3 (D) Domain relational calculus A

Which of the following types of tables constraints will prevent the entry of
duplicate rows?

(A) Primary keys

(B) Foreign keys

(C) Unique keys

4 A

In an E-R diagrams, ellipses represents

(A) Attributes

(B) Link between attributes and entity sets

(C) Relation among entity set

5 (D) Entity set A

 In a relational modes, a cardinality is termed as

(A) Number of constraints

(B) Number of tables

(C) Number of attributes

6 (D) Number of tuples D

Which of the following is not a type of database?

(A) Relational

(B) Hierarchical

(C) Network

7 (D) Transition D

The most commonly used operation in relational algebra for projecting a set
of tuple from a relation is

(A) Union

(B) Select

(C) Projection

8 (D)
TheJoin
_____ operation allows the combining of two relations by merging pairs B
of tubles, one from each relation, into a single tuple.

(A) Intersection

(B) Union
9 C
A _____ is an abstract model that describes how the data are organised and
represented.

(A) Database

(B) Schema

(C) Instances

10 (D) Data model D

 Which of the following is a set of one or more attributes taken collectively to
uniquely identify a record?

(A) Foreign key

(B) Super key

(C) Sub key

11 (D) Candidate key B

The ____ provides a set of operations that take one or more relations as input
and return a relation as an output.

(A) Relation flow

(B) Scheme diagram

(C) Relational algebra

12 (D) Schematic representation C

Where will we find the referential integrity command?

(A) Table

(B) Tools

(C) Format

13 (D) None of these D

____ represents raw facts, whereas ___ is data made meaningful.

(A) Data, information

(B) Information, reporting

(C) Information, bits

14 (D) Records, bytes A

When data changes in multiple lists and all lists are not updated, this causes

(A) Data redundancy

(B) Data inconsistency

(C) Duplicate data

15 (D) Information overload B

Which of the following is a Data Model?

(A) Entity-Relationship model
(B) Relational data model
(C) Object-Based data model
16 (D) All of the above D
 Snapshot of the data in the database at a given instant of time is called
(A) Database Schema
(B) Database Instance
(C) Database Snapshot
17 (D) All of the above B

A functional dependency between two or more non-key attributes is called

(A) Transitive dependency
(B) Partial transitive dependency
(C) Functional dependency
18 (D) Partial functional dependency A

The Primary key must be

(A) Non Null
(B) Unique
(C) Option A or B
19 (D) Option A and B C
In SQL, which of the following is not a data Manipulation Language
Commands?
(A) DELETE
(B) SELECT
(C) UPDATE
20 (D) CREATE D

A transaction completes its execution is said to be

(A) Saved
(B) Loaded
(C) Rolled
21 (D) Committed D

Which of the following is not a Schema?

(A) Database Schema
(B) Physical Schema
(C) Critical Schema
22 (D) Logical Schema C

Who proposed the relational model?

(A) Bill Gates
(B) E.F. Codd
(C) Herman Hollerith
23 (D) Charles Babbage B

The index consists of

(A) A list of keys
(B) Pointers to the master list
(C) Both (a) and (b)
24 (D) None of the above C
 In SQL, GRANT command is used to
(A) Allow user to access databases
(B) Allow user to create databases
(C) Grant system privileges, roles, and object privileges to uses and roles
25 (D) Choose auditing for specific SQL commands C

In an Entity-Relationship Diagram Rectangles represents

(A) Entity sets
(B) Attributes
(C) Database
26 (D) Tables A

Set of permitted values of each attribute is called

(A) Domain
(B) Tuple
(C) Relation
27 (D) Schema A

The attribute that can be divided into other attributes is called

(A) Simple Attribute
(B) Composite Attribute
(C) Multi-valued Attribute
28 (D) Derived Attribute B

Database locking concept is used to solve the problem of

(A) Lost Update
(B) Uncommitted Dependency
(C) Inconsistent Data
29 (D) All of the above D

Which of the following is Relation algebra Operation?

(A) Select
(B) Union
(C) Rename
30 (D) All of the above D

In an Entity-Relationship Diagram “Diamonds” represents

(A) Attributes
(B) Multi-valued attributes
(C) Weak entity set
31 (D) Relationship sets D

What are ACID properties of Transactions?

(A) Atomicity, Consistency, Isolation, Database
(B) Atomicity, Consistency, Isolation, Durability
(C) Atomicity, Consistency, Inconsistent, Durability
32 (D) Automatically, Concurrency, Isolation, Durability B
 A relation that has no partial dependencies is in which normal form
(A) First
(B) Second
(C) Third
33 (D) BCNF B

A command to remove a relation from an SQL database

(A) Delete table <table name>
(B) Drop table <table name>
(C) Erase table <table name>
34 (D) Alter
Which oftable <table name>
the following in true regarding Referential Integrity? B
(A) Every primary-key value must match a primary-key value in an associated
table
(B) Every primary-key value must match a foreign-key value in an associated
table
(C) Every foreign-key value must match a primary-key value in an associated
35 table C
A relation is ………………. if every field contains only atomic values that are, no
lists or sets.
A) 1 NF
B) 2 NF
C) 3 NF
36 D) BCNF A

A table is in the ………………….. if only candidate keys are the determinants.

A) functional dependency
B) transitive dependency
C) 4 NF
37 D) BCNF D
The rule that a value of a foreign key must appear as a value of some specific
table is called a
A. Referential constraint
B. Index
C. Integrity constraint
38 D. Functional A

Relational Algebra is
A. Data Definition Language
B. Meta Language
C. Procedural query Language
39 D. None of the above C

Relational calculus is a
A. Procedural language
B. Non-Procedural language
C. Data definition language
40 D. High level language B
 E-R model uses this symbol to represent the weak entity set?
A. Dotted rectangle
B. Diamond
C. Doubly outlined rectangle
41 D. None of these C

………. is an alternative of log based recovery.

A. Disk recovery
B. Shadow paging
C. Dish shadowing
42 D. Crash recovery B

Which of the following is not a property of transactions?

A. Atomicity
B. Concurrency
C. Isolation
43 D. Durability B

Which of the following ensures the atomicity of the transaction?

A. Transaction management component of DBMS
B. Application Programmer
C. The concurrency control component of DBMS
44 D. Recovery management component of DBMS A
……… protocol is used to perform multiple transactions that execute on a
different database.
A. commit
B. two-phase lock
C. two-phase commit
45 D. locking C

Which of the following represents a query in the tuple relational calculus?

a) { }{P(t) | t }
b) {t | P(t)}
c) t | P() | t
46 d) All of the mentioned B
A user executes a query which the ___ in the system uses to generate the
internal form of the query. In addition to checking the syntax of the query, the
____ verifies the name of the relation in the database, then the tuple, then the
attribute value.
A) Parser B) Translation
47 C) Optimization D) Evaluation A

The system must create a query ____ plan before it can fully evaluate a query.
A) Optimization B) Parser
48 C) Translation D) Evaluation D
 The concept whichchecks the syntax of query which is written according to
rules of the grammer is classified as
a) Query graph b) Query tree
49 c) Parser d) Scanner c

A relation that has no partial dependencies is in which normal form

a) First b) Second
50 c) Third d) BCNF b

Which of the following makes the transaction permanent in the database ?

a) View b) Commit
51 c) Rollback d) Flashback b

The system must create a query ____ plan before it can fully evaluate a query.
a) Optimization b) Parser
52 c) Translation d) Evaluation d

Collections of operations that form a single logical unit of work are called
__________?
a) Views b) Networks
53 c) Units d) Transactions d

The real use of the Two-phase commit protocol is ______________

a) Deadlock will not occur b) Concurrency control can be avoided
54 c) Atomicity, i.e, all-or-nothing commits at all sites d) None of the above c

Which of the following is a property of transactions?

a) Atomicity b) Durability
55 c) Isolation d) All of the mentioned d

Checkpoints are a part of

a)Recovery measures. b) Security measures.
56 c) Concurrency measures. d) Authorization measures. a
 Which of the following is not a recovery technique?
a) Deferred Database Modification
b) Immediate Database Modification
c) Two-phase commit
57 d) Recovery management c

The “all-or-none” property is commonly referred to as _________?

a) Isolation b) Durability
58 c) Atomicity d) None of the mentioned c

Transaction processing is associated with everything below except

a) Conforming a action or triggering a response
b) Producing detail summary or exception report
c) Recording a business activity
59 d) Maintaining a data a
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
60 d) BothofB the
Which andfollowing
C is the preferred way to recover a database after a b
transaction in progress terminates abnormally?
a.Rollback
b.Rollforward
c.Switch to duplicate database
d.Reprocess transactions
61 a
Database locking concept is used to solve the problem of
a)Lost Update
b)Uncommitted Dependency
c)Inconsistent Data
d)All of the above
62 d
The deadlock state can be changed back to stable state by using
_____________ statement.

a)Commit

b)Rollback

c)Savepoint

d)Deadlock
63 b
 Which of the following contains a complete record of all activity that affected
the contents of a database during a certain period of time?

a)report writer

b)query language

c)data manipulation language

d)transaction log
64 d

Concurrency control is important for which of the following reasons?

a)To ensure data integrity when updates occur to the database in a multiuser
environment
b)To ensure data integrity when updates occur to the database in a single-user
environment
c)To ensure data integrity while reading data occurs to the database in a
multiuser environment
d)To ensure data integrity while reading data occurs to the database in a
single-user environment
65 a
A deadlock exists in the system if and only if the wait-for graph contains a
___________.
a)Cycle
b)Direction
c)Bi-direction
d)Rotation
66 a

What is/are the step(s) involved in fetching the data from the database in
query processing?
a)Parsing and translation b) Optimization
67 c) Evaluation d) All of the above d

If one attribute is determinant of second, which in turn is determinant of third,

then the relation cannot be:
a) Well-structured b) 1NF
68 c) 2NF d) 3NF d

Which of the following is not a recovery technique?

a) Deferred update
b) Immediate update
c) Two-phase commit
69 d) Recovery management c

The simplest approach to introducing redundancy is to duplicate every disk is

called …..
a) mirroring b) imaging
70 c) copying d) All of the above a
 If database modifications occur while the transaction is still active, the
transaction is said to use the ___________technique.
a) Deferred-modification b) Late-modification
71 c) Immediate-modification d) Undo c
The log is a sequence of _________ recording all the update activities in the
database.
a) Log records b) Records
72 c) Entries d) Redo b
Let us suppose that in a distributed database, during a transaction T1, one of
the sites, say S1, is failed. When recovers, the site S1 has to check its log file
(log based recovery) to decide the next move on the transaction T1. If the log
contains a <T, Commit> record, what the site S1 has to do?
a) Need not do anything b) Perform Undo
73 c) Perform Redo d) Abort the transaction c
With regards to transaction processing, any DBMS should be capable of:
a)Ensuring that transactions are free from interference from other users.
b)Parts of a transaction are not lost due to a failure.
c)Transactions do not make the database inconsistent.
d)All of the above.
74 d

In case of any shut down during transaction before commit which of the
following statement is done automatically ?
a) View b)Commit
75 c) Rollback d) Flashback c
What is ACID properties of Transactions?
a)Atomicity, Consistency, Isolation, Database
b)Atomicity, Consistency, Isolation, Durability
c)Atomicity, Consistency, Inconsistent, Durability
d)Automatically, Concurrency, Isolation, Durability
76 b

A system is in a ______ state if there exists a set of transactions such that

every transaction in the set is waiting for another transaction in the set.
a) Idle b) waiting
77 c) Ready d) Deadlock d
A transaction completes its execution is said to be
a)Saved
b)Loaded
c)Rolled
d)Committed
78 d
A transaction may not always complete its execution successfully. Such a
transaction is termed
a)Aborted
b)Terminated
c)Closed
d)All of the mentioned
79 a
 Locking may cause which of the following problems?
a)Erroneous updates
b)Deadlock
c)Versioning
d)All of the above.
80 b
In database management system, the executing process or executing program
which considers the updating or reading of records stored in database is called
a)conceptualization
b)execution
c)implementation
d)transaction
81 d
Execution of translation in isolation preserves the _________ of a database
a)Atomicity
b)Consistency
c)Durability
d)All of the mentioned
82 b
Which of the following is not a property of a transaction?

a)Atomicity

b)Simplicity
83 b
X is read from a database and stored in a buffer in main memory with the ___
operation.
A. Read
B. Write
C. Commit
84 D. Rollback A

Which of the following is an operation of transactions?

A. Read
B. Write
C. Commit
85 D. All of the above D

An operation is part of a transaction if it is ___ related.

A. Logically
B. Analytically
C. Reasonably
86 D. None A
Writing the data from the buffer back to the database is accomplished by
using the _____ operation.
A. Read
B. Write
C. Commit
87 D. Rollback B
 In a database, prior to and after a transaction, properties are used to ensure
___.
A. Consistency
B. Redundancy
C. Latency
88 D. Anonymity A

All changes made in a transaction are ___ once it commits.

A. Visible
B. Not Visible
C. Broken
89 D. Not Broken A
What is TRUE about Consistency?
A. As a result of integrity constraints, the database remains consistent before
and after the transaction.
B. In most cases, a database remains either in its previous stable state or in a
new stable state following the execution of a transaction.
C. Every transaction undergoes a consistent database instance, which is the
consistent property of databases.
90 D. All of the above D
What is TRUE about Isolation?
A. By using the data used during a transaction, the second transaction will not
be able to use it until the first has been executed.
B. The data item X cannot be accessed by any other transaction T2 until the
transaction T1 is completed and the data item X is used by the transaction T1.
C. It enforced the isolation property via its concurrency control subsystem.
91 D. All of the above D

What is TRUE about atomicity?

A. The transaction cannot be partially completed, since there is no midway.
B. In each transaction, either the entire transaction is executed or it is not.
C. Both A and B
92 D. None of the above C

When dealing with database transactions, there is often a need for multiple
users to use a database to perform different operations. In this case, ___ of
the database occurs.
A. Concurrent Connection
B. Concurrent Reduction
C. Concurrent Execution
93 D. Concurrent Revolution C
During simultaneous execution, each operation should be performed
interleaved with the others, ensuring that there is no interference with the
other operations. This maintains a database ___.
A. Consistency
B. Redundancy
C. Concurrency
94 D. None C
What is TRUE about Durability?
A. The failure of the system or an error in a transaction cannot cause them to
be lost.
B. A consistent state is reached when a transaction is completed.
C. System failures cannot lead to the loss of that consistent state.
95 D. All of the above D
 The concurrency ___ allows us to maintain the concurrency of the database.
A. Protocols
B. Controls
C. Control Protocols
96 D. None C

What is the Dirty Read Problem also known as?

A. W-W Conflict
B. W-R Conflict
C. R-R Conflict
97 D. None B
 PRIYADARSHINI COLLEGE OF ENGINEERING, NAGPUR
B.TECH. Fourth Semester (Artificial Intelligence & Data Science) (C.B.C.S.)
Subject: DBMS
UNIT :1

Q. No. MCQ Correct

Option

1. What is the full form of DBMS?

a) Data of Binary Management System
b) Database Management System
c) Database Management Service B
d) Data Backup Management System
Explanation: DBMS is abbreviated as Database Management
System. Database Management System stores the data and
allows authorized users to manipulate and modify the data.

2 What is a database?
a) Organized collection of information that cannot be accessed,
updated, and managed
b) Collection of data or information without organizing
c) Organized collection of data or information that can be C
accessed, updated, and managed
d) Organized collection of data that cannot be updated
Explanation: It is defined as an organized collection of data or
information for easy access, updating, and management in a
computer.

3. What is DBMS?
a) DBMS is a collection of queries
b) DBMS is a high-level language
c) DBMS is a programming language D
d) DBMS stores, modifies and retrieves data
Explanation: DBMS is nothing but a storehouse wherein the
authorized user can create a database to store, modify or
 retrieve the organized data in the table. It can be modified or
retrieved by users who have access to DBMS only.

4 Which type of data can be stored in the database?

a) Image oriented data
b) Text, files containing data
c) Data in the form of audio or video
d) All of the above D
Explanation: The reason for creating the database management
system was to store large data and these data can be of any
form image, text, audio, or video files, etc. DBMS allows the
users to store and access the data of any format.
5 Which of the following is not a type of database?
a) Hierarchical
b) Network D
c) Distributed
d) Decentralized
Explanation: Different types are:
1) Centralized
2) Distributed
3) Relational
4) NoSQL
5) Cloud
6) Object-oriented
7) Hierarchical
8) Network

6. Which type of data can be stored in the database?

a) Image oriented data
b) Text, files containing data
c) Data in the form of audio or video D
d) All of the above
Explanation: The reason for creating the database management
 system was to store large data and these data can be of any
form image, text, audio, or video files, etc. DBMS allows the
users to store and access the data of any format.

7. Which of the following is a feature of DBMS?

a) Minimum Duplication and Redundancy of Data
b) High Level of Security
c) Single-user Access only
d) Support ACID Property
Explanation: The important features of a database management C
system are:
1) Minimum Duplication and Redundancy of Data
2) High Level of Security
3) Mulitple-user Access
4) Support ACID Property
8. Which of the following is a function of the DBMS?
a) Storing data
b) Providing multi-users access control
c) Data Integrity D
d) All of the above
Explanation: The purpose of creating DBMS was to store the
data. The data stored in the database management system can
be can accessed by multiple users if the access is provided. The
data stored will be accurate and complete hence providing data
integrity.
9. Which of the following is generally used for performing tasks
like creating the structure of the relations, deleting relation?
DML(Data Manipulation Language)
Query D
Relational Schema
DDL(Data Definition Language)
Explanation: The term “DDL” stands for Data Definition
 Language, used to perform all other essential tasks such as
deleting relation and related schemas in defining the structure
relation.
10. What do you mean by one to many relationships?
One class may have many teachers
One teacher can have many classes B
Many classes may have many teachers
Many teachers may have many classes
Explanation: We can understand the “one to many”
relationship as a teacher who may have more than one class to
attend
11. A Database Management System is a type of
_________software.
It is a type of system software
It is a kind of application software A
It is a kind of general software
Both A and C
Explanation: The DBMS (or Database Management System) is
a kind of system software used for several operations such as
creating tables/databases, storing data, managing databases. It
also allows modifying the data stored in the database as well.
12.
____ Data refers to describing the data description,
representing data semantics, and describing the consistency
constraints that apply to the data. C
a) Adding
b) Modifying
c) Modeling
d) Refining
Explanation:Modeling data refers to describing the data
description, representing data semantics, and describing the
consistency constraints that apply to the data.
13 Which of the following is not the type of the data model?
Relational Data Model
 Semi-structured data Model
Entity-Relationship Model
Process-based Data Model D
Explanation:Process-based Data Model does not come under
the type of data models.

14. As data objects and relationships among them are represented

logically in an ______.
Relational Data Model
ER Model
Object-based Model
Semi-structured
Explanation:As data objects and relationships among them are
represented logically in an ER model.
B

15. Which type of data model is an extension of ER Model? B

Relational Data Model
Object-based Data Model
Structured Data Model
Semi-structured Data Model
Explanation:Object-based Data Model is an extension of ER
Model.

16. Data specifications can be specified when the same-type data

items have different attributes, as in a ____ model.
Relational Data Model
Object-based Data Model D
ER Model
Semi-structured Data Model
Explanation:Data specifications can be specified when the
same-type data items have different attributes, as in a semi-
structured model
17. What type of schema objects are there in schema?
Primary Key
Foreign Key
Views D
All of the above
Explanation:The types of schema objects present in the schema
are primary key, foreign key, views, columns, data types, table
& stored procedure, etc.

18. _____ diagrams can be used to represent database schemas.

Visual
Logical
Analytical A
Structural
Explanation:Visual diagrams can be used to represent database
schemas.

19. DBMS provides a convenient and efficient environment.

a) True A
b) False
Explanation: The statement is true. DBMS stands for Database
Management System. It provides an efficient and easy to use
environment.
20. Which of the following isn’t a level of abstraction? C
a) physical
b) logical
c) user
d) view
Explanation: There are three levels of abstraction: physical,
logical and the view level. These three levels are involved in
DBMS.
21. A level that describes how a record is stored.
a) physical A
b) logical
c) user
d) view
Explanation: The answer is physical. The physical level
describes how the record gets stored.
e.g. Customer.

22. A level that describes data stored in a database and the

relationships among the data.
a) physical
b) logical B
c) user
d) view
Explanation: The answer is logical. The logical level describes
the relationships between the data. Physical level describes
how the data is stored.

23. The term "Data independence" refers to____ DBMS

a) Data is defined separately and not included in the
programs B
b) Programs are not dependent on the logical attributes of
the data
c) Programs are not dependent on the physical attributes of
the data
d) Both B & C

24. Which of the following is a procedural language?

A) Relational algebra
B) Query language
C) Tuple relational calculus
D) Domain relational calculus
25. Which of the following gives a logical structure of the database
graphically?
a) Entity-relationship diagram A
b) Entity diagram
c) Database diagram
d) Architectural representation
Explanation: E-R diagrams are simple and clear—qualities that
may well account in large part for the widespread use of the E-
R model.
26. Consider a directed line(->) from the relationship set advisor to
both entity sets instructor and student. This indicates
_________ cardinality
a) One to many B
b) One to one
c) Many to many
d) Many to one
Explanation: This indicates that an instructor may advise at
most one student, and a student may have at most one advisor.

27. An entity set that does not have sufficient attributes to form a
primary key is termed a __________
a) Strong entity set
b) Variant set
c) Weak entity set
d) Variable set
Explanation: An entity set that has a primary key is termed a
strong entity set.

28.
If you were collecting and storing information about your
music collection, an album would be considered a(n) _____
a) Relation
b) Entity B
c) Instance
 d) Attribute
Explanation: An entity set is a logical container for instances of
an entity type and instances of any type derived from that entity
type.
29
SQL contains which component in its process?
a) Optimization Engines
b) SQL Query Engines D
c) Query Dispatchers
d) All of the above
Explination:The SQL query process consists of components
such as Optimization Engines, SQL Query Engines, and Query
Dispatchers, etc.
30.
Which of the following statement is true?
a) SQL statements are used for most operations in a C
database.
b) Relational algebra and tuple relationship calculus are
needed for SQL syntax.
c) All of the above
d) None of the above
Explanation:SQL statements are used for most operations in a
database and Relational algebra and tuple relationship calculus
are needed for SQL syntax.

31.
Which of the following is not an SQL Statement?
a) SELECT Statement
b) UPDATE Statement
D
c) TRUNCATE TABLE Statement
d) FROM Statement
Explanation:SQL Statements are SELECT, UPDATE,
TRUNCATE TABLE.
32.
The ability to query data, as well as insert, delete, and alter
tuples, is offered by ____________
a) TCL (Transaction Control Language)
b) DCL (Data Control Language)
c) DDL (Data Definition Langauge)
d) DML (Data Manipulation Langauge
33.
______________ is a set of one or more attributes taken
collectively to uniquely identify a record.
a) Primary Key
b) Foreign key
c) Super key C

d) Candidate key
Explanation: Foreign key creates a relationship between two
relations. Super key is the superset of all the keys in a relation.
A candidate key is used to identify tuples in a relation.
34.
Which command is used to remove a relation from an SQL?
a) Drop table
b) Delete
A
c) Purge
d) Remove
Explanation: Delete command is used to delete the existing
record from the table. The drop table deletes the whole
structure of the relation. Purge removes the table which cannot
be obtained again.
35. D
Which of the following set should be associated with weak
entity set for weak entity to be meaningful?
a) Neighbour set
b) Strong entity set
c) Owner set
 d) Identifying set
Explanation: Every weak entity must be linked to an
identifying entity; in other words, the existence of the weak
entity set is contingent on the presence of the identifying entity
set. The weak entity set that the identifying entity set identifies
is said to be owned by the identifying entity set. Owner entity
set is another name for it.
36.
_________________ operations do not preserve non-matched
tuples.
a) Left outer join
b) Inner join
c) Natural join B

d) Right outer join

Explanation: Left outer join returns all the rows from the table
that is on the left side and matching rows on the right side of
the join. Inner join returns all rows when there is at least one
match in BOTH tables. Natural join returns the common
columns from the tables being joined. A right outer join returns
all the rows from the table that is on the right side and matching
rows on the left side of the join.

37.
The logical design, and the snapshot of the data at a given
instant in time is known as?
a) Instance & Relation
b) Relation & Schema
c) Domain & Schema
D
d) Schema & Instance
Explanation: Instance is an instance of time, the relation is also
known as table consists of data with similar characteristics,
Domain is the collection of values that an attribute can contain
and schema is a representation.
38.
__________ command is used in SQL to issue multiple
CREATE TABLE, CREATE VIEW and GRANT statements in
a single transaction.
a) CREATE CLUSTER
b) CREATE PACKAGE C
c) CREATE SCHEMA
d) All of the mentioned
Explanation: A schema is a description of a system’s structure
in a formal language supported by the database management
system, and it refers to data organization as a blueprint for how
a db is built.
After groups have been established, SQL applies predicates in
the ___________ clause, allowing aggregate functions to be
used.
a) Where
D
b) Having
c) Group by
d) With
Explanation: The “with” clause was introduced to reduce the
complexity of the queries which are lengthy. The “with” clause
allows you to define a temporary relation whose definition is
only visible to the query in which it appears.
 PRIYADARSHINI COLLEGE OF ENGINEERING, NAGPUR
B.TECH. Fourth Semester (Artificial Intelligence & Data Science)
(C.B.C.S.)
Subject: DBMS(UNIT 2)

Q MCQues Correct
No. Option
1. Choose the correct statement regarding superkeys a
a) A superkey is an attribute or a group of multiple
attributes that can uniquely identify a tuple
b) A superkey is a tuple or a set of multiple tuples
that can uniquely identify an attribute
c) Every superkey is a candidate key
d) A superkey is an attribute or a set of attributes that
distinguish the relation from other relation
Explanation: A superkey is an attribute or a set of
multiple attributes that can uniquely identify a tuple.
It is used to differentiate between tuples.

2. What is an Instance of a Database? c

a) The logical design of the database system
b) The entire set of attributes of the Database put
together in a single relation
c) The state of the database system at any given point
of time
d) The initial values inserted into the Database
immediately after its creation
Explanation: The state of the database system at any
given point of time is called as an Instance of the
 database.

3. What is a foreign key? c

a) A foreign key is a primary key of a relation which
is an attribute in another relation
b) A foreign key is a superkey of a relation which is
an attribute in more than one other relations
c) A foreign key is an attribute of a relation that is a
primary key of another relation
d) A foreign key is the primary key of a relation that
does not occur anywhere else in the schema
Explanation: A foreign key is an attribute of a
relation that is initially a primary key of another
relation. A foreign key usage preserves referential
integrity.

4. What action does ⋈ operator perform in relational a

algebra
a) Output specified attributes from all rows of the
input relation and remove duplicate tuples from the
output
b) Outputs pairs of rows from the two input relations
that have the same value on all attributes that have
the same name
c) Output all pairs of rows from the two input
relations (regardless of whether or not they have the
same values on common attributes)
d) Return rows of the input relation that satisfy the
predicate
Explanation: ⋈ Outputs specified attributes from all
 rows of the input relation. Remove duplicate tuples
from the output. The operation is called the join
operation.

5. What does the “x” operator do in relational algebra? c

a) Output specified attributes from all rows of the
input relation. Remove duplicate tuples from the
output
b) Output pairs of rows from the two input relations
that have the same value on all attributes that have
the same name
c) Output all pairs of rows from the two input
relations (regardless of whether or not they have the
same values on common attributes)
d) Returns the rows of the input relation that satisfy
the predicate
Explanation: The “x” operator outputs all pairs of
rows from the two input relations (regardless of
whether or not they have the same values on
common attributes). This operation is called as the
Cartesian product operation and is similar to the
Cartesian product of sets.

6. An attribute is a __________ in a relation. b

a) Row
b) Column
c) Value
d) Tuple
Explanation: An attribute is a column in a relation. A
 tuple is a row in a relation.

7. What is the method of specifying a primary key in a d

schema description?
a) By writing it in bold letters
b) By underlining it using a dashed line
c) By writing it in capital letters
d) By underlining it using a bold line
Explanation: We can specify a primary key in
schema description by underlining the respective
attribute with a bold line.
10. State true or false: If a relation consists of a foreign b
key, then it is called a referenced relation of the
foreign key dependency.
a) True
b) False
Explanation: If a relation has a foreign key, then it is
called a referencing relation of the foreign key
dependency.

11. To include integrity constraint in an existing relation C

use :
a) Create table
b) Modify table
c) Alter table
d) Drop table

Explanation: SYNTAX – alter table table-name add

constraint, where constraint can be any constraint on
 the relation.

12. Which of the following is not an integrity b

constraint?
a) Not null
b) Positive
c) Unique
d) Check ‘predicate’

Explanation: Positive is a value and not a constraint.

13. CREATE TABLE Manager(ID NUMERIC,Name a
VARCHAR(20),budget NUMERIC,Details
VARCHAR(30));
Inorder to ensure that the value of budget is non-
negative which of the following should be used?
a) Check(budget>0)
b) Check(budget<0)
c) Alter(budget>0)
d) Alter(budget<0)

Explanation: A common use of the check clause is to

ensure that attribute values satisfy specified
conditions, in effect creating a powerful type system.

14. Foreign key is the one in which the ________ of one B

relation is referenced in another relation.
a) Foreign key
b) Primary key
c) References
d) Check constraint
 Explanation: The foreign-key declaration specifies
that for each course tuple, the department name
specified in the tuple must exist in the department
relation.

15. CREATE TABLE course B

(...
FOREIGN KEY (dept name) REFERENCES
department
. . . );
Which of the following is used to delete the entries in
the referenced table when the tuple is deleted in
course table?
a) Delete
b) Delete cascade
c) Set null
d) All of the mentioned

Explanation: The delete “cascades” to the course

relation, deletes the tuple that refers to the
department that was deleted.

16. Domain constraints, functional dependency and c

referential integrity are special forms of _________
a) Foreign key
b) Primary key
c) Assertion
d) Referential constraint
 Explanation: An assertion is a predicate expressing a
condition we wish the database to always satisfy.

17. 8. Which of the following is the right syntax for the A

assertion?
a) Create assertion ‘assertion-name’ check
‘predicate’;
b) Create assertion check ‘predicate’ ‘assertion-
name’;
c) Create assertions ‘predicates’;
d) All of the mentioned

Explanation: None.

18. Data integrity constraints are used to: C

a) Control who is allowed access to the data
b) Ensure that duplicate records are not entered into
the table
c) Improve the quality of data entered for a specific
property (i.e., table column)
d) Prevent users from changing the values stored in
the table

Explanation: None.

19. Which of the following can be addressed by C

enforcing a referential integrity constraint?
a) All phone numbers must include the area code
b) Certain fields are required (such as the email
 address, or phone number) before the record is
accepted
c) Information on the customer must be known
before anything can be sold to that customer
d) When entering an order quantity, the user must
input a number and not some text (i.e., 12 rather than
‘a dozen’)

Explanation: The information can be referred to and

obtained.

20. Which one of the following is a set of one or more C

attributes taken collectively to uniquely identify a
record?
a) Candidate key
b) Sub key
c) Super key
d) Foreign key
Explanation: Super key is the superset of all the keys
in a relation.

21. Consider attributes ID, CITY and NAME. Which b

one of this can be considered as a super key?
a) NAME
b) ID
c) CITY
d) CITY, ID
Explanation: Here the id is the only attribute which
can be taken as a key. Other attributes are not
uniquely identified.
22. The subset of a super key is a candidate key under a
what condition?
a) No proper subset is a super key
b) All subsets are super keys
c) Subset is a super key
d) Each subset is a super key
Explanation: The subset of a set cannot be the same
set. Candidate key is a set from a super key which
cannot be the whole of the super set.

23. A _____ is a property of the entire relation, rather b

than of the individual tuples in which each tuple is
unique.
a) Rows
b) Key
c) Attribute
d) Fields
Explanation: Key is the constraint which specifies
uniqueness.

24. Which one of the following attribute can be taken as c

a primary key?
a) Name
b) Street
c) Id
d) Department
Explanation: The attributes name, street and
department can repeat for some tuples. But the id
attribute has to be unique. So it forms a primary key.
25. Which one of the following cannot be taken as a d
primary key?
a) Id
b) Register number
c) Dept_id
d) Street
Explanation: Street is the only attribute which can
occur more than once.

26. An attribute in a relation is a foreign key if the b

_______ key from one relation is used as an attribute
in that relation.
a) Candidate
b) Primary
c) Super
d) Sub
Explanation: The primary key has to be referred in
the other relation to form a foreign key in that
relation.

27. The relation with the attribute which is the primary c

key is referenced in another relation. The relation
which has the attribute as a primary key is called
______________
a) Referential relation
b) Referencing relation
c) Referenced relation
d) Referred relation
Explanation: None.
28. The ______ is the one in which the primary key of c
one relation is used as a normal attribute in another
relation.
a) Referential relation
b) Referencing relation
c) Referenced relation
d) Referred relation
Explanation: None.

29. A _________ integrity constraint requires that the a

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) Referential
b) Referencing
c) Specific
d) Primary
Explanation: A relation, say r1, may include among
its attributes the primary key of another relation, say
r2. This attribute is called a foreign key from r1,
referencing r2. The relation r1 is also called the
referencing relation of the foreign key dependency,
and r2 is called the referenced relation of the foreign
key.

30. Relational Algebra is a __________ query language c

that takes two relations as input and produces another
relation as an output of the query.
 a) Relational
b) Structural
c) Procedural
d) Fundamental
Explanation: This language has fundamental and
other operations which are used on relations.

31. Which of the following is a fundamental operation in d

relational algebra?
a) Set intersection
b) Natural join
c) Assignment
d) None of the mentioned
Explanation: The fundamental operations are select,
project, union, set difference, Cartesian product, and
rename.

32. Which of the following is used to denote the b

selection operation in relational algebra?
a) Pi (Greek)
b) Sigma (Greek)
c) Lambda (Greek)
d) Omega (Greek)
Explanation: The select operation selects tuples that
satisfy a given predicate.

33. For select operation the ________ appear in the a

subscript and the ___________ argument appears in
the paranthesis after the sigma.
a) Predicates, relation
 b) Relation, Predicates
c) Operation, Predicates
d) Relation, Operation
Explanation: None.

34. The ___________ operation, denoted by −, allows us b

to find tuples that are in one relation but are not in
another.
a) Union
b) Set-difference
c) Difference
d) Intersection
Explanation: The expression r − s produces a relation
containing those tuples in r but not in s.

35. Which is a unary operation: d

a) Selection operation
b) Primitive operation
c) Projection operation
d) Generalized selection
Explanation: Generalization Selection takes only one
argument for operation.

36. Which is a join condition contains an equality a

operator:
a) Equijoins
b) Cartesian
c) Natural
d) Left
 Explanation: None.

37. In precedence of set operators, the expression is b

evaluated from
a) Left to left
b) Left to right
c) Right to left
d) From user specification
Explanation: The expression is evaluated from left to
right according to the precedence.

38. Which of the following is not outer join? d

a) Left outer join
b) Right outer join
c) Full outer join
d) All of the mentioned
Explanation: The FULL OUTER JOIN keyword
combines the result of both LEFT and RIGHT joins.

39. The assignment operator is denoted by b

a) ->
b) <-
c) =
d) ==
Explanation: The result of the expression to the right
of the ← is assigned to the relation variable on the
left of the ←.
40. Find the ID, name, dept name, salary for instructors a
whose salary is greater than $80,000 .
a) {t | t ε instructor ∧ t[salary] > 80000}
b) Э t ∈ r (Q(t))
c) {t | Э s ε instructor (t[ID] = s[ID]∧ s[salary] >
80000)}
d) None of the mentioned
Explanation: This expression is in tuple relational
format.

41. A query in the tuple relational calculus is expressed c

as:
a) {t | P() | t}
b) {P(t) | t }
c) {t | P(t)}
d) All of the mentioned
Explanation: The tuple relational calculus, is a
nonprocedural query language. It describes the
desired information without giving a specific
procedure for obtaining that information.

42. Which of the following symbol is used in the place c

of except?
a) ^
b) V
c) ¬
d) ~
Explanation: The query ¬P negates the value of P.
43. “Find all students who have taken all courses offered b
in the Biology department.” The expressions that
matches this sentence is :
a) Э t ε r (Q(t))
b) ∀ t ε r (Q(t))
c) ¬ t ε r (Q(t))
d) ~ t ε r (Q(t))
Explanation: ∀ is used denote “for all” in SQL.

44. Which of the following is the comparison operator b

in tuple relational calculus
a) ⇒
b) =
c) ε
d) All of the mentioned
Explanation: The comparison operators are (<, ≤, =,
=, >, ≥).

45. . An expression in the domain relational calculus is d

of the form
a) {P(x1, x2, . . . , xn) | < x1, x2, . . . , xn > }
b) {x1, x2, . . . , xn | < x1, x2, . . . , xn > }
c) { x1, x2, . . . , xn | x1, x2, . . . , xn}
d) {< x1, x2, . . . , xn > | P(x1, x2, . . . , xn)}
Explanation: Here x1, x2, . . . , xn represent domain
variables. P represents a formula composed of atoms,
as was the case in the tuple relational calculus.

46. In domain relaional calculus “there exist” can be d

 expressed as
a) (P1(x))
b) (P1(x)) Э x
c) V x (P1(x))
d) Э x (P1(x))
Explanation:Э is used to denote “some” values in
relational calculus.

47. A set of possible data values is called d

a) Attribute
b) Degree
c) Tuple
d) Domain
Explanation: None.
 PRIYADARSHINI COLLEGE OF ENGINEERING, NAGPUR
B.TECH. Fourth Semester (Artificial Intelligence & Data Science) (C.B.C.S.)
Subject: DBMS
UNIT-3

Q. MCQ Correct
No. Option
1. 1. A database is ___ to reduce the number of disk accesses B
needed to process queries in order to improve performance.
A. Non-indexed
B. Indexed
C. Inserted
D. Updated

Explanation: A database is indexed to reduce the number of

disk accesses needed to process queries in order to improve
performance.
2 2. What is index? D
A. Type of Dataset
B. Type of Database
C. Type of Record
D. Type of Data Structure

Explanation: Index is the type of data structure.

3. 3. A database ___ can be quickly accessed and located with it. C

A. Row
B. Column
C. Table
D. Field

Explanation: A database table can be quickly accessed and

located with it.
4. Some database columns can be used to create ___. C

A. Indices
B. Files
C. Indexes
D. Records
 Explanation: Some database columns can be used to create
indexes.

5. 5. How many columns are there in Structure of Index? A

A. 2
B. 3
C. 4
D. 5

Explanation: There are 2 columns in the Structure of Index.

6. 6. Which of the following is the column in structure of index? C

A. Search Key
B. Data Reference
C. Both A and B
D. None of the above

Explanation:

The columns in the structure of index are -

i. Search Key
ii. Data Reference

7. 7. A copy of the ___ of the table is in the first column of the C

database, i.e., search key.

A. Primary Key
B. Candidate Key
C. Both A and B
D. None of the above

Explanation:

A copy of the primary key or candidate key of the table is in

the first column of the database.

8. 8. A ___ key is sorted in order to make it easy to access data A

corresponding to it.
 A. Primary
B. Foreign
C. Composite
D. Alternate

Explanation:

A primary key is sorted in order to make it easy to access data

corresponding to it.

9. 9. ___ are found in the second column of the database. C

A. Datasets
B. Data structure
C. Data references
D. Data items

Explanation:

Data references are found in the second column of the

database.

10. Each ___ consists of a set of pointers containing the address of C

the disk block containing the value for that ___.

A. Dataset
B. Data Item
C. Key
D. Log

Explanation:

Each key consists of a set of pointers containing the address of

the disk block containing the value for that key.

11. How many indexing methods are there? B

A. 3
B. 4
C. 5
 D. 6

Explanation:

There are 4 indexing methods.

12. Which of the following is an indexing method? D

A. Primary
B. Clustering
C. Secondary
D. All of the above

Explanation:

The indexing methods are -

i. Ordered
ii. Primary
iii. Clustering
iv. Secondary

13. How many types of primary index are there? A

A. 2
B. 3
C. 4
D. 5

Explanation:

There are 2 types of primary index.

14. Which of the following is the type of primary index? C

A. Dense Index
B. Spare Index
C. Both A and B
D. None of the above

Explanation:
 The type of primary index are -

i. Dense Index
ii. Spare Index

15. Searches are usually made ___ by sorting the indices. C

A. Slower
B. Dimmer
C. Faster
D. Stopped

Explanation:

Searches are usually made faster by sorting the indices.

16. Indexes that are ordered are referred to as ___ indices. A

A. Ordered
B. Primary
C. Clustering
D. Secondary

Explanation:

Indexes that are ordered are referred to as ordered indices.

17. It is known as primary indexing if the index is created based on A

the table's primary key.

A. Primary
B. Foreign
C. Alternate
D. Composite

Explanation:

It is known as primary indexing if the index is created based on

the table's primary key.
18. Records containing these primary keys are uniquely identified A
by these keys and have a ___ relationship between them.

A. 1:1
B. 1:M
C. M:1
D. M:M

Explanation:

Records containing these primary keys are uniquely identified

by these keys and have a 1:1 relationship between them.

19 Since primary keys are sorted, ___ operations are quite C

efficient because of their sorted order.

A. Add
B. Update
C. Search
D. Delete

Explanation:

Since primary keys are sorted, search operations are quite

efficient because of their sorted order.

20 Each search key value in the data file has an index record in B
the ___ index.

A. Sparse
B. Dense
C. Both A and B
D. None of the above

Explanation:

Each search key value in the data file has an index record in
the dense index.

21 There is no difference in the number of ___ in the index and C

main tables when using Dense Index.
 A. Files
B. Databases
C. Records
D. Datasets

Explanation:

There is no difference in the number of records in the index

and main tables when using Dense Index.

22 The index record itself takes up ___ space in a dense index. D

A. Less
B. Little
C. Few
D. More

Explanation:

The index record itself takes up more space in a dense index.

23 Which of the following is the type of primary index? C

A. Dense Index
B. Spare Index
C. Both A and B
D. None of the above

Explanation:

The type of primary index are -Dense and Sparse Indexing.24

24 Besides the search key, index records contain a pointer to the C

___ data on the disk.

A. Previous
B. Consecutive
C. Actual
D. None

Explanation:
 Besides the search key, index records contain a pointer to the
actual data on the disk.

25 ___ index records appear only for a few items in the data file. B

A. Dense
B. Sparse
C. Both A and B
D. None of the above

Explanation:

Sparse index records appear only for a few items in the data
file.

26 Sparse index items point to ___. C

A. Files
B. Records
C. Blocks
D. None

Explanation:

Sparse index items point to blocks.

27 An index that points to the records in a ___ in the main table B

rather than each record in the main table is a sparse index.

A. Filled Space
B. Gap
C. Files
D. Records

Explanation:

An index that points to the records in a gap in the main table

rather than each record in the main table is a sparse index.

28 An ordered data file can be considered a ___ index. D

 A. Primary
B. Dense
C. Sparse
D. Clustered

Explanation:

An ordered data file can be considered a clustered index.

29 The index can be built on columns other than ___ keys, which A
are not guaranteed to be unique.

A. Primary
B. Foreign
C. Composite
D. Alternate

Explanation:

The index can be built on columns other than primary keys,

which are not guaranteed to be unique.

30 Clustering can be used to identify records faster by grouping C

___ columns to get the unique value and creating an index
from them.

A. One
B. Two
C. Two or more
D. None

Explanation:

Clustering can be used to identify records faster by grouping

two or more columns to get the unique value and creating an
index from them.

31 Creating indices for these groups of records such as in A

clustering index is done after groups of records which have
similar characteristics are ____ together.

A. Grouped
 B. Distributed
C. Replaced
D. None

Explanation:

Creating indices for these groups of records is done after

groups of records which have similar characteristics are
grouped together.

32 In the case of creating separate disk blocks for individual C

clusters, that's referred to as a ___.

A. Technique
B. Better
C. Better Technique
D. Technique Better

Explanation:

In the case of creating separate disk blocks for individual

clusters, that's referred to as a better technique.

33 Whenever the size of the table increases, so does the size of the B
___ in the sparse index.

A. Table
B. Mapping
C. Files
D. Adding

Explanation:

Whenever the size of the table increases, so does the size of the
mapping.

34 A mapping would typically be kept in ____ memory in order A

to make address fetching faster.

A. Primary
B. Secondary
C. Ternary
 D. None

Answer: A) Primary

Explanation:

A mapping would typically be kept in primary memory in

order to make address fetching faster.

35 Based on the ___ mapped to the secondary memory, that A

memory searches for the data.

A. Address
B. Number
C. Name
D. Type

Explanation:

Based on the address mapped to the secondary memory, that

memory searches for the data.

36 Fetching the address becomes slower when the mapping size C

grows.

A. Faster
B. Super faster
C. Slower
D. None

Explanation:

Fetching the address becomes slower when the mapping size

grows.

37 When the mapping size grow which index is inefficient? A

A. Sparse
B. Secondary
C. Both A and B
D. None of the above
 Explanation:

When the mapping size grows, the sparse index is inefficient.

38 Adding another level of ___ to secondary ___ reduces the size A

of mapping.

A. Indexing
B. Mapping
C. Adding
D. Merging

Explanation:

Adding another level of indexing to secondary indexing

reduces the size of mapping.

39 As part of the secondary index method, the columns are C

initially selected for their huge ranges, resulting in a small
first-level mapping size. After that, each range is further
divided into ___ ranges.

A. Bigger
B. Larger
C. Smaller
D. Wider

Explanation:

As part of the secondary index method, the columns are

initially selected for their huge ranges, resulting in a small
first-level mapping size. After that, each range is further
divided into smaller ranges.

40 Both the ___ level mapping and actual data are stored on the B
hard disk (secondary memory).

A. First
B. Second
C. Third
D. None
 Explanation:

Both the second level mapping and actual data are stored on
the hard disk (secondary memory).

41 A ___ binary search tree is a B+ tree. A

A. Balanced
B. Unbalanced
C. Positive
D. B Positive

Explanation:

A balanced binary search tree is a B+ tree.

42 There is/are ___ levels of indexing in the B+ tree. D

A. Single
B. Double
C. Triple
D. Multiple

Explanation:

There are multiple levels of indexing in the B+ tree.

43 The leaf nodes of the B+ tree represent actual data ___. C

A. Sets
B. Bases
C. Points
D. Types

Explanation:

The leaf nodes of the B+ tree represent actual data points.

44 A B+ tree maintains the same height of all leaf nodes. A

A. Same
 B. Similar
C. Different
D. Far

Explanation:

A B+ tree maintains the same height of all leaf nodes.

45 A ___ is used to link the leaf nodes in the B+ tree. C

A. Stack
B. Queue
C. Link List
D. None

Explanation:

A link list is used to link the leaf nodes in the B+ tree.

46 B+ trees can support ___ access. C

A. Sequential
B. Random
C. Both A and B
D. None of the above

Explanation:

B+ trees can support both sequential and random access.

47 There is an equal distance between every leaf node and its B

counterpart at the ___ node in the B+ tree.

A. Leaf
B. Root
C. Stem
D. None

Explanation:

There is an equal distance between every leaf node and its

 counterpart at the root node in the B+ tree.

48 The B+ tree has a ___ number of branches of the order n. A

A. Fixed
B. Different
C. Separate
D. Consecutive

Explanation:

The B+ tree has a fixed number of branches of the order n.

49 A ___ are included in the B+ tree. C

A. Leaf Node
B. Internal Node
C. Both A and B
D. None of the above

Explanation:

A leaf node and an internal node are included in the B+ tree.

50 The root node of the B+ tree contains the most ___ (n/2). B

A. Record Points
B. Record Pointers
C. Record Sets
D. Record Files

Explanation:

The root node of the B+ tree contains the most record pointers
(n/2).

51 n is the ___ number of pointers an internal node contains. B

A. Minimum
B. Maximum
C. Average
 D. None

Explanation:

n is the maximum number of pointers an internal node

contains.

52 At least n/2 record pointers and n/2 key values can be C

contained in a/an/the ___ node(s) of the B+ tree.

A. Leaf
B. Internal
C. Both A and B
D. None of the above

Explanation:

At least n/2 record pointers and n/2 key values can be

contained in a leaf node of the B+ tree.

53 Leaf nodes contain the maximum number of ___ n. C

A. Record Pointers
B. Key Values
C. Both A and B
D. None of the above

Explanation:

Leaf nodes contain the maximum number of record pointers

and key values n.

54 Two attributes can be functionally ___ on/of each other. A

A. Dependent
B. Independent
C. Both A and B
D. None of the above

Explanation:
 Two attributes can be functionally dependent on each other.

55 An attribute that is ___ and the primary key of a table are B

typically functionally dependent on one another.

A. Key
B. Non-Key
C. One-Key
D. Many-Key

Explanation:

An attribute that is non-key and the primary key of a table are

typically functionally dependent on one another.

56 Functional dependencies are classified as ___ on the left. C

A. Dependent
B. Determined
C. Determinants
D. Database

Explanation:

Function dependencies are classified as determinants on the

left.

57 __ is the right side of making functional dependency. B

A. Determinants
B. Dependency
C. Independency

Explanation:

Dependency is the right side of making functional dependency.

58 How many types of functional dependencies are there? D

A. 1
B. 2
 C. 3
D. 4

Explanation:

There are mainly four types of Functional Dependency in

DBMS:

i. Trivial functional dependency

ii. Non-Trivial functional dependency
iii. Multivalued functional dependency
iv. Transitive functional dependency

59 Which of the following is a type of functional dependency? C

A. Trivial Functional Dependency

B. Non-trivial Functional Dependency
C. Both A and B
D. None of the above

Explanation:

There are mainly four types of Functional Dependency in

DBMS:

i. Trivial functional dependency

ii. Non-Trivial functional dependency
iii. Multivalued functional dependency
iv. Transitive functional dependency

60 If ___, then A -> B has trivial functional dependency. A

A. B is a subset of A
B. A is a subset of B
C. A is a subset of A'
D. B is a subset of B'

Explanation:

If B is a subset of A, then A -> B has trivial functional

dependency.
61 Which of the following is a trivial functional dependency? A

A. A->B, if B is a subset of A
B. A->A
C. B->B
D. All of the above

Explanation:

These are the trivial functional dependencies -

i. A->B
ii. A->A
iii. B->B

62 If ___, then A -> B has non-trivial functional dependency. A

A. B is not a subset of A
B. A is not a subset of B
C. A is not a subset of A'
D. B is not a subset of B'

Explanation:

If B is not a subset of A, then A -> B has non-trivial functional

dependency.

63 A -> B is a ___l, when A intersection B is NULL. B

A. Complete Trivial
B. Complete Non-Trivial
C. Incomplete Trivial
D. Incomplete Non-Trivial

Explanation:

A -> B is a complete non-trivial, when A intersection B is

NULL.

64 A ___ is normalized after it has been organized. B

A. Table
 B. Database
C. Row
D. Column

Explanation:

A database is normalized after it has been organized.

65 By normalizing relations or sets of relations, one minimizes C

___.

A. Data
B. Fields
C. Redundancy
D. Database

Explanation:

By normalizing relations or sets of relations, one minimizes

redundancy.

66 In addition to removing undesirable characteristics, D

normalization also eliminates ___ anomalies.

A. Insert
B. Update
C. Delete
D. All of the above

Explanation:

In addition to removing undesirable characteristics,

normalization also eliminates insert, update, and delete
anomalies.

67 A common approach to normalization is to ___ the larger table D

into smaller tables and link them together by using
relationships.

A. Add
B. Subtract
C. Multiply
 D. Divide

Explanation:

A common approach to normalization is to divide the larger

table into smaller tables and link them together by using
relationships.

68 Redundancy is reduced in a database table by using the ___ B

form.

A. Abnormal
B. Normal
C. Special
D. None

Explanation:

Redundancy is reduced in a database table by using the normal

form.

69 In practical applications, how many types of Normal Forms are B

there?

A. 3
B. 4
C. 5
D. 6

Explanation:

There are 4 types of normal forms.

1. 1-NF

2. 2-NF

3. 3-NF

4. BCNF

70 Which of the following is not a type of Normal Form? D

 A. 1NF
B. 2NF
C. 3NF
D. 10NF

Explanation:

10NF is not a type of Normal Form.

71 Which of the following is a type of Normal Form? B

A. ACNF
B. BCNF
C. CCNF
D. DCNF

Explanation:

BCNF is a type of Normal Form.

72 When a relation contains an atomic value, it is a ___ relation. A

A. 1NF
B. 2NF
C. 3NF
D. BCNF

Explanation:

When a relation contains an atomic value, it is a 1NF relation.

73 2NF relations are those that are in 1NF with all the attribute A
types dependent on the ___ key.

A. Primary
B. Foreign
C. Composite
D. Alternate

Explanation:

2NF relations are those that are in 1NF with all the attribute
 types dependent on the primary key.

74 When a relation is in 2NF and there is ___, it is in 3NF. B

A. Transition Dependency
B. No Transition Dependency
C. Relational Dependency
D. No Relational Dependency

Explanation:

When a relation is in 2NF and there is no transition

dependency, it is in 3NF.

75 A relation is in ___ if it is in Boyce Codd normal form and D

does not have any multivalued dependencies.

A. 1NF
B. 2NF
C. 3NF
D. 4NF

Explanation:

A relation is in 4NF if it is in Boyce Codd normal form and

does not have any multivalued dependencies.

76 What is TRUE about the First Normal Form (1NF)? D

A. If a relation contains an atomic value, it will be 1NF.

B. A table attribute cannot contain more than one value,
according to this rule.
C. A single-valued attribute can only be stored in it.
D. All of the above

Explanation:

In case of First Normal Form (1NF) -

a. If a relation contains an atomic value, it will be 1NF.

b. A table attribute cannot contain more than one value,
according to this rule.
 c. A single-valued attribute can only be stored in it.

77 What is TRUE about the Second Normal Form (2NF)? C

A. Relational must belong to 1NF in the 2NF.

B. All attributes other than the primary key are fully
functional in the second normal form
C. Both A and B
D. None of the above

Explanation:

In case of Second Normal Form (2NF) -

a. Relational must belong to 1NF in the 2NF.

b. All attributes other than the primary key are fully
functional in the second normal form

78 What is TRUE about the Third Normal Form (3NF)? D

A. When a relation is in 2NF and does not contain transitive

partial dependencies, it will be in 3NF.
B. Data duplication is reduced by using 3NF.
C. It helps maintain the integrity of the data.
D. All of the above

Explanation:

In case of Third Normal Form (3NF) -

a. When a relation is in 2NF and does not contain transitive

partial dependencies, it will be in 3NF.
b. Data duplication is reduced by using 3NF.
c. It helps maintain the integrity of the data.

79 What is TRUE about BCNF? D

A. The advanced version of 3NF is BCNF.

B. BCNF is stricter than 3NF.
C. The super key is X for any functional dependency of X -
> Y in the table.
 D. All of the above

Explanation:

In case of BCNF -

a. The advanced version of 3NF is BCNF.

b. BCNF is stricter than 3NF.
c. The super key is X for any functional dependency of X -
> Y in the table.

80 A relation is in ___ if it is in Boyce Codd normal form and D

does not have any multivalued dependencies.

A. 1NF
B. 2NF
C. 3NF
D. 4NF

Explanation:

A relation is in 4NF if it is in Boyce Codd normal form and

does not have any multivalued dependencies.

81
 PRIYADARSHINI COLLEGE OF ENGINEERING, NAGPUR
B.TECH. Fourth Semester (Artificial Intelligence & Data Science)
(C.B.C.S.)
Subject:DBMS(UNIT 4)

Q. MCQ Correct
No. Option
1. A collection of data designed to be used by different people is b
called a/an
a) Organization
b) Database
c) Relationship
d) Schema
Explanation: Database is a collection of related tables.
2 Which of the following is the oldest database model? d
a) Relational
b) Deductive
c) Physical
d) Network
Explanation: The network model is a database model
conceived as a flexible way of representing objects and their
relationships.
3. Which of the following schemas does define a view or views d
of the database for particular users?
a) Internal schema
b) Conceptual schema
c) Physical schema
d) External schema
Explanation: An externally-defined schema can provide access
to tables that are managed on any PostgreSQL, Microsoft SQL
Server, SAS, Oracle, or MySQL database.

4. 4. Which of the following is an attribute that can uniquely b

identify a row in a table?
a) Secondary key
 b) Candidate key
c) Foreign key
d) Alternate key
Explanation: A Candidate Key can be any column or a
combination of columns that can qualify as unique key in
database.

5. Which of the following are the process of selecting the data B

storage and data access characteristics of the database?
a) Logical database design
b) Physical database design
c) Testing and performance tuning
d) Evaluation and selecting
Explanation: The physical design of the database optimizes
performance while ensuring data integrity by avoiding
unnecessary data redundancies.

6. Which of the following terms does refer to the correctness and d

completeness of the data in a database?
a) Data security
b) Data constraint
c) Data independence
d) Data integrity
Explanation: ACID property is satisfied by transaction in
database.

7. The relationship between DEPARTMENT and EMPLOYEE is b

a
a) One-to-one relationship
b) One-to-many relationship
c) Many-to-many relationship
d) Many-to-one relationship
Explanation: One entity department is related to several
employees.

8. A table can be logically connected to another table by defining c

 a
a) Super key
b) Candidate key
c) Primary key
d) Unique key
Explanation: A superkey is a combination of attributes that can
be uniquely used to identify a database record.

9. If the state of the database no longer reflects a real state of the d

world that the database is supposed to capture, then such a
state is called
a) Consistent state
b) Parallel state
c) Durable state
d) Inconsistent state
Explanation: SQL data consistency is that whenever a
transaction is performed, it sees a consistent database.

10. 10. Ensuring isolation property is the responsibility of the b

a) Recovery-management component of the DBMS
b) Concurrency-control component of the DBMS
c) Transaction-management component of the DBMS
d) Buffer management component in DBMS
Explanation: Concurrency control ensures that correct results
for concurrent operations are generated while getting those
results as quickly as possible.

11. In query processing, the ___________ is the lowest-level c

operator to access data.
a) Index Search
b) Linear search
c) File scan
d) Access paths
Explanation: File scans are search algorithms that locate and
retrieve records that fulfill a selection condition.
12. In a ____________ the system scans each file block and tests b
all records to see whether they satisfy the selection condition.
a) Index Search
b) Linear search
c) File scan
d) Access paths
Explanation: An initial seek is required to access the first block
of the file.
13. Index structures are referred to as __________ since they d
provide a path through which data can be located and accessed.
a) Index Search
b) Linear search
c) File scan
d) Access paths
Explanation: A primary index is an index that allows the
records of a file to be read in an order that corresponds to the
physical order in the file.

14. Search algorithms that use an index are referred to as a

a) Index Search
b) Linear search
c) File scan
d) Access paths
Explanation: Selection predicates are used to guide in the
choice of the index to use in processing the query.

15. Which algorithm uses equality comparison on a key attribute a

with a primary index to retrieve a single record that satisfies
the corresponding equality condition.
a) A2
b) A4
c) A5
d) A6
Explanation: A2 – primary index, equality on key.

16. The strategy can retrieve a single record if the equality b

condition is on a key; multiple records may be retrieved if the
 indexing field is not a key is
a) A2
b) A4
c) A5
d) A6
Explanation: A4 – Secondary index, equality.

17. The algorithm that uses a secondary ordered index to guide d

retrieval for comparison conditions involving <,≤,≥, or > is
a) A2
b) A4
c) A5
d) A6
Explanation: A6 – Secondary index, comparison.

18. The ___ algorithm scans each index for pointers to tuples that C
satisfy an individual condition.
a) A2
b) A4
c) A9
d) A6
Explanation: A9 – Conjunctive selection by an intersection of
identifiers.

19. If access paths are available on all the conditions of a a

disjunctive selection, each index is scanned for pointers to
tuples that satisfy the individual condition. This is satisfied by
a) A10
b) A7
c) A9
d) A6
Explanation: A10 – Disjunctive selection by union of
identifiers.
20. Conjunctive selection using one index. This is b
a) A10
b) A7
c) A9
d) A6
Explanation: To reduce the cost of A7 we choose a i and one of
algorithms A1 through A6 for which the combination results in
the least cost for i (r ). The cost of algorithm A7 is given by the
cost of the chosen algorithm.
21. A ________ explores the space of all query evaluation plans a
that are equivalent to a given query.
a) Cost based optimizer
b) Space based optimizer
c) Time based optimizer
d) None of the mentioned
Explanation: A cost based optimizer explores the space of all
query evaluation plans that are equivalent to a given query, and
chooses the one with the least estimated cost.
22. What is the disadvantage of cost based optimizers? a
a) It is too expensive
b) It is inefficient in producing results
c) It does not perform the desired function
d) None of the mentioned
Explanation: Cost based optimizers may be expensive as
exploring space of all possible plans might prove to be costly.
23. A particular sort order is said to be _________ sort order if it a
could be useful for a later operation.
a) Interesting
b) Reusable
c) Efficient
d) Good
Explanation: A particular sort order is said to be interesting-
sort order if it could be useful for a later operation.
24. 5. State true or false: Making multiple copies of the same sub- a
expressions must be avoided
a) True
b) False
 Explanation: For promoting space efficiency, making multiple
copies of the same sub-expressions must be avoided.

25. The join orders where the right operand of each join is in one b
of the initial relations are called as ________
a) Right deep join orders
b) Left deep join orders
c) Outer join orders
d) None of the mentioned
Explanation: The join orders where the right operand of each
join is in one of the initial relations are called as left deep join
orders.

26. Optimizers use __________ to reduce the cost of optimization. c

a) Analyzers
b) Statistics
c) Heuristics
d) Caches
Explanation: Cost based optimizers may be expensive as
exploring space of all possible plans might prove to be costly.
So, optimizers use heuristics to reduce the cost of optimization.
27. Caching and reuse of query plans is called as ________ b
a) Query caching
b) Plan caching
c) Plan memorizing
d) None of the mentioned
Explanation: Caching and reuse of query plans is called as plan
caching. It is used because the optimal plan for the new
constants may differ from the optimal plan for the initial
values.

28. What technique is used for the evaluation of a query with a c

nested sub query?
a) Caching
b) Decorrelated evaluation
 c) Correlated evaluation
d) Time based evaluation
Explanation: The technique used to evaluate a query with a
nested sub query is called as correlated evaluation. It is not
very efficient as a large number of I/O operations may occur.

29. The process of replacing a nested query with a query with a b

join is known as _________
a) Correlation
b) Decorrelation
c) Cache handling
d) Join replacement

Explanation: The process of replacing a nested query with a

query with a join is known as decorrelation. It is more
complicated when the nested sub query uses aggregate
functions inside it.

30. A view whose contents are computed and stored is called as c

_______
a) Storage view
b) Backup view
c) Materialized view
d) Advanced view
Explanation: A view whose contents are computed and stored
is called as a materialized view. I does not only store the query
defining the view.
31. The task of keeping a view up to date with the underlying data b
is called as ________
a) View handling
b) View maintenance
c) View management
d) None of the mentioned
Explanation: The task of keeping a view up to date with the
underlying data is called as view maintenance.
32. What are differentials in view management? d
a) The differences between relations
b) The changes made to a relation
c) The changes made to an expression
d) More than one of the mentioned
Explanation: The changes made to a relation or and expression
are known as differentials in materialized view management.
 PRIYADARSHINI COLLEGE OF ENGINEERING,
NAGPUR
B.TECH. Fourth Semester (Artificial Intelligence & Data
Science) (C.B.C.S.) Subject: DBMS
UNIT 5

Q. MCQ Correct
No. Option

1 Collections of operations that form a single logicalunit of work

are called
a) Views
D
b) Networks
c) Units
d) Transactions
Explanation: Collections of operations that form asingle
logical unit of work are called transactions. A database system
must ensure proper execution
of transactions. 2. The “all-or-

2
The “all-or-none” property is commonly referred
to as
C
a) Isolation
b) Durability
c) Atomicity
d) None of the mentioned
 Explanation: The all or none policy is commonly referred to
as atomicity. It ensures that a work is either completed or not
completed and there areno intermediate stages

3 Which of the following is a property oftransactions?

a) Atomicity
b) Durability
c) Isolation D

d) All of the mentioned View Answer Explanation:

Atomicity, Durability and Isolation are all properties of
transaction

4 Execution of translation in isolation preserves the

of a database
a) Atomicity
b) Consistency B

c) Durability
d) All of the mentioned View Answer Explanation:Execution
of translation in isolation preserves the consistency of a
database. It ensures that no
other transaction is running concurrently

5 Which of the following is not a property of atransaction?

 a) Atomicity B
b) Simplicity
c) Isolation
d) Durability
Explanation: Simplicity is not a property of a transaction.
Atomicity, Isolation, Durability are allparts of ACID
properties
6 Which of the following systems is responsible forensuring
durability?
a) Recovery system
b) Atomic system A
c) Concurrency control system
d) Compiler system
Explanation: The recovery system is responsible for the
maintenance of durability. In addition, it also ensures
atomicity

7 Which of the following systems is responsible forensuring

isolation?
a) Recovery system C
b) Atomic system
c) Concurrency control system
d) Compiler system
 Explanation: The concurrency control system isresponsible for
ensuring isolation in a database
system

8 State true or false: Information residing in the volatile

storage does not usually survive systemcrashes
a) True
b) False A
Explanation: Information residing in the volatile storage does
not usually survive system crashes but the information in
stable storage can survivesystem crashes efficiently

9 A transaction that has not been completedsuccessfully

is called as
a) Compensating transaction
b) Aborted transaction B
c) Active transaction
d) Partially committed transaction
Explanation: Aborted transaction is a state afterthe transaction
has been rolled back and the database has been restored to the
state prior to
the transaction

10 Which of the following is not a transaction state?

a) Active
b) Partially committed D
 c) Failed
d) Compensated
Explanation: Compensated is not a transaction state. But
active, partially committed and failedare different states of a
transaction.
11 The execution sequences in concurrency controlare termed
as B
a) Serials
b) Schedules
c) Organizations
d) Ti
Explanation: The execution sequences in concurrency control
are known as schedules

12 The scheme that controls the interaction betweenexecuting

transactions is called as a)
Concurrency control scheme
b) Multiprogramming scheme
c) Serialization scheme A
d) Schedule scheme
Explanation: The scheme that controls the interaction
between executing transactions iscalled as concurrency
control scheme

13 A transaction is delimited by statements (orfunction

calls) of the form
 a) Begin transaction and end transaction
b) Start transaction and stop transaction
c) Get transaction and post transaction A

d) Read transaction and write transaction

Explanation: The transaction consists of alloperations
executed between the begin transaction and end
transaction.
14 The database system must take special actions to ensure that
transactions operate properly withoutinterference from
concurrently executing database statements. This property is C
referred to as a) Atomicity
b) Durability
c) Isolation
d) All of the mentioned
Explanation: Even though multiple transactions may execute
concurrently, the system guaranteesthat, for every pair of
transactions Ti and Tj, it appears to Ti that either Tj finished
execution before Ti started or Tj started execution after Ti
finished

15 The property of a transaction that persists all thecrashes is

a) Atomicity
 b) Durability B
c) IsolatioN
d) All of the mentioned
Explanation: After a transaction completes successfully, the
changes it has made to the database persist, even if there are
system failures.
16 states that only valid data will bewritten
to the database.
a) Consistency
b) Atomicity A
c) Durability
d) Isolation
Explanation: If for some reason, a transaction is executed that
violates the database’s consistencyrules, the entire transaction
will be rolled back and the database will be restored to a state
consistent with those rules.

17
Transaction processing is associated witheverything
below except

a) Producing detail summary or exception reports

C
b) Recording a business activity
c) Confirming an action or triggering a response d)Maintaining
a data
 Explanation: Collections of operations that form asingle
logical unit of work are called transactions.
18
The Oracle RDBMS uses the statement to declare
a new transaction start and its properties.
a) BEGIN B

b) SET TRANSACTION
c) BEGIN TRANSACTION
d) COMMIT
Explanation: Commit is used to store all thetransaction

19
If a schedule S can be transformed into a schedule
S’ by a series of swaps of non-conflicting
instructions, then S and S’ are
C
a) Non conflict equivalent
b) Equal
c) Conflict equivalent
d) Isolation equivalent
Explanation: If a schedule S can be transformed
into a schedule S’ by a series of swaps of non-
conflicting instructions, then S and S’ are conflict
equivalent. Not all serial schedules are conflict
equivalent to each other
20
A schedule is if it is conflict
equivalent to a serial schedule.

a) Conflict serializable
A
b) Conflicting
c) Non serializable
d) None of the mentioned
Explanation: A schedule is conflict serializable if itis conflict
equivalent to a serial schedule. The concept of conflict
equivalence leads to the
concept

21
The set of in a precedence graph consists of all
the transactions participating in theschedule

a) Vertices
A
b) Edges
c) Directions
d) None of the mentioned
Explanation: The set of vertices in a precedence graph consists
of all the transactions participatingin the schedule. Precedence
graph is a simple andefficient way of determining conflict
serializability
of the schedule
22
A of the transactions can be obtained by
finding a linear order consistent withthe partial order of the
precedence graph.

a) Serializability order A

b) Direction graph
c) Precedence graph
d) Scheduling scheme
Explanation: A Serializability order of the transactions can be
obtained by finding a linearorder consistent with the partial
order of the precedence graph. This process is called as
topological sorting.

23
State true or false: If I = read(Q) and J = read(Q)then the
order of I and J does not matter.
A
a) True
b) False
Explanation: If I = read(Q) and J = read(Q) then theorder of I
and J does not matter because both I
and J are read operations on the query

24
A lock that allows concurrent transactions to access different
rows of the same table is knownas a
D
a) Database-level lock
 b) Table-level lock
c) Page-level lock
d) Row-level lock
Explanation: Locks are used to maintain databaseconsistency

25
Which of the following protocols ensures conflict
serializability and safety from deadlocks?

a) Two-phase locking protocol

B
b) Time-stamp ordering protocol
c) Graph based protocol
d) None of the mentioned
Explanation: Time-stamp ordering protocol ensures
conflict serializability and safety fromdeadlocks

26
The lock allows concurrent transactions to access the same
row as long as they require the use of different fields within
that row.

a) Table-level
b) Page-level
c) Row-leveL
d) Field-level
27
Which of the following is a procedure for acquiring the
necessary locks for a transaction where all necessary locks are
acquired before anyare released?

a) Record controller D

b) Exclusive lock
c) Authorization rule
d) Two phase lock
Explanation: Two-phase lock is a procedure for acquiring the
necessary locks for a transaction where all necessary locks are
acquired before any
are released.

28
In order to reduce the overhead in retrieving therecords from
the storage space we use
B
a) Logs
b) Log buffer
c) Medieval space
d) Lower records
Explanation: The output to stable storage is inunits of
blocks
29
The order of log records in the stable storage
as the order in which they werewritten
to the log buffer.
A
a) Must be exactly the same
b) Can be different
c) Is opposite
d) Can be partially same
Explanation: As a result of log buffering, a log record may
reside in only main memory (volatile storage) for a considerable
time before it is output
to stable storage.

30
Before a block of data in main memory can be output to the
database, all log records pertainingto data in that block must
have been output to stable storage. This is C
a) Read-write logging
b) Read-ahead logging
c) Write-ahead
d) None of the mentioned
Explanation: The WAL rule requires only that theundo
information in the log has been output to stable storage, and it
permits the redo
information to be written later.
31
The policy, allows a transaction to
commit even if it has modified some blocks that have not yet
been written back to disk. B
a) Force
b) No-force
c) Steal
d) No-steal
Explanation: No-force policy allows faster commitof
transactions

32
Locks on buffer blocks are unrelated to locks usedfor
concurrency-control of transactions, and releasing them in a
non-two-phase manner does not have any implications on
transaction serializability. This is
A
a) Latches
b) Swap Space
c) Dirty Block
d) None of the mentioned
Explanation: These locks, and other similar locksthat are
held for a short duration.

33
The subsystem responsible for the allocation ofbuffer space
is called as
 a. Buffer allocator
b.Buffer manager
c.Buffer enhance
d. Buffer intermediary

34
The is the fastest and most costly formof
storage, which is relatively small; its use is managed by the
computer system hardware.

a. Cache
b. Disk
c.Main memory

d. Flash memory

35
The flash memory storage used are

a. NOR Flash
b. OR Flash
c.AND Flash d. All of the mentioned
36
The primary medium for the long-term onlinestorage of
data is the where the
entire database is stored on magnetic disk. a.
Semiconductor memory b. Magnetic disks c.Compact
disks

d. Magnetic tapes
 Optical disk systems contain a few drives and
numerous disks that can be loaded into one ofthe drives
automatically (by a robot arm) on demand.

a. Tape Storage
b. Jukebox c.Flash
memory
d. All of mentioned

37
Which function is used to return a handle to thedatabase?

a) prepareDatabase()
b) showDocCount()
A
c) executeSql()
d) openDatabase()
Explanation: prepareDatabase() function is used to return a
handle to database. It is necessary to first create the database.
showDocCount() showsthe real work after creating the
database. Syntaxof calling a JavaScript function is: function
prepareDatabase(ready, error).

38
openDatabase() method does not take theargument in D
 a) database name
b) display name
c) database version
d) server name
Explanation: openDatabase() and openDatabaseSync()
methods takes the name ofthe database, version of the
database, display name, estimated size in bytes of the data
that is to be stored in the database. openDtabase() method
works on WorkerUtils and Window,
openDatabaseSync() method works

39
Which error is invoked when
SQLTransactionCallback does not execute?

a) INVALID_ACCESS_ERR \
D
b) UNKNOWN_ERR
c) TIMEOUT_ERR
d) INVALID_STATE_ERR View
Explanation: When SQLTransactionCallback,
SQLStatementErrorCallback, SQLStatementCallback does not
execute then INVALID_STATE_ERR error is raised. This
error is
raised from inside a SQLTransactionErrorCallback.
40
Which object is created for read-only transaction?
a) Foo object
b) SQLTransactionSync B

c) DatabaseSync object
d) SQLTransaction
Explanation: For read-only transaction, we createthe object
SQLTransactionSync. If the first argument is NULL then we
throw SQLException which is Error code 0.

41 Which of the following is known as the process ofviewing

cross-tab with a fixed value of one attribute?

a) Dicing
b) Pivoting
c) Slicing
d) Both Pivoting and Dicing:
Explanation: Slice procedure takes one dimension from a cube
and turns it into a new sub-cube. Dice takes two or more
dimensions from a cube and
creates a new sub-cube from them.
42
Which of the error is raised when the quantity ofdata is too
much?
A
a) TOO_LARGE_ERR
b) UNKNOWN_ERR
c) TIMEOUT_ERR
d) QUOTA_ERR
Explanation: When the quantity of the data returned from the
database is very large then TOO_LARGE_ERR is invoked. To
minimize the datawe can use SQL “LIMIT” i.e. modifier to
reduce the
size of the resultant se

What is the required argument to openDatabase?

a) version number
A
b) database name
c) size of a database
d) text description
Explanation: The required argument to openDatabase is
version number. So it is mandatory that you should know the
version number before we try to open the database. If wedo not
pass this argument then an exception is
thrown
43
Which of the following represents a query in thetuple relational
calculus?
B
a) { }{P(t) | t }

b) {t | P(t)}
c) t | P() | t
d) All of the mentioned
Explanation: A nonprocedural query language isthe tuple
relational calculus. It specifies the needed information but
does not provide a
detailed strategy for obtaining it.

44
The logical design, and the snapshot of the data ata given
instant in time is known as?

a) Instance & Relation

D
b) Relation & Schema
c) Domain & Schema
d) Schema & Instance
Explanation: Instance is an instance of time, the relation is
also known as table consists of data with similar
characteristics, Domain is the collection of values that an
attribute can contain
and schema is a representation.
45
Which of the following functions constructhistograms and use
buckets for ranking?
A
a) Ntil()
b) Newtil()
c) Rank()
d) All of the mentioned
Explanation: ntile(n) returns the number of the bucket in which
each tuple is stored, with bucket
numbers beginning with 1

46
command is used in SQL to issue multipleCREATE
TABLE, CREATE VIEW and GRANT
statements in a single transaction. C
a) CREATE CLUSTER
b) CREATE PACKAGE
c) CREATE SCHEMA
d) All of the mentioned
Explanation: A schema is a description of a system’s structure
in a formal language supportedby the database management
system, and it refers to data organization as a blueprint for how
a db is built
47
Which of the following key is required in to handlethe data
when the encryption is applied to the data so that the
unauthorised user cannot access the data?

a) Primary key D

b) Authorised key
c) Encryption key
d) Decryption key
Explanation: The encryption key is used to encryptthe message.
Even if the message is intercepted by an enemy, the enemy will
be unable to decryptand interpret the message because he lacks
the
key
 Priyadarshini College of Engineering, Nagpur
Sessional Examination (2021-22) Even Semester
B.Tech Fourth Semester (Artificial Intelligence and Data Science )) (C.B.C.S.)
Subject : Database Management System

P.Pages:4 PCE/KS/22/BEAI-405T
Time : 1.5 Hours Max. Marks : 70

Name of Student: Branch:

Section: A Roll No.:

Note: 1. All Questions are compulsory.
2. All questions carry marks as indicated.
3. Write only one correct option in relevant column.
4. Avoid over writing.
Q. MCQ Correct CO BT Marks
No. Option

1. Which of the following refers to copies of the same data (or d CO1 1,2,3 2
information) occupying the memory space at multiple places?
a) Data responsibility b) Data inconsistency
c) Data mining d) Data redundancy
2. Which of the following refers to the level of data abstraction b CO1 1,2,3 2
that describes exactly how the data actually stored?
a) Conceptual level b) Physical level
c) File level d) Logical level
3. Which of the following is a function of the DBMS ? d CO1 1,2 2
a) Storing data b) Providing multi- users access control
c) Data integrity d) All of the above

4. The ........ is used for creating and destroying table, indexes d CO1 1,2,3 2
and other forms of structures.
a) data manipulation language b) data control language
c)transaction control language d) data definition language

5. What is TRUE about Logical Data Independence? c CO1 1,2,3 2

a) We wouldn't impact the user view of the data if we
changed the conceptual view of the data.
b) User interfaces are logically independent of data.
c)Both A and B
d) None of the above
6. Which of the following is not a type of database? d CO1 1,2 2
a) Hierarchical b) Network
c) Distributed d) Decentralized
7. The ______ can be used to explain data independence. c CO1 1,2,3 2
a) One-schema architecture b) Two-schema architecture
c) Three-schema architecture d) Four-schema architecture
8. What does an RDBMS consist of? c CO1 1,2,3 2
a) Collection of Records b) Collection of Keys
c) Collection of Tables d) Collection of Fields
9. A list of the attributes we wish to appear in the result is b CO2 1,2,3 2
displayed in ___ operation.
a) Select b) Project c) Union d) Rename
10. Which of the following in true regarding Referential c CO2 1,2,3 2
Integrity?

(A) Every primary-key value must match a primary-key value

in an associated table
(B) Every primary-key value must match a foreign-key value
in an associated table
(C) Every foreign-key value must match a primary-key value
in an associated table
(D) Every foreign-key value must match a foreign-key value
in an associated table
11. Database __________ which is the logical design of the d CO2 1,2,3 2
database, and the database_______ which is a snapshot of the
data in the database at a given instant in time.
a) Instance, Schema b) Relation, Schema
c) Relation, Domain d) Schema, Instance
12. ______ is a set of one or more attributes taken collectively to c CO2 1,2 2
uniquely identify a record.
a) Primary Key b) Foreign key
c) Super key d) Candidate key
13. Procedural language among the following is ____ c CO2 1,2 2
a) Domain relational calculus b) Tuple relational calculus
c) Relational algebra d) Query language

14. In a relational model, a cardinality is termed as d CO2 1,2,3 2

(A) Number of constraints
(B) Number of tables
(C) Number of attributes
(D) Number of tuples
15. Course(course_id,sec_id,semester) b CO2 1,2,3 2
Here the course_id,sec_id and semester are _____and course
is a __
a) Relations, Attribute b) Attributes, Relation
c) Tuple, Relation d) Tuple, Attributes
16. Which of the following represents a query in the tuple b CO2 1,2,3 2
relational calculus?
a) { }{P(t) | t }
b) {t | P(t)}
c) t | P() | t
d) All of the mentioned
17. The index consists of c CO3 1,2,3 2
(a) A list of keys (b) Pointers to the master list
(c) Both (a) and (b) (d) None of the above
18. Functional Dependencies are the types of constraints that are a CO3 1,2,3 2
based on______
a) Key b) Key revisited
c)Superset key d) None of the mentioned
19. A relation that has no partial dependencies is in which normal b CO3 1,2,3 2
form
a) First b) Second
c) Third d) BCNF
20. Which functional dependency types is/are not present in the b CO3 1,2,3 2
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
21. A relation is ………………. if every field contains only a CO3 1,2,3 2
atomic values that are, no lists or sets.
a) 1 NF
b) 2 NF
c) 3 NF
d) BCNF
22. Which of the following is a procedural language? a CO3 1,2 2
(a) Relational algebra
(b) Query language
(c) Tuple relational calculus
(d) Domain relational calculus
23. If one attribute is determinant of second, which in turn is d CO3 1,2,3 2
determinant of third, then the relation cannot be:
a) Well-structured b) 1NF
c) 2NF d) 3NF
24. When the data is organized in a ordered with a non key value c CO3 1,2,3 2
which indexing is used
a) Primary Indexing b) Secondary Indexing
c) Clustered Indexing d) All of the above
25. The activity of choosing an efficient execution strategy for b CO4 1,2,3 2
processing a query is called as
a) Query execution b) Query optimization
c) Query plan evaluation d) Query parsing
26. The concept which checks the syntax of query which is c CO4 1,2,3 2
written according to rules of the grammer is classified as
a) Query graph b) Query tree

c) Parser d) Scanner
27. The process of finding a good strategy for processing a query a CO4 1,2,3 2
is called as
a) Query optimization b) Query Processing
c) Query Management d) Query cost
28. In a _________ the system makes repeated requests for tuples a CO4 1,2,3 2
from the operation at the top of the pipeline.
a) Demand-driven pipeline b) Producer-driven pipeline
c) Demand pipeline d) All of the mentioned
29. An efficient query evaluation plan is generated by a database b CO4 1,2,3 2
system, which minimizes its costs and it is known as -
a) Query evaluation b) Query optimization
b) Query parser d) Query translation
30. A user executes a query which the ___ in the system uses to a CO4 1,2,3 2
generate the internal form of the query. In addition to
checking the syntax of the query, the ____ verifies the name
of the relation in the database, then the tuple, then the
attribute value.

A) Parser B) Translation

C) Optimization D) Evaluation

31. The cost of evaluation of query can be measured in terms of d CO4 1,2,3 2
disk access and
a) CPU time b) Distributed & parallel database system
c) cost of communication d) All of the above
32. Which of the following is a property of transactions? d CO4 1,2,3 2
a) Atomicity b) Durability
c) Isolation d) All of the mentioned
33. What are the ways of dealing with deadlock? d CO5 1,2,3 2
a) Deadlock prevention b) Deadlock recovery
c) Deadlock detection d) All of the mentioned
34. A __________ checkpoint is a checkpoint where transactions b CO5 1,2,3 2
are allowed to perform updates even while buffer blocks are
being written out.
a) Temporary b) Fuzzy c) Permanent d) Recovery

35. Which of the following is not a recovery technique? c CO5 1,2,3 2

a) Deferred update b) Immediate update
c) Two-phase commit d) Recovery management

36. If database modifications occur while the transaction is still c CO5 1,2,3 2
active, the transaction is said to use the ___________technique.
a) Deferred-modification b) Late-modification
c) Immediate-modification d) Undo
37. The _______ statement makes the updates performed by the c CO5 1,2,3 2
transaction permanent.
a) Finalize work b) Finish work
c) Commit work d) None of the mentioned

38. Which of the following is a procedure for acquiring the d CO5 1,2,3 2
necessary locks for a transaction where all necessary locks are
acquired before any are released?
a) Record controller b) Exclusive lock
c) Authorization rule d) Two phase lock
39. c CO5 1,2,3 2
Let us suppose that in a distributed database, during a
transaction T1, one of the sites, say S1, is failed. When
recovers, the site S1 has to check its log file (log based
recovery) to decide the next move on the transaction T1. If
the log contains a <T, Commit> record, what the site S1 has
to do?
a) Need not do anything b) Perform Undo
c) Perform Redo d) Abort the transaction
40. If a transaction may obtain locks but may not release any a CO5 1,2,3 2
locks then it is in _______
phase
a) Growing phase b) Shrinking phase
c) Deadlock phase d) Starved phase

Name & Signature of Paper Setter Name & Signature of HOD

Name & Signature of Moderator

 PRIYADARSHINI COLLEGE OF ENGINEERING, NAGPUR
CAT-2 Examination (2021-22) Even Semester
B.Tech. Fourth Semester (Artificial Intelligence & Data Science) (C.B.C.S.)
Subject: Database Management System

PCE/KS/22/BEAI-405T

Time : One Hour Max. Marks: 35

Name of Student: Branch:

Section:A Roll No.:

Note:
1. All questions are compulsory.

2. All questions carry marks as indicated.

3. Write only one correct option in relevant column.

4. Avoid overwriting.

Q.No. MCQ Correct CO BT Marks

Option

1. The concept which checks the syntax of query which is written according to c CO3 1,2,3 2
rules of the grammer is classified as
a) Query graph b) Query tree
c) Parser d) Scanner

2 What is/are the step(s) involved in fetching the data from the database in query d CO3 1,2,3 2
processing?
a)Parsing and translation b) Optimization
c) Evaluation d) All of the above
3. In a _________ the system makes repeated requests for tuples from the a CO3 1,2,3 2
operation at the top of the pipeline.

a) Demand-driven pipeline b) Producer-driven pipeline

c) Demand pipeline d)All of the mentioned

4. The “all-or-none” property is commonly referred to as _________? c CO4 1,2,3 2

a) Isolation b) Durability
c) Atomicity d) None of the mentioned
5. d CO4 1,2,3 2
Collections of operations that form a single logical unit of work are called
__________?
a) Views b) Networks
c) Units d) Transactions

6. d CO4 1,2,3 2
Which of the following is a property of transactions?
a) Atomicity b) Durability
c) Isolation d) All of the mentioned
7. b CO4 1,2,3 2
Which of the following makes the changes of transaction permanently in the
database ?
a) View b) Commit
c) Rollback d) Flashback
8. c CO4 1,2,3 2
The real use of the Two-phase commit protocol is ______________
 a) Deadlock will not occur b) Concurrency control can be avoided
c) Atomicity, i.e, all-or-nothing commits at all sites d) None of the above
9. Until the resource is available for execution, it will wait for the ___ transaction. b CO4 1,2,3 2
a)Newer b) Older
c) Both a and b d)None of the above
10. The log is a sequence of _________ recording all the update activities in the a CO4 1,2,3 2
database.
a) Log records b) Records
c) Entries d) Redo
11. Consider the following schedule for transaction T1, T2, T3 b CO4 1,2,3 2
T1 T2 T3

R(x)

R(y)

R(y)

W(y)

W(x)

W(x)

R(x)

W(x)

Which one of the schedule below is the correct serialization of the above
a) T2- T1- T3 b) T1- T3- T2
c) T2- T3- T1 d) T3- T1- T2
12. Which of the following is not a recovery technique? c CO4 1,2,3 2
a) Deferred Database Modification
b) Immediate Database Modification
c) Two-phase commit
d) Recovery management
13. c CO5 1,2,3 2
Let us suppose that in a distributed database, during a transaction T1, one of the
sites, say S1, is failed. When recovers, the site S1 has to check its log file (log
based recovery) to decide the next move on the transaction T1. If the log
contains a <T, Commit> record, what the site S1 has to do?
a) Need not do anything b) Perform Undo
c) Perform Redo d) Abort the transaction
14. Checkpoints are a part of a CO5 1,2,3 2
a)Recovery measures. b) Security measures.
c) Concurrency measures. d) Authorization measures.
15. If database modifications occur while the transaction is still active, the c CO5 1,2,3 2
transaction is said to use the ___________technique.
a) Deferred-modification b) Late-modification
c) Immediate-modification d) Undo
16. What is the aim of NoSQL? c CO5 1,2,3 2
a) NoSQL is not suitable for storing structured data.
b) NoSQL databases allow storing non-structured data.
c) NoSQL is a new data format to store large datasets.
d) NoSQL provides an alternative to SQL databases to store textual data.
17. 2 phase locking protocol free from a CO4 1,2,3 2
a) Deadlock b) Irrecoverability
c) Cascading rollback d) None of the above
18. Which of the following can be used to extract or filter the data & information c CO5 1,2,3
from the data warehouse?
a) Data redundancy b) Data recovery tool
c) Data mining d) Both B and C