My Cart
Your Cart 0

    Your cart is empty.

  • Total (Amount) ₹0.00
Previous year question hub

Storage, Indexing and Transactions - Databases - Computer Science & Information Technology Previous Year Questions

Practice Storage, Indexing and Transactions - Databases - Computer Science & Information Technology previous year questions organised from real papers, with year-wise coverage and clear topic navigation.

22Papers
13Years
36Questions
1Topics

Storage, Indexing and Transactions question pattern

Every graph below is calculated only from this selection.

Questions by year

Year-wise coverage for Storage, Indexing and Transactions. Each bar uses a separate theme-derived color.

Difficulty distribution

How the classified questions are distributed by difficulty.

Medium 26 72.2%
Easy 8 22.2%
Hard 2 5.6%

Question type distribution

MCQ, numerical, multiple-select and other formats found in these papers.

MCQ 24 66.7%
Numerical Answer Type (NAT) 7 19.4%
MSQ 5 13.9%

Subject weightage

Top subjects by unique question coverage.

Computer Science & Information Technology
36 Qs

Most asked topics

Top topics across the included previous year papers.

Databases
36 Qs

Subtopic coverage

Top subtopics inside this exact selection.

Storage, Indexing and Transactions
36 Qs

Paper coverage

Question coverage for the most populated papers. Every active PYP paper remains listed below.

Computer Science and Information Technology (CS) 2026
2 Qs
Computer Science & Information Technology (CS) 2025 [Session 2]
3 Qs
Computer Science & Information Technology (CS) 2025 [Session 1]
2 Qs
Computer Science & Information Technology (CS) 2024 [Session 2]
3 Qs
Computer Science & Information Technology (CS) 2024 [Session 1]
2 Qs
Computer Science & Information Technology (CS) 2023 [Session 2]
1 Qs
Computer Science & Information Technology (CS) 2022 [Session 2]
1 Qs
Computer Science & Information Technology (CS) 2021 [Session 1]
3 Qs
Computer Science & Information Technology (CS) 2021 [Session 2]
2 Qs
Computer Science & Information Technology (CS) 2020 [Session 2]
2 Qs
Computer Science & Information Technology (CS) 2019 [Session 2]
2 Qs
Computer Science & Information Technology (CS) 2017 [Session 2]
2 Qs
Computer Science & Information Technology (CS) 2016 [Session 1]
1 Qs
Computer Science & Information Technology (CS) 2016 [Session 2]
1 Qs
Computer Science & Information Technology (CS) 2015 [Session 2]
1 Qs
Computer Science & Information Technology (CS) 2014 [Session 2]
2 Qs
Computer Science & Information Technology (CS) 2014 [Session 1]
1 Qs
Computer Science & Information Technology (CS) 2014 [Session 3]
1 Qs
Computer Science & Information Technology (CS) 2013 [Session 1]
1 Qs
Computer Science & Information Technology (CS) 2013 [Session 2]
1 Qs
Computer Science & Information Technology (CS) 2013 [Session 3]
1 Qs
Computer Science & Information Technology (CS) 2013 [Session 4]
1 Qs

Included previous year papers

Newest papers appear first. Sort by year, question coverage or name.

