In the indexed scheme of blocks to a file, the maximum possible size of the file depends on:
The number of blocks used for index and the size of index
Size of Blocks and size of Address
Size of index
Size of Block
Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.33
Deadlocks situation occurs only when one of the transactions wants to obtain a(n) ____ lock on a data item.
Binary
Exclusive
Shared
Compatible
Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.33
A clustering index is defined on the fields which are of type
non-key and ordering
non-key and non-ordering
key and ordering
key and non-ordering
Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.33
Which one is true about clustered index?
Clustered index is not associated with table
Clustered index is built on physically ordered non-key columns
Clustered index is not built on unique key columns
None of the mentioned
Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.33
The maximum number of keys in a B-tree of order 3 and of height 3 is ______________
80
Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.00
Which of the following statement(s) about indexing is/are CORRECT?

S1: Indexing is used to optimize the performance of a database by minimizing the number of disk accesses required when a query is processed.

S2: Indexing is used to locate and access the data in a database table quickly.

Only S1
Only S2
Both S1 and S2
Neither S1 nor S2
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.66
Calculate the order of leaf node of a B+ tree based on the information given below

Search key field = 12 bytes

Record pointer = 10 bytes

Block pointer = 8 bytes

Block size = 1 KB

51
47
46
52
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.66
Which of the following statement(s) about B-tree/B+ tree is INCORRECT?

S1: In B Tree, Keys and record pointers both can be stored in the internal as well as leaf nodes.

S2: In B+ tree, record pointers can only be stored on the leaf nodes while internal nodes can only store the key values.

Only S1
Only S2
Both S1 and S2
Neither S1 nor S2
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.66
Suppose a database schedule S involves transactions T1, T2, ………….,Tn. Consider the precedence graph of S with vertices representing the transactions and edges representing the conflicts. If S is serializable, which one of the following orderings of the vertices of the precedence graph is guaranteed to yield a serial schedule ?
Topological order
Depth – first order
Breadth – first order
Ascending order of transaction indices
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.66
Consider the given schedule and choose the suitable option.

S = T1:R(x), T1:R(y), T1:W(x), T2:R(y), T3:W(y), T1:W(x), T2:R(y)

Schedule is view serializable
Schedule is conflict serializable but not view serializable
Schedule is view serializable but not conflict serializable
Neither view serializable nor conflict serializable
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.66
Which of the following is/are the problem(s) with concurrent execution?

  1. Lost update problem

  2. Dirty read problem

  3. Unrepeatable read problem

  4. Phantom read

  5. Incorrect summary problem

I, II and V
II, III and IV
II, III, IV and V
All I, II, III, IV and V
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.66
For the given schedule, which of the following statement(s) is (are) true?

S : r1(x);w1(x); r2(x); r1(y);w1(y);w2(x); r2(y); c1; c2;

I: S is recoverable.

II: If the order of w1(x) and w2(x) are interchanged, then S will be a non-recoverable schedule.

Only I
Only II
Both I and II
None of the above
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.66
Which of the following statements is false?
Blind writes appear in every view-serializable schedule that is not conflict serializable.
In serialization graph, an edge between two nodes exists if and only if the pair of transactions corresponding to the nodes have conflicting operations.
Every strict schedule is recoverable.
Every view serializable schedule is recoverable.
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.66
Consider the following schedule:

S : r1(y); r2(x); r2(y); r3(y);w2(x);w1(y);w3(x); r1(x)

Which of the following statements is true about the schedule S?

S is conflict serializable but not view serializable
S is neither conflict serializable nor view serializable
S is both conflict serializable as well as view serializable
S is view serializable but not conflict serializable
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.66
Consider the following schedule for transactions T1, T2 and T3:

Which one of the schedules below is the correct serialization of the above?

T1->T3->T2
T2->T1->T3
T2->T3->T1
T3->T1->T2
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.66