wayground logo

Free Printable Worksheets

NEW

Font size

S
M
L
XL
Worksheets

Unit-IV

Total questions: 60

Worksheet time: 43mins

Name
Class
Date
1.

The scenario in which one failure leads to a set of transaction rollbacks is called as

a)

Partial schedule

b)

Complete schedule

c)

Dependent schedule

2.

State true or false: Every cascadeless schedule is also irrecoverable

a)

True

b)

False

3.

Which of the following are the disadvantages of transaction concurrency?

a)

Decreased throughput

b)

Consistency

c)

Decreased utilization

4.

Which of the following is a transaction isolation?

a)

Repeatable read

b)

Serializable

c)

Read committed

5.

The conditions for view serializability

a)

Initial read

b)

Updated read

c)

All the above

6.

When is a timestamp created for a transaction?

a)

When execution is completed

b)

When execution begins

c)

When execution is taking place

7.

In ___________each transaction gets its copy version of the database

a)

Snapshot

b)

Lock based

c)

Timestamp

8.

What is the advantage of locking?

a)

control concurrency

b)

Is not atomic

c)

Is not durable

9.

A transaction has __________ lock, it can read but cannot write on the item

a)

Exclusive mode

b)

Read only mode

c)

Shared mode

10.

A transaction has ________ lock, it can both read and write on the item

a)

Shared mode

b)

Exclusive mode

c)

Read only mode

11.

The common technique for identifying database modification is

a)

List

b)

Queue

c)

Log

12.

A ________ in log record describes a single database write

a)

Update

b)

Insert

c)

Delete

13.

A transaction modifies the database only when it has committed uses a _______ modification

technique

a)

Deferred

b)

Immediate

c)

None of the mentioned

14.

X and Y are _________ if they are operations by different transactions on the same data item,

and at least one of them is a write operation.

a)

Overwriting

b)

Conflicting

c)

Isolated

15.

A schedule X is __________ if it is conflict equivalent to a serial schedule X.

a)

Conflict serializable

b)

Conflicting

c)

Non serializable

16.

Which of the following is the most cheap method?

a)

Timestamping

b)

Plain locking

c)

Twophase locking

17.

If a transaction can be granted a lock on an item even in the presence of another lock, then

the two locks are said to be ________

a)

Concurrent

b)

Compatible

c)

Executable

18.

The __________ indicates when a transaction can lock and unlock data items

a)

Unlocking protocol

b)

Locking protocol

c)

Granting protocol

19.

If a transaction never makes progress, then the transaction is said to be ____________

a)

Overloaded

b)

Starved

c)

Committed

20.

A transaction obtained locks but did not release any locks in

a)

Shrinking phase

b)

Growing phase

c)

Deadlock phase

21.

Deadlock phase

a)

Atomicity

b)

Isomorphic

c)

Durability

22.

Which of the following systems is responsible for ensuring availability?

a)

Recovery system

b)

Atomic system

c)

Concurrency control system

23.

A transaction that has been completed successfully is called as _______

a)

Active transaction

b)

Partially committed transaction

c)

Committed transaction

24.

A system is not in a _______ state if there exists a set of transactions in which every

transaction executes

a)

Deadlock

b)

Isolated

c)

Starved

25.

Which of the following is a method in deadlock handling?

a)

Deadlock prevention

b)

Deadlock detection

c)

All

26.

Find the minimum number of keys in leaf nodes of B+ tree if it contains maximum 9 nodes

a)

9

b)

4

c)

7

27.

In which tree disk access is much slower than memory access

a)

B

b)

hash

c)

B+

28.

Find the maximum number of keys in B+ tree with orber 2 and height is 3

a)

2

b)

6

c)

7

29.

In ........ tree both leave node and internal node have same value used to locate the individual

record

a)

B+ tree

b)

hash tree

c)

b tree

30.

In multilevel indexes, the primary index is in

a)

zero level

b)

first level

c)

third level

31.

choose the correct option about indexing

a)

indexes enhance the performance even if the table is updated frequently

b)

it makes harder for sql server engines to work to work on index which have large keys

c)

it doesn’t make harder for sql server engines to work to work on index which have large

keys

32.

....... time is to find an item and delete it as well as update the index structure.

a)

deletion

b)

access

c)

insertion

33.

which method is used to organize a file in multiple ways

a)

key

b)

hash

c)

index

34.

secondary index is also named as

a)

ternary index

b)

Nonclustering index

c)

hash index

35.

A relation with more than one record with unique search key is a

a)

Non unique search key

b)

Unique search key

c)

secondary key

36.

------ is good for dynamic databases where data grows and shrinks frequently

a)

dynamic hashing

b)

static hashing

c)

open hashing

37.

Choose the various methods for collision resolution

a)

linear hashing and chaining

b)

open addressing, multiple hashing and chaining

c)

open addressing and chaining

38.

If an index is _________________ the metadata and statistics continue to exists

a)

deleting

b)

dropping

c)

disabling

39.

The Classification of security levels

a)

Secret, Confidential

b)

Top secret, secret, confidential, unclassified

c)

Confidential, unclassified

40.

Personal medical records should not be made public is

a)

Legal issue

b)

System-related issue

c)

Policy issue

41.

A security function handled at DBMS level is

a)

System-related issue

b)

Policy issue

c)

Legal issue

42.

This database security mechanism grants privileges to users

a)

Discretionary access control

b)

Mandatory Access control

c)

Token based access control

43.

The faculty and student role are given for a DBMS system by

a)

Role based access control

b)

Token based access control

c)

Mandatory Access control

44.

Which element secures data from modification?

a)

Confidentiality

b)

Integrity

c)

Accountability

45.

Which element secures data from disclosure to unauthorized access?

a)

Confidentiality

b)

Integrity

c)

Availability

46.

Which element secures data from denial of service attack?

a)

Integrity

b)

Confidentiality

c)

Availability

47.

Which of the following are data base security mechanism?

a)

Inference control, Access control, Flow control

b)

Inference control, Access control, Flow control, Encryption

c)

Access control, Inference control

48.

The user account creation in database system is done by

a)

Database Administrator

b)

Datawarehouse keeper

c)

Database Administrator

49.

The granting and revocation of privileges in database system is done by

a)

Data Analyst

b)

Database Administrator

c)

Data module coordinator

50.

Database audit examines

a)

Logs

b)

Reviews

c)

Traces

51.

The CDATA stands for

a)

Concurrent Data

b)

Character Data

c)

Connectivity Data

52.

XML files are processed by

a)

Compiler

b)

Interpreter

c)

Parser

53.

The prevention of individual's data from retrieval is supported by

a)

Statistical database

b)

Distributed systems

c)

Centralized systems

54.

Symmetric algorithms are

a)

Public key algorithm

b)

Private key algorithm

c)

None of the above

55.

Asymmetric algorithms are

a)

Public key algorithm

b)

Private key algorithm

c)

None of the above

56.

Conversion of plaintext into cipher text is

a)

Encryption

b)

Decryption

c)

Stegnography

57.

The three main aspects of security

a)

Confidentiality, Integrity, Availability

b)

Confidentiality, Integrity, Authorization

c)

Confidentiality, Integrity, Accountability

58.

The disadvantage of distributed database is

a)

Backup

b)

Data integrity

c)

Fault tolerance

59.

Hiding an image into plain text is

a)

Encoding

b)

Encryption

c)

Stegnography

60.

The use of classification attribute is

a)

Mutli level security

b)

Single level security

c)

Privilege granting