Only A

Only B

Both A and B

Neither A or B

Read the following statement: A serializability order of the transactions can be

obtained by finding a X consistent with the Y of the precedence graph. The correct
options for X and Y are:

linear order, partial order

partial order, Linear order

Consider two transactions T and S. S reads a data item D written by T. Now

consider the following statement: We can always construct a cascadeless
schedule by committing T before S reads D. The above statement is:

True

False

Checkpoint is a technique that can reduce recovery time after a crash. The correct
statement is:

Once a checkpoint is done, the log can be truncated.

After a system crash, the log only needs to be scanned back until the last checkpoint is found.
The log beyond the last checkpoint will not be read during the recovery process.

Checkpoint is automatically performed after every transaction commit.

 None of the above.

Indicate the correct answer:

A schedule that follows two phase locking is conflict-serializable.

Every recoverable schedule is also cascade-less.

Exclusive locks are compatible with shared locks under two-phase lock.

In strict two-phase locking protocol all locks are hold until transaction commits.

T> S

T<S

T=S

Consider the following relation R(A,B,C,D,E) and functional dependencies F that

hold over this relation. AB -> C,C -> B, AC -> DE, ABD -> E. The candidate key is/are:

{A,D} and {A,C}.

{A,B} only.

{A,D} only.

{A,B} and {A,C}.

______ describes the relationship among the stored data whereas ______ deals with
handling data structures. ______ data stored in system is functioning of ______
level.

View Level, Logical Level, How, Logical

Logical Level, Physical Level, What, View

Low Level, Logical, What, Logical

Logical Level, Physical Level, How, Physical

Select all correct statements:

All recoverable schedules are cascadeless.

Not all cascadeless schedules are recoverable.

All cascadeless schedules are nonrecoverable.

Some recoverable schedules are cascading schedules.

Select all correct answers:

A conflict serializable schedule is conflict equivalent to all serial schedules.

In 2PL protocol, the time instance of obtaining the first lock by any transaction is called the
Lock point.

In rigorous 2PL, all locks obtained by a transaction are held till that transaction commits.

2PL can prevent all cascading rollbacks.

Assume a B+- tree is of order 8. What is the minimum number of keys in any non-
root node.

3
 4

Given a database containing 80 records with each block holding 8 key pointers or
5 records, find the number of blocks to hold the datafile and dense index.

28

26

20

24

Which of the following is NOT a characteristic of No-SQL databases?

Schema Less

Relational

It may be ACID-compliant

It may not be ACID-compliant

Consider the following two statements: (A) Each superkey is a superset of some
candidate key. (B) Each primary key is also a candidate key, but not all candidate
keys are primary keys. Which of the following option is correct

Only A is correct

Only B is correct

Both A and B are correct

Neither A nor B are correct

Which of the following statements are correct about weak entity sets: (A) A weak
entity set cannot have a primary key. (B) A weak entity set must have a local
attribute in primary key. (C) A weak entity must borrow an attribute from another
entity set to form a primary key. Which of the following option is correct

A is correct

Both A and B are correct

Both B and C are correct

Only C is correct

True

False

It can be both True or False

In order for a view to be updatable, the view must be:

Views are never updatable

Views are always updatable

Defined on just one table

Defined on no more than two tables

Given relation R(A,B,C,D,E,F,G) and the set of functional dependencies F = {BCD -> A,
BC -> E, A -> F, F -> G, C -> D, A -> G}. The minimal cover of F is: (2 marks)

BC -> A, BC -> E, A -> F, F -> G, C -> D

BC -> A, BC -> E, A -> F, A -> G, C -> D

BCD -> A, BC -> E, A -> F, F -> G, C -> D, A -> G

 BCD -> A, BC -> E, A -> F

(2 marks)

H1: serializable, H2: serializable

H1: serializable, H2: non-serializable

H1: non-serializable, H2: serializable

H1: non-serializable, H2: non-serializable

(2 marks)

Only A

Only B and C
 Only A and C

A, B, and C

The count of possible conflict equivalent serial schedules for the following
precedence graph is:(2 marks)

Consider a relation with 1,000,000 tuples. 100 index entries fit on a 4KB block.
Consider a multilevel index, with primary being dense and secondary being sparse
(pointing to blocks only). What is the space required to construct this index? (2
marks)

40MB

40.4MB

10MB
 10.1MB

Consider the slotted-page structure. Each block size is N KB. Each block contains
fixed-size records of size Y bytes and header entries of size X bytes. Remember
that, only one header entry stores the total number of records present in the block
while the rest of the entries point to the corresponding records inside the block.
Given this information, what is the maximum number of records that can fit inside
a block (consider the floor operator on each of the following options.). (3 marks)

N/(X+Y)

(N-Y)/(X+Y)

(N-X)/(X+Y)

(X+Y)/N

Create your own Google Form

Report Abuse