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 D
(C) DCL

1 (D) TCL

In a relational model, relations are termed as

(A) Rows

(B) Tables B
(C) Attributes

2 (D) Tuples

Which of the following is a procedural language?

(A) Relational algebra

(B) Query language A

(C) Tuple relational calculus

3 (D) Domain relational calculus

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

(A) Primary keys

(B) Foreign keys A

(C) Unique keys

4 (D) Candidate keys

In an E-R diagrams, ellipses represents

(A) Attributes

(B) Link between attributes and entity sets A

(C) Relation among entity set

5 (D) Entity set

 In a relational modes, a cardinality is termed as

(A) Number of constraints

(B) Number of tables D

(C) Number of attributes

6 (D) Number of tuples

Which of the following is not a type of database?

(A) Relational

(B) Hierarchical D
(C) Network

7 (D) Transition

The most commonly used operation in relational algebra for projecting a

set of tuple from a relation is

(A) Union

(B) Select B
(C) Projection

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

(A) Intersection

(B) Union C
(C) Join

9 (D) Select
A _____ is an abstract model that describes how the data are organised
and represented.

(A) Database

(B) Schema D
(C) Instances

10 (D) Data model

 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 B

(C) Sub key

11 (D) Candidate key

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

(C) Relational algebra

12 (D) Schematic representation

Where will we find the referential integrity command?

(A) Table

(B) Tools D
(C) Format

13 (D) None of these

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

(A) Data, information

(B) Information, reporting A

(C) Information, bits

14 (D) Records, bytes

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

(A) Data redundancy

(B) Data inconsistency B

(C) Duplicate data

15 (D) Information overload

 Which of the following is a Data Model? D
(A) Entity-Relationship model
(B) Relational data model
(C) Object-Based data model
16 (D) All of the above

Snapshot of the data in the database at a given instant of time is called B

(A) Database Schema
(B) Database Instance
(C) Database Snapshot
17 (D) All of the above

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

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

The Primary key must be C

(A) Non Null
(B) Unique
(C) Option A or B
19 (D) Option A and B

In SQL, which of the following is not a data Manipulation Language

Commands? D
(A) DELETE
(B) SELECT
(C) UPDATE
20 (D) CREATE

A transaction completes its execution is said to be D

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

Which of the following is not a Schema? C

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

Who proposed the relational model? B

(A) Bill Gates
(B) E.F. Codd
(C) Herman Hollerith
23 (D) Charles Babbage
 The index consists of C
(A) A list of keys
(B) Pointers to the master list
(C) Both (a) and (b)
24 (D) None of the above

In SQL, GRANT command is used to C

(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

In an Entity-Relationship Diagram Rectangles represents A

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

Set of permitted values of each attribute is called A

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

The attribute that can be divided into other attributes is called B

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

Database locking concept is used to solve the problem of D

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

Which of the following is Relation algebra Operation? D

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

In an Entity-Relationship Diagram “Diamonds” represents D

(A) Attributes
(B) Multi-valued attributes
(C) Weak entity set
31 (D) Relationship sets
 What are ACID properties of Transactions? B
(A) Atomicity, Consistency, Isolation, Database
(B) Atomicity, Consistency, Isolation, Durability
(C) Atomicity, Consistency, Inconsistent, Durability
32 (D) Automatically, Concurrency, Isolation, Durability

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

(A) First
(B) Second
(C) Third
33 (D) BCNF

A command to remove a relation from an SQL database B

(A) Delete table <table name>
(B) Drop table <table name>
(C) Erase table <table name>
34 (D) Alter table <table name>
Which of the following in true regarding Referential 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
(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
35 associated table

A relation is ………………. if every field contains only atomic values that are,
no lists or sets. A
A) 1 NF
B) 2 NF
C) 3 NF
36 D) BCNF

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

determinants. D
A) functional dependency
B) transitive dependency
C) 4 NF
37 D) BCNF

The rule that a value of a foreign key must appear as a value of some
specific table is called a A
A. Referential constraint
B. Index
C. Integrity constraint
38 D. Functional

Relational Algebra is C
A. Data Definition Language
B. Meta Language
C. Procedural query Language
39 D. None of the above
 Relational calculus is a B
A. Procedural language
B. Non-Procedural language
C. Data definition language
40 D. High level language

E-R model uses this symbol to represent the weak entity set? C
A. Dotted rectangle
B. Diamond
C. Doubly outlined rectangle
41 D. None of these

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

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

Which of the following is not a property of transactions? B

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

Which of the following ensures the atomicity of the transaction? A

