Test: File Structures- 1

Question 1

Suppose we have a block-addressable disk drive. With such block-organized disk nondata overhead of subblocks and interblock gaps have to be accounted for. There are 40000 bytes per track and the amount of space taken up/by subblocks and interblocks gaps equivalent to 250 bytes per block. A file contains records and record size is 200 bytes to be stored on the disk, if a total of 32 blocks can be stored per track then what is the blocking factor? The term "blocking factor” is used to indicate the number of records that are to the stored in each block in a file. A block is organized to hold an integral number of logical records.

Accepted Answer

5

Answer

3

Answer

4

Answer

6

Question 2

Which allocation scheme would work best for a file system implemented on a device that can only be accessed sequentially, a tape drive, for instance?

Accepted Answer

Contiguous allocation

Answer

Non Contiguous allocation

Answer

Indexed allocation

Answer

None of the above

Question 3

Consider the following statements:
S₁ : Anchor block contains first records of chain.
S₂: Anchor record is first record of a block.

Which of the above statements is/are true?

Accepted Answer

Both S₁ and S₂ are true

Answer

S1 only

Answer

S2 only

Answer

Both S₁ and S₂ are false

Question 4

Which statement is false?

Accepted Answer

In B⁺ tree, data pointer's are stored in the leaf nodes of the tree and the structure of leaf nodes is same as that of the internal nodes.

Answer

The leaf nodes of the B⁺ tree are usually linked together to provide ordered access on the search field to the records.

Answer

Most implementations of dynamic multilevel index use a variation of the B tree data structure called as B⁺ tree.

Answer

For a B⁺ tree constructed on a key, the pointers in internal nodes are tree pointers to blocks that are tree nodes.

Question 5

Which indices search key defines the sequential order of file and which indices search key specifies an order different from sequential order of file?

Accepted Answer

Primary, Secondary

Answer

Clustering, Primary

Answer

Non-clustering, Secondary

Answer

Clustering, Secondary

Question 6

Which of the following is correct?

Accepted Answer

Range queries are faster on B⁺ trees.

Answer

B tress are for storing data on disk and B⁺ trees are for main memory.

Answer

B trees are for primary indexes and B⁺ trees are for secondary indexes.

Answer

The height of a B⁺ tree is independent of the number of records.

Question 7

The order of an internal node in a B⁺ tree index is the maximum number of children it can have. Suppose that a child pointer takes 6 bytes, the search field value takes 14 bytes, and the block size is 512 bytes. What is the order of the internal node?

Accepted Answer

26

Answer

24

Answer

25

Answer

27

Question 8

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 in this index, then the maximum number of nodes that could be newly created in the process are

Accepted Answer

5

Answer

4

Answer

3

Answer

2

Question 9

In a database file structure, the search key field is 9 bytes long, the block size is 512 bytes, a record pointer is 7 bytes and a block pointer is 6 bytes. The largest possible order of a non- leaf node in a B⁺ tree implementing this file structure is

Accepted Answer

34

Answer

23

Answer

24

Answer

44

Question 10

With respect to the B+ tree index method, select the true statements

Accepted Answer

Records are physically stored in primary key order.

Answer

B⁺ trees use a hashing algorithm.

Answer

The index tree may become unbalanced as a result of updates.

Answer

None of the above

Question 11

Given a block can hold either 3 records or 10 key pointers. A database contains n records, then how many blocks do we need to hold the data file and the dense index.

Accepted Answer

Answer

n/3

Answer

n/10

Answer

n/30

Question 12

Which is the best suitable for sequential access of data?

Accepted Answer

B+ tree

Answer

B tree

Answer

Both (a) and (b)

Answer

None of these

GATE Computer Science Engineering(CSE) 2027 Test: File Structures- 1 Free

MCQ Practice Test & Solutions: Test: File Structures- 1 (12 Questions)

Which allocation scheme would work best for a file system implemented on a device that can only be accessed sequentially, a tape drive, for instance?

Consider the following statements:
S₁ : Anchor block contains first records of chain.
S₂: Anchor record is first record of a block.
Which of the above statements is/are true?

Which statement is false?

Which indices search key defines the sequential order of file and which indices search key specifies an order different from sequential order of file?

Which of the following is correct?

The order of an internal node in a B⁺ tree index is the maximum number of children it can have. Suppose that a child pointer takes 6 bytes, the search field value takes 14 bytes, and the block size is 512 bytes. What is the order of the internal node?

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 in this index, then the maximum number of nodes that could be newly created in the process are

In a database file structure, the search key field is 9 bytes long, the block size is 512 bytes, a record pointer is 7 bytes and a block pointer is 6 bytes. The largest possible order of a non- leaf node in a B⁺ tree implementing this file structure is

With respect to the B+ tree index method, select the true statements

Given a block can hold either 3 records or 10 key pointers. A database contains n records, then how many blocks do we need to hold the data file and the dense index.

Which is the best suitable for sequential access of data?

GATE Computer Science Engineering(CSE) 2027 Mock Test Series

GATE Computer Science Engineering(CSE) 2027 Mock Test Series

Top Courses for Computer Science Engineering (CSE)

Schools

Competitive Exams

International Exams

Quick Links

About this Computer Science Engineering (CSE) Practice Test

Explore more Computer Science Engineering (CSE) Study Resources

GATE Computer Science Engineering(CSE) 2027 Test: File Structures- 1 Free

MCQ Practice Test & Solutions: Test: File Structures- 1 (12 Questions)

Which allocation scheme would work best for a file system implemented on a device that can only be accessed sequentially, a tape drive, for instance?

Consider the following statements: S1 : Anchor block contains first records of chain. S2: Anchor record is first record of a block.Which of the above statements is/are true?

Which statement is false?

Which indices search key defines the sequential order of file and which indices search key specifies an order different from sequential order of file?

Which of the following is correct?

The order of an internal node in a B+ tree index is the maximum number of children it can have. Suppose that a child pointer takes 6 bytes, the search field value takes 14 bytes, and the block size is 512 bytes. What is the order of the internal node?

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 in this index, then the maximum number of nodes that could be newly created in the process are

In a database file structure, the search key field is 9 bytes long, the block size is 512 bytes, a record pointer is 7 bytes and a block pointer is 6 bytes. The largest possible order of a non- leaf node in a B+ tree implementing this file structure is

With respect to the B+ tree index method, select the true statements

Given a block can hold either 3 records or 10 key pointers. A database contains n records, then how many blocks do we need to hold the data file and the dense index.

Which is the best suitable for sequential access of data?

GATE Computer Science Engineering(CSE) 2027 Mock Test Series

GATE Computer Science Engineering(CSE) 2027 Mock Test Series

Top Courses for Computer Science Engineering (CSE)

About this Computer Science Engineering (CSE) Practice Test

Explore more Computer Science Engineering (CSE) Study Resources

Consider the following statements:
S₁ : Anchor block contains first records of chain.
S₂: Anchor record is first record of a block.
Which of the above statements is/are true?

The order of an internal node in a B⁺ tree index is the maximum number of children it can have. Suppose that a child pointer takes 6 bytes, the search field value takes 14 bytes, and the block size is 512 bytes. What is the order of the internal node?

In a database file structure, the search key field is 9 bytes long, the block size is 512 bytes, a record pointer is 7 bytes and a block pointer is 6 bytes. The largest possible order of a non- leaf node in a B⁺ tree implementing this file structure is