1
GATE CSE 2022
Numerical
+1
-0.33
Consider two files systems A and B, that use contiguous allocation and linked allocation, respectively. A file of size 100 blocks is already stored in A and also in B. Now, consider inserting a new block in the middle of the file (between 50th and 51st block), whose data is already available in the memory. Assume that there are enough free blocks at the end of the file and that the file control blocks are already in memory. Let the number of disk accesses required to insert a block in the midele of the file in A and B are nA and nB, respectively, then the value of nA + nB is _____________.
Your input ____
2
GATE CSE 2019
MCQ (Single Correct Answer)
+1
-0.33
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?
3
GATE CSE 2016 Set 2
MCQ (Single Correct Answer)
+1
-0.3
B+ Trees are considered BALANCED because
4
GATE CSE 2015 Set 1
MCQ (Single Correct Answer)
+1
-0.3
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 index. Then that index is called
Questions Asked from File Structures and Indexing (Marks 1)
Number in Brackets after Paper Indicates No. of Questions
GATE CSE Subjects
Theory of Computation
Operating Systems
Algorithms
Database Management System
Data Structures
Computer Networks
Software Engineering
Compiler Design
Web Technologies
General Aptitude
Discrete Mathematics
Programming Languages