PaperYear / sessionQuestions in this viewOpen
Computer Science and Information Technology (CS) 202620262View paper
Computer Science & Information Technology (CS) 2025 [Session 1]20252View paper
Computer Science & Information Technology (CS) 2025 [Session 2]20253View paper
Computer Science & Information Technology (CS) 2024 [Session 1]20242View paper
Computer Science & Information Technology (CS) 2024 [Session 2]20243View paper
Computer Science & Information Technology (CS) 2023 [Session 2]20231View paper
Computer Science & Information Technology (CS) 2022 [Session 2]20221View paper
Computer Science & Information Technology (CS) 2021 [Session 1]20213View paper
Computer Science & Information Technology (CS) 2021 [Session 2]20212View paper
Computer Science & Information Technology (CS) 2020 [Session 2]20202View paper
Computer Science & Information Technology (CS) 2019 [Session 2]20192View paper
Computer Science & Information Technology (CS) 2017 [Session 2]20172View paper
Computer Science & Information Technology (CS) 2016 [Session 1]20161View paper
Computer Science & Information Technology (CS) 2016 [Session 2]20161View paper
Computer Science & Information Technology (CS) 2015 [Session 2]20151View paper
Computer Science & Information Technology (CS) 2014 [Session 1]20141View paper
Computer Science & Information Technology (CS) 2014 [Session 2]20142View paper
Computer Science & Information Technology (CS) 2014 [Session 3]20141View paper
Computer Science & Information Technology (CS) 2013 [Session 1]20131View paper
Computer Science & Information Technology (CS) 2013 [Session 2]20131View paper
Computer Science & Information Technology (CS) 2013 [Session 3]20131View paper
Computer Science & Information Technology (CS) 2013 [Session 4]20131View paper

All Storage, Indexing and Transactions previous year questions

Practice every matching question in batches of 20, with every available option.

1
2013 · Computer Science & Information Technology · Databases · Storage, Indexing and Transactions
Computer Science & Information Technology (CS) 2013 [Session 1]

An index is clustered, if

Open complete paper
2
2014 · Computer Science & Information Technology · Databases · Storage, Indexing and Transactions
Computer Science & Information Technology (CS) 2014 [Session 1]
Consider the following four schedules due to three transactions (indicated by the subscript) using read and write on a data item x, denoted by \(r(x)\) and \(w(x)\) respectively. Which one of them is conflict serializable?
Open complete paper
3
2014 · Computer Science & Information Technology · Databases · Storage, Indexing and Transactions
Computer Science & Information Technology (CS) 2014 [Session 2]
Consider the following schedule S of transactions T1, T2, T3, T4:
T1T2T3T4
Reads(X)Writes(X)
Commit
Writes(X)
Commit
Writes(Y)
Reads(Z)
Commit
Reads(X)
Reads(Y)
Commit

Which one of the following statements is CORRECT?

Question diagram

Open complete paper
4
2014 · Computer Science & Information Technology · Databases · Storage, Indexing and Transactions
Computer Science & Information Technology (CS) 2014 [Session 2]
Consider a join (relation algebra) between relations r (R) and s (S) using the nested loop method. There are 3 buffers each of size equal to disk block size, out of which one buffer is reserved for intermediate results. Assuming size(r(R)) < size(s(S)), the join will have fewer number of disk block accesses if
Open complete paper
5
2014 · Computer Science & Information Technology · Databases · Storage, Indexing and Transactions
Computer Science & Information Technology (CS) 2014 [Session 3]
Consider the transactions T1, T2, and T3 and the schedules S1 and S2 given below.

T1: r1(X); r1(Z); w1(X); w1(Z)
T2: r2(Y); r2(Z); w2(Z)
T3: r3(Y); r3(X); w3(Y)

S1: r1(X); r3(Y); r3(X); r2(Y); r2(Z); w3(Y); w2(Z); r1(Z); w1(X); w1(Z)
S2: r1(X); r3(Y); r2(Y); r3(X); r1(Z); r2(Z); w3(Y); w1(X); w2(Z); w1(Z)

Which one of the following statements about the schedules is TRUE?
Open complete paper
6
2015 · Computer Science & Information Technology · Databases · Storage, Indexing and Transactions
Computer Science & Information Technology (CS) 2015 [Session 2]
Consider a simple checkpointing protocol and the following set of operations in the log.
(start, T4); (write, T4, y, 2, 3); (start, T1); (commit, T4); (write, T1, z, 5, 7);
(checkpoint);
(start, T2); (write, T2, x, 1, 9); (commit, T2); (start, T3); (write, T3, z, 7, 2);
If a crash happens now and the system tries to recover using both undo and redo operations, what are the contents of the undo list and the redo list?
(A) Undo: T3, T1; Redo: T2
(B) Undo: T3, T1; Redo: T2, T4
(C) Undo: none; Redo: T2, T4, T3, T1
(D) Undo: T3, T1, T4; Redo: T2
Open complete paper
7
2016 · Computer Science & Information Technology · Databases · Storage, Indexing and Transactions
Computer Science & Information Technology (CS) 2016 [Session 1]
Consider the following two phase locking protocol. Suppose a transaction T accesses (for read or write operations), a certain set of objects {O1,...,Ok}. This is done in the following manner:

