NEW
New Website Launch
Experience the best way to solve previous year questions with mock tests (very detailed analysis), bookmark your favourite questions, practice etc...
VISIT NOW

GATE CSE

File Structures and Indexing

Database Management System

Previous Years Questions

Marks 1

More
Consider two files systems A and B, that use contiguous allocation and linked allocation, respectively. A file of size 1...
GATE CSE 2022
Which one of the following statements is NOT correct about the B+ tree data structure used for creating an index of a re...
GATE CSE 2019
B+ Trees are considered BALANCED because
GATE CSE 2016 Set 2
With reference to the B+ tree index of order 1 shown below, the minimum number of nodes (including the Root node) that m...
GATE CSE 2015 Set 2
A file is organized so that the ordering of data records is the same as or close to the ordering of data entries in some...
GATE CSE 2015 Set 1
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-ro...
GATE CSE 2010
A clustering index is defined on the fields which are of type
GATE CSE 2008
A B-Tree used as an index for a large database table has four levels including the root node. If a new key is inserted i...
GATE CSE 2005
B+-trees are preferred to binary trees in databases because
GATE CSE 2000
Which of the following is correct?
GATE CSE 1999
There are five records in a database. .tg {border-collapse:collapse;border-spacing:0;} .tg td{font-family:Arial, sans-...
GATE CSE 1998

Marks 2

More
Consider a linear list based implementation in a file system. Each directory is a list of nodes, where each node contain...
GATE CSE 2021 Set 1
Consider a database implemented using B+ tree for file indexing and installed on a disk drive with block size of 4 KB. T...
GATE CSE 2020
Consider a B+ tree in which the search key is 12 bytes long, block size is 1024 bytes, record pointer is 10 bytes long a...
GATE CSE 2015 Set 3
The following key values are inserted into a B+-tree in which order of the internal nodes is 3, and that of the leaf nod...
GATE CSE 2009
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...
GATE CSE 2008
Consider the B+ tree in the adjoining figure, where each node has at most two keys and three links. Keys K 15 and then ...
GATE CSE 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 th...
GATE CSE 2007
Consider the B+ tree in the adjoining figure, where each node has at most two keys and three links. Now the key K 50 is...
GATE CSE 2007
Consider a table T in a relational database with a key field K. A B-tree of order p is used as an access structure on K,...
GATE CSE 2004
The order of an internal node in a B+ tree index is the maximum number of children it can have. Suppose that a child poi...
GATE CSE 2004
A B+ - tree index is to be built on the Name attribute of the relation STUDENT. Assume that all student names are of len...
GATE CSE 2002

Joint Entrance Examination

JEE Main JEE Advanced WB JEE

Graduate Aptitude Test in Engineering

GATE CSE GATE ECE GATE EE GATE ME GATE CE GATE PI GATE IN

Medical

NEET

CBSE

Class 12