Question 1 |
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 50^{th} \text{ and }51^{st} 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 middle of the file in A and B are n_A and n_B, respectively, then the value of n_A+n_B is
50 | |
51 | |
101 | |
153 |
Question 1 Explanation:
Question 2 |
The index node (inode) of a Unix-like file system has 12 direct, one single-indirect and one double-indirect pointer The disk block size is 4 kB and the disk block addresses 32-bits long. The maximum possible file size is (rounded off to 1 decimal place) __________ GB.
1 | |
2 | |
4 | |
8 |
Question 2 Explanation:
Question 3 |
In a file allocation system, which of the following allocation schemes(s) can be used if no external fragmentation is allowed?
I. Contiguous
II. Linked
III. Indexed
I. Contiguous
II. Linked
III. Indexed
I and III only | |
II only | |
III only | |
II and III only |
Question 3 Explanation:
Question 4 |
A FAT (file allocation table) based file system is being used and the total overhead of each
entry in the FAT is 4 bytes in size. Given a 100x10^{6} bytes disk on which the file system is
stored and data block size is 10^{3} bytes, the maximum size of a file that can be stored on this
disk in units of 10^{6} bytes is _______.
18.7 | |
99.6 | |
800 | |
112 |
Question 4 Explanation:
Question 5 |
A file system with 300 GByte disk uses a file descriptor with 8 direct block addresses, 1 indirect
block address and 1 doubly indirect block address. The size of each disk block is 128 Bytes and the
size of each disk block address is 8 Bytes. The maximum possible file size in this file system is
3 KBytes | |
35 KBytes | |
280 KBytes | |
dependent on the size of the disk |
Question 5 Explanation:
Question 6 |
Using a larger block size in a fixed block size file system leads to
better disk throughput but poorer disk space utilization | |
better disk throughput and better disk space utilization | |
poorer disk throughput but better disk space utilization | |
poorer disk throughput and poorer disk space utilization |
Question 6 Explanation:
Question 7 |
The data blocks of a very large file in the Unix file system are allocated using
contiguous allocation | |
linked allocation | |
indexed allocation | |
an extension of indexed allocation |
Question 7 Explanation:
Question 8 |
In a particular Unix OS, each data block is of size 1024 bytes, each node has 10 direct data block addresses and three additional addresses: one for single indirect block, one for double indirect block and one for triple indirect block. Also, each block can contain addresses for 128 blocks. Which one of the following is approximately the maximum size of a file in the file system?
512 MB | |
2 GB | |
8 GB | |
16 GB |
Question 8 Explanation:
Question 9 |
A unix-style I-node has 10 direct pointers and one single, one double and one triple indirect pointers.
Disk block size is 1 Kbyte, disk block address is 32 bits, and 48-bit integers are used. What is the
maximum possible file size?
2^{24}bytes | |
2^{32}bytes | |
2^{34}bytes | |
2^{48}bytes |
Question 9 Explanation:
Question 10 |
I/O redirection
implies changing the name of a file | |
can be employed to use an existing file as input file for a program | |
implies connecting 2 programs through a pipe | |
None of the above |
Question 10 Explanation:
There are 10 questions to complete.
GATE 2005 question on file system is missing?