Step 1. T acquires exclusive locks to O1,...,Ok in increasing order of their addresses.
Step 2. The required operations are performed.
Step 3. All locks are released.

This protocol will
Open complete paper
8
2016 · Computer Science & Information Technology · Databases · Storage, Indexing and Transactions
Computer Science & Information Technology (CS) 2016 [Session 2]
Consider the following two phase locking protocol. Suppose a transaction \( T \) accesses (for read or write operations), a certain set of objects \( \{O_1,\ldots,O_k\} \). This is done in the following manner:

Step 1. \( T \) acquires exclusive locks to \( O_1, \ldots, O_k \) in increasing order of their addresses.
Step 2. The required operations are performed.
Step 3. All locks are released.

This protocol will
Open complete paper
9
2017 · Computer Science & Information Technology · Databases · Storage, Indexing and Transactions
Computer Science & Information Technology (CS) 2017 [Session 2]
Two transactions \(T_1\) and \(T_2\) are given as

\(T_1: r_1(X)w_1(X)r_1(Y)w_1(Y)\)
\(T_2: r_2(Y)w_2(Y)r_2(Z)w_2(Z)\)

where \(r_i(V)\) denotes a read operation by transaction \(T_i\) on a variable \(V\) and \(w_i(V)\) denotes a write operation by transaction \(T_i\) on a variable \(V\). The total number of conflict serializable schedules that can be formed by \(T_1\) and \(T_2\) is __________.
Open complete paper
10
2017 · Computer Science & Information Technology · Databases · Storage, Indexing and Transactions
Computer Science & Information Technology (CS) 2017 [Session 2]
In a B+ tree, if the search-key value is 8 bytes long, the block size is 512 bytes and the block pointer size is 2 bytes, then the maximum order of the B+ tree is __________.
Open complete paper
11
2019 · Computer Science & Information Technology · Databases · Storage, Indexing and Transactions
Computer Science & Information Technology (CS) 2019 [Session 2]
Consider the following two statements about database transaction schedules:
I. Strict two-phase locking protocol generates conflict serializable schedules that are also recoverable.
II. Timestamp-ordering concurrency control protocol with Thomas' Write Rule can generate view serializable schedules that are not conflict serializable.
Which of the above statements is/are TRUE?
Open complete paper
12
2019 · Computer Science & Information Technology · Databases · Storage, Indexing and Transactions
Computer Science & Information Technology (CS) 2019 [Session 2]

Which one of the following statements is NOT correct about the B+ tree data structure used for creating an index of a relational database table?

Open complete paper
13
2020 · Computer Science & Information Technology · Databases · Storage, Indexing and Transactions
Computer Science & Information Technology (CS) 2020 [Session 2]
Consider a schedule of transactions \(T_1\) and \(T_2\):
\(T_1\)RARCWDWBCommit
\(T_2\)RBWBRDWCCommit

