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.

27Papers
18Years
47Questions
1Topics

Storage, Indexing and Transactions question pattern

Every graph below is calculated only from this selection.

Questions by year

Compare question counts across years.

Difficulty distribution

How the classified questions are distributed by difficulty.

Medium 33 70.2%
Easy 12 25.5%
Hard 2 4.3%

Question type distribution

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

MCQ 35 74.5%
Numerical Answer Type (NAT) 7 14.9%
MSQ 5 10.6%

Subject weightage

Top subjects by unique question coverage.

Computer Science & Information Technology
47 Qs

Most asked topics

Top topics across the included previous year papers.

Databases
47 Qs

Subtopic coverage

Top subtopics inside this exact selection.

Storage, Indexing and Transactions
47 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
Computer Science & Information Technology (CS) 2011
1 Qs
Computer Science & Information Technology (CS) 2010
3 Qs
Computer Science & Information Technology (CS) 2009
2 Qs
Computer Science & Information Technology (CS) 2008
3 Qs
Computer Science & Information Technology (CS) 2007
2 Qs

Included previous year papers

Newest papers appear first. Search these papers or sort by year and name.

Paper nameYearPDFAttempt
Computer Science and Information Technology (CS) 20262026
2 questions in this view		2026
ExamElite PDFs
ExamElite solutions
Official documents
Official question paperOriginal authority-issued PDF Official Download Official answer keyOriginal authority-issued PDF Official Download
Computer Science & Information Technology (CS) 2025 [Session 1]2025
2 questions in this view		2025
ExamElite PDFs
ExamElite solutions
Official documents
Official question paperOriginal authority-issued PDF Official Download Official answer keyOriginal authority-issued PDF Official Download
Computer Science & Information Technology (CS) 2025 [Session 2]2025
3 questions in this view		2025
ExamElite PDFs
ExamElite solutions
Official documents
Official question paperOriginal authority-issued PDF Official Download Official answer keyOriginal authority-issued PDF Official Download
Computer Science & Information Technology (CS) 2024 [Session 1]2024
2 questions in this view		2024
ExamElite PDFs
ExamElite solutions
Official documents
Official question paperOriginal authority-issued PDF Official Download Official answer keyOriginal authority-issued PDF Official Download
Computer Science & Information Technology (CS) 2024 [Session 2]2024
3 questions in this view		2024
ExamElite PDFs
ExamElite solutions
Official documents
Official question paperOriginal authority-issued PDF Official Download Official answer keyOriginal authority-issued PDF Official Download
Computer Science & Information Technology (CS) 2023 [Session 2]2023
1 questions in this view		2023
ExamElite PDFs
ExamElite solutions
Official documents
Official question paperOriginal authority-issued PDF Official Download Official answer keyOriginal authority-issued PDF Official Download
Computer Science & Information Technology (CS) 2022 [Session 2]2022
1 questions in this view		2022
ExamElite PDFs
ExamElite solutions
Official documents
Official question paperOriginal authority-issued PDF Official Download Official answer keyOriginal authority-issued PDF Official Download
Computer Science & Information Technology (CS) 2021 [Session 1]2021
3 questions in this view		2021
ExamElite PDFs
ExamElite solutions
Official documents
Official question paperOriginal authority-issued PDF Official Download Official answer keyOriginal authority-issued PDF Official Download
Computer Science & Information Technology (CS) 2021 [Session 2]2021
2 questions in this view		2021
ExamElite PDFs
ExamElite solutions
Official documents
Official question paperOriginal authority-issued PDF Official Download Official answer keyOriginal authority-issued PDF Official Download
Computer Science & Information Technology (CS) 2020 [Session 2]2020
2 questions in this view		2020
ExamElite PDFs
ExamElite solutions
Official documents
Official question paperOriginal authority-issued PDF Official Download
Computer Science & Information Technology (CS) 2019 [Session 2]2019
2 questions in this view		2019
ExamElite PDFs
ExamElite solutions
Official documents
Official question paperOriginal authority-issued PDF Official Download
Computer Science & Information Technology (CS) 2017 [Session 2]2017
2 questions in this view		2017
ExamElite PDFs
ExamElite solutions
Official documents
Official question paperOriginal authority-issued PDF Official Download
Computer Science & Information Technology (CS) 2016 [Session 1]2016
1 questions in this view		2016
ExamElite PDFs
ExamElite solutions
Official documents
Official question paperOriginal authority-issued PDF Official Download
Computer Science & Information Technology (CS) 2016 [Session 2]2016
1 questions in this view		2016
ExamElite PDFs
ExamElite solutions
Official documents
Official question paperOriginal authority-issued PDF Official Download
Computer Science & Information Technology (CS) 2015 [Session 2]2015
1 questions in this view		2015
ExamElite PDFs
ExamElite solutions
Official documents
Official question paperOriginal authority-issued PDF Official Download
Computer Science & Information Technology (CS) 2014 [Session 1]2014
1 questions in this view		2014
ExamElite PDFs
ExamElite solutions
Official documents
Official question paperOriginal authority-issued PDF Official Download
Computer Science & Information Technology (CS) 2014 [Session 2]2014
2 questions in this view		2014
ExamElite PDFs
ExamElite solutions
Official documents
Official question paperOriginal authority-issued PDF Official Download
Computer Science & Information Technology (CS) 2014 [Session 3]2014
1 questions in this view		2014
ExamElite PDFs
ExamElite solutions
Official documents
Official question paperOriginal authority-issued PDF Official Download
Computer Science & Information Technology (CS) 2013 [Session 1]2013
1 questions in this view		2013
ExamElite PDFs
ExamElite solutions
Official documents
Official question paperOriginal authority-issued PDF Official Download
Computer Science & Information Technology (CS) 2013 [Session 2]2013
1 questions in this view		2013
ExamElite PDFs
ExamElite solutions
Official documents
Official question paperOriginal authority-issued PDF Official Download
Computer Science & Information Technology (CS) 2013 [Session 3]2013
1 questions in this view		2013
ExamElite PDFs
ExamElite solutions
Official documents
Official question paperOriginal authority-issued PDF Official Download
Computer Science & Information Technology (CS) 2013 [Session 4]2013
1 questions in this view		2013
ExamElite PDFs
ExamElite solutions
Official documents
Official question paperOriginal authority-issued PDF Official Download
Computer Science & Information Technology (CS) 20112011
1 questions in this view		2011
ExamElite PDFs
ExamElite solutions
Official documents
Official question paperOriginal authority-issued PDF Official Download
Computer Science & Information Technology (CS) 20102010
3 questions in this view		2010
ExamElite PDFs
ExamElite solutions
Official documents
Official question paperOriginal authority-issued PDF Official Download
Computer Science & Information Technology (CS) 20092009
2 questions in this view		2009
ExamElite PDFs
ExamElite solutions
Official documents
Official question paperOriginal authority-issued PDF Official Download
Computer Science & Information Technology (CS) 20082008
3 questions in this view		2008
ExamElite PDFs
ExamElite solutions
Official documents
Official question paperOriginal authority-issued PDF Official Download
Computer Science & Information Technology (CS) 20072007
2 questions in this view		2007
ExamElite PDFs
ExamElite solutions
Official documents
Official question paperOriginal authority-issued PDF Official Download