A. Transaction management component of DBMS
B. Application Programmer
C. The concurrency control component of DBMS
44 D. Recovery management component of DBMS

……… protocol is used to perform multiple transactions that execute on a

different database. C
A. commit
B. two-phase lock
C. two-phase commit
45 D. locking

Which of the following represents a query in the tuple relational B

calculus? a) { }{P(t) | t }
b) {t | P(t)}
c) t | P() | t
46 d) All of the mentioned

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 A
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
 D
The system must create a query ____ plan before it can fully evaluate a
query.
A) Optimization B) Parser
48 C) Translation D) Evaluation

c
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

b
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

d
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

c
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

d
Which of the following is a property of transactions?
a) Atomicity b) Durability
55 c) Isolation d) All of the mentioned
 a
Checkpoints are a part of
a)Recovery measures. b) Security measures.
56 c) Concurrency measures. d) Authorization measures.

Which of the following is not a recovery technique? c

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

Transaction processing is associated with everything below except a

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
Which functional dependency types is/are not present in the following
dependencies?
Empno -> EName, Salary, Deptno, DName
DeptNo -> DName
EmpNo -> DName b
a) Full functional dependency
b) Partial functional dependency
c) Transitive functional dependency
60 d) Both B and C

Which of the following is the preferred way to recover a database after a

transaction in progress terminates abnormally? a
a.Rollback
b.Rollforward
c.Switch to duplicate database
61 d.Reprocess transactions

Database locking concept is used to solve the problem of d

a)Lost Update
b)Uncommitted Dependency
c)Inconsistent Data
62 d)All of the above
 The deadlock state can be changed back to stable state by using
_____________ statement.

a)Commit

b)Rollback b
c)Savepoint

63 d)Deadlock

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 d
c)data manipulation language

64 d)transaction log

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 a
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
65 single-user environment

A deadlock exists in the system if and only if the wait-for graph contains a
___________. a
a)Cycle
b)Direction
c)Bi-direction
66 d)Rotation

d
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
 Which of the following is not a recovery technique? c
a) Deferred update
b) Immediate update
c) Two-phase commit
69 d) Recovery management

a
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

c
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

b
The log is a sequence of _________ recording all the update activities in
the database.
a) Log records b) Records
72 c) Entries d) Redo
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 c
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

With regards to transaction processing, any DBMS should be capable of: d

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.
74 d)All of the above.

c
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

What is ACID properties of Transactions? b

a)Atomicity, Consistency, Isolation, Database
b)Atomicity, Consistency, Isolation, Durability
c)Atomicity, Consistency, Inconsistent, Durability
76 d)Automatically, Concurrency, Isolation, Durability
 d
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

A transaction completes its execution is said to be d

a)Saved
b)Loaded
c)Rolled
78 d)Committed

A transaction may not always complete its execution successfully. Such a

transaction is termed a
a)Aborted
b)Terminated
c)Closed
79 d)All of the mentioned

Locking may cause which of the following problems? b

a)Erroneous updates
b)Deadlock
c)Versioning
80 d)All of the above.

In database management system, the executing process or executing

program which considers the updating or reading of records stored in
database is called d
a)conceptualization
b)execution
c)implementation
81 d)transaction

Execution of translation in isolation preserves the _________ of a

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

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

a)Atomicity

b)Simplicity b
c)Isolation

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

Which of the following is an operation of transactions? D

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

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

A. Logically
B. Analytically
C. Reasonably
86 D. None

Writing the data from the buffer back to the database is accomplished by
using the _____ operation. B
A. Read
B. Write
C. Commit
87 D. Rollback

In a database, prior to and after a transaction, properties are used to

ensure ___. A
A. Consistency
B. Redundancy
C. Latency
88 D. Anonymity

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

A. Visible
B. Not Visible
C. Broken
89 D. Not Broken

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 D
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

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. D
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.
91 C. It enforced the isolation property via its concurrency control
 subsystem.
D. All of the above

What is TRUE about atomicity?

A. The transaction cannot be partially completed, since there is no
midway. C
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

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. C
A. Concurrent Connection
B. Concurrent Reduction
C. Concurrent Execution
93 D. Concurrent Revolution

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 ___. C
A. Consistency
B. Redundancy
C. Concurrency
94 D. None

What is TRUE about Durability?

A. The failure of the system or an error in a transaction cannot cause D
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

The concurrency ___ allows us to maintain the concurrency of the

database. C
A. Protocols
B. Controls
C. Control Protocols
96 D. None

What is the Dirty Read Problem also known as? B

A. W-W Conflict
B. W-R Conflict
C. R-R Conflict
97 D. None