Here, RX stands for “Read(X)” and WX stands for “Write(X)”. Which one of the following schedules is conflict equivalent to the above schedule?
Open complete paper
14
2020 · Computer Science & Information Technology · Databases · Storage, Indexing and Transactions
Computer Science & Information Technology (CS) 2020 [Session 2]
Consider a database implemented using B+ tree for file indexing and installed on a disk drive with block size of 4 KB. The size of search key is 12 bytes and the size of tree/disk pointer is 8 bytes. Assume that the database has one million records. Also assume that no node of the B+ tree and no records are present initially in main memory. Consider that each record fits into one disk block. The minimum number of disk accesses required to retrieve any record in the database is __________.
Open complete paper
15
2021 · Computer Science & Information Technology · Databases · Storage, Indexing and Transactions
Computer Science & Information Technology (CS) 2021 [Session 1]
Suppose a database system crashes again while recovering from a previous crash. Assume checkpointing is not done by the database either during the transactions or during recovery. Which of the following statements is/are correct?
Open complete paper
16
2021 · Computer Science & Information Technology · Databases · Storage, Indexing and Transactions
Computer Science & Information Technology (CS) 2021 [Session 1]
Let r_i(z) and w_i(z) denote read and write operations respectively on a data item z by a transaction T_i. Consider the following two schedules. S1 : r_1(x) r_1(y) r_2(x) r_2(y) w_2(y) w_1(x) S2 : r_1(x) r_2(x) r_2(y) w_2(y) r_1(y) w_1(x) Which one of the following options is correct?
Open complete paper
17
2021 · Computer Science & Information Technology · Databases · Storage, Indexing and Transactions
Computer Science & Information Technology (CS) 2021 [Session 1]
Consider a dynamic hashing approach for 4-bit integer keys:
1. There is a main hash table of size 4.
2. The 2 least significant bits of a key is used to index into the main hash table.
3. Initially, the main hash table entries are empty.
4. Thereafter, when more keys are hashed into it, to resolve collisions, the set of all keys corresponding to a main hash table entry is organized as a binary tree that grows on demand.
5. First, the 3rd least significant bit is used to divide the keys into left and right subtrees.
6. To resolve more collisions, each node of the binary tree is further sub-divided into left and right subtrees based on the 4th least significant bit.
7. A split is done only if it is needed, i.e., only when there is a collision.
Consider the following state of the hash table.
[Image of hash table with four buckets: 00 (empty), 01 (0 left, 1 right), 10 (0 left, 0 right), 11 (1 left, 1 right)]
Which of the following sequences of key insertions can cause the above state of the hash table (assume the keys are in decimal notation)?

Question diagram

Open complete paper
18
2021 · Computer Science & Information Technology · Databases · Storage, Indexing and Transactions
Computer Science & Information Technology (CS) 2021 [Session 2]
A data file consisting of 1,50,000 student-records is stored on a hard disk with block size of 4096 bytes. The data file is sorted on the primary key RollNo. The size of a record pointer for this disk is 7 bytes. Each student-record has a candidate key attribute called ANum of size 12 bytes. Suppose an index file with records consisting of two fields, ANum value and the record pointer to the corresponding student record, is built and stored on the same disk. Assume that the records of data file and index file are not split across disk blocks. The number of blocks in the index file is __________
Open complete paper
19
2021 · Computer Science & Information Technology · Databases · Storage, Indexing and Transactions
Computer Science & Information Technology (CS) 2021 [Session 2]
Let S be the following schedule of operations of three transactions \(T_1\), \(T_2\) and \(T_3\) in a relational database system: \(R_2(Y), R_1(X), R_3(Z), R_1(Y), W_1(X), R_2(Z), W_2(Y), R_3(X), W_3(Z)\) Consider the statements P and Q below: P: S is conflict-serializable. Q: If \(T_3\) commits before \(T_1\) finishes, then S is recoverable. Which one of the following choices is correct?
Open complete paper
20
2022 · Computer Science & Information Technology · Databases · Storage, Indexing and Transactions
Computer Science & Information Technology (CS) 2022 [Session 2]
Let \(R_i(x)\) and \(W_i(x)\) denote read and write operations on a data element \(x\) by a transaction \(T_i\), respectively. Consider the schedule \(S\) with four transactions. \(S: R_4(x)R_2(x)R_3(x)R_1(y)W_1(y)W_2(x)W_3(y)W_4(x)\) Which one of the following serial schedules is conflict equivalent to \(S\)?
Open complete paper

Showing 20 of 33 questions