All Storage, Indexing and Transactions previous year questions

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

1
2007 · Computer Science & Information Technology · Databases · Storage, Indexing and Transactions
Computer Science & Information Technology (CS) 2007
The order of a leaf node in a B+-tree is the maximum number of (value, data record pointer) pairs it can hold. Given that the block size is 1K bytes, data record pointer is 7 bytes long, the value field is 9 bytes long and a block pointer is 6 bytes long, what is the order of the leaf node?
Open complete paper
2
2007 · Computer Science & Information Technology · Databases · Storage, Indexing and Transactions
Computer Science & Information Technology (CS) 2007
Consider the following schedules involving two transactions. Which one of the following statements is TRUE?
S1: r1(X); r1(Y); r2(X); r2(Y); w2(Y); w1(X)
S2: r1(X); r2(X); r2(Y); w2(Y); r1(Y); w1(X)
Open complete paper
3
2008 · Computer Science & Information Technology · Databases · Storage, Indexing and Transactions
Computer Science & Information Technology (CS) 2008

A clustering index is defined on the fields which are of type

Open complete paper
4
2008 · Computer Science & Information Technology · Databases · Storage, Indexing and Transactions
Computer Science & Information Technology (CS) 2008
A B-tree of order 4 is built from scratch by 10 successive insertions. What is the maximum number of node splitting operations that may take place?
Open complete paper
5
2008 · Computer Science & Information Technology · Databases · Storage, Indexing and Transactions
Computer Science & Information Technology (CS) 2008
Consider a file of 16384 records. Each record is 32 bytes long and its key field is of size 6 bytes. The file is ordered on a non-key field, and the file organization is unspanned. The file is stored in a file system with block size 1024 bytes, and the size of a block pointer is 10 bytes. If the secondary index is built on the key field of the file, and a multi-level index scheme is used to store the secondary index, the number of first-level and second-level blocks in the multi-level index are respectively
Open complete paper
6
2009 · Computer Science & Information Technology · Databases · Storage, Indexing and Transactions
Computer Science & Information Technology (CS) 2009
Consider two transactions T1 and T2, and four schedules S1, S2, S3, S4 of T1 and T2 as given below :
T1 : R1[x] W1[x] W1[y]
T2 : R2[x] R2[y] W2[y]
S1 : R1[x] R2[x] R2[y] W1[x] W1[y] W2[y]
S2 : R1[x] R2[x] R2[y] W1[x] W2[y] W1[y]
S3 : R1[x] W1[x] R2[x] W1[y] R2[y] W2[y]
S4 : R2[x] R2[y] R1[x] W1[x] W1[y] W2[y]
Which of the above schedules are conflict-serializable ?
Open complete paper
7
2009 · Computer Science & Information Technology · Databases · Storage, Indexing and Transactions
Computer Science & Information Technology (CS) 2009
The following key values are inserted into a B+ -tree in which order of the internal nodes is 3, and that of the leaf nodes is 2, in the sequence given below. The order of internal nodes is the maximum number of tree pointers in each node, and the order of leaf nodes is the maximum number of data items that can be stored in it. The B+ -tree is initially empty.
10, 3, 6, 8, 4, 2, 1
The maximum number of times leaf nodes would get split up as a result of these insertions is
Open complete paper
8
2010 · Computer Science & Information Technology · Databases · Storage, Indexing and Transactions
Computer Science & Information Technology (CS) 2010
Consider a B+-tree in which the maximum number of keys in a node is 5. What is the minimum number of keys in any non-root node?
Open complete paper
9
2010 · Computer Science & Information Technology · Databases · Storage, Indexing and Transactions
Computer Science & Information Technology (CS) 2010
Which of the following concurrency control protocols ensure both conflict serializability and freedom from deadlock?
I. 2-phase locking
II. Time-stamp ordering
Open complete paper
10
2010 · Computer Science & Information Technology · Databases · Storage, Indexing and Transactions
Computer Science & Information Technology (CS) 2010
Consider the following schedule for transactions T1, T2 and T3:
T1T2T3
Read(X)
Read(Y)
Read(Y)
Write(Y)
Write(X)
Write(X)
Read(X)
Write(X)

Which one of the schedules below is the correct serialization of the above?
Open complete paper
11
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
12
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
13
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
14
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
15
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
16
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
17
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
18
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
19
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
20
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

Showing 20 of 44 questions