Question :- By using FAT, random access time is ______

1.the same

2. increased

3.decreased

4.not affected

Question :- If each access to a file is controlled by a password, then what is the disadvantage?

1. user will need to remember a lot of passwords

2.it is not reliable

3. it is not efficient

4.All of the Mentioned

Question :- If the extents are too large, then what is the problem that comes in?internal fragmentation

1.internal fragmentation

2.external fragmentation

3. starvation

4.All of the Mentioned

Question :- In contiguous allocation _____

1.each file must occupy a set of contiguous blocks on the disk

2. each file is a linked list of disk blocks

3. all the pointers to scattered blocks are placed together in one location

4.None of the mentioned

Question :- In UNIX, groups can be created and modified by?

1. superuser

2.any user

3.a programmer only

4.the people in the group only

Question :- A better way of contiguous allocation to extend the file size is _____

1.adding an extent (another chunk of contiguous space)

2.adding an index table to the first contiguous block

3. adding pointers into the first contiguous block

4. none of the mentioned

Question :- A device driver can be thought of like a translator. Its input consists of _____ commands and output consists of _______ instructions.

1.high level, low level

2.low level, high level

3.complex, simple

4.low level, complex

Question :- A section of disk at the beginning of each partition is set aside to contain the table in ______

1.fat

2. linked allocation

3. hashed allocation

4.indexed allocation

Question :- All users in a group get _______ access to a file.

1. different

2. similar

3. same

4.None of the mentioned

Question :- Consider a disk where blocks 2, 3, 4, 5, 8, 9, 10, 11, 12, 13, 17, 18, 25, 26 and 27 are free and the rest of the blocks are allocated. Then the free space bitmap would be _______

1. 10000110000001110011111100011111…

2.110000110000001110011111100011111…

3. 01111001111110001100000011100000…

4.001111001111110001100000011100000…

Question :- Contiguous allocation has two problems _________ and _________ that linked allocation solves.

1.external – fragmentation & size – declaration

2.internal – fragmentation & external – fragmentation

3. size – declaration & internal – fragmentation

4.memory – allocation & size – declaration

Question :- Contiguous allocation of a file is defined by ______

1.disk address of the first block & length

2. length & size of the block

3. size of the block

4.total size of the file

Question :- Disks are segmented into one or more partitions, each containing a file system or ______

1.left ‘raw’

2.made into swap space

3. made into backup space

4.left ‘ripe’

Question :- Distributed naming services/Distributed information systems have been devised to ________

1.provide information about all the systems

2.provide unified access to the information needed for remote computing

3.provide unique names to all systems in a network

4.All of the Mentioned

Question :- Domain name system provides _____

1. host-name-to-network-address translations for the entire internet

2.network-address-to-host-name translations for the entire internet

3. binary to hex translations for the entire internet

4.All of the Mentioned

Question :- During compaction time, other normal system operations _______ be permitted.

1.can

2.cannot

3.is

4.None of the mentioned

Question :- Each _______ has its own index block.

1.partition

2.address

3.file

4. All of the mentioned

Question :- FAT stands for ______

1.File Attribute Transport

2. File Allocation Table

3. Fork At Time

4.None of the mentioned

Question :- For any type of access, contiguous allocation requires ______ access to get a disk block.

1.only one

2. at least two

3. exactly two

4.none of the mentioned

Question :- For each file there exists a ___________ that contains information about the file, including ownership, permissions and location of the file contents.

1.metadata

2.file control block

3.process control block

4.All of the Mentioned

Question :- For processes to request access to file contents, they need _____

1.to run a seperate program

2.special interrupts

3.to implement the open and close system calls

4. none of the mentioned

Question :- If too little space is allocated to a file _______

1. the file will not work

2.there will not be any space for the data, as the FCB takes it all

3. the file cannot be extended

4.the file cannot be opened

Question :- In indexed allocation _________

1.each file must occupy a set of contiguous blocks on the disk

2.each file is a linked list of disk blocks

3. all the pointers to scattered blocks are placed together in one location

4.None of the mentioned

Question :- In linked allocation _________

1.each file must occupy a set of contiguous blocks on the disk

2.each file is a linked list of disk blocks

3.all the pointers to scattered blocks are placed together in one location

4.None of the mentioned

Question :- In the linked allocation, the directory contains a pointer to which block? I. first block II. last block

1.I only

2. II only

3. Both I and II

4.Neither I nor II

Question :- In UNIX, the directory protection is handled _________ to the file protection.

1. different

2. similar

3. it is not handled at all

4.None of the mentioned

Question :- Indexed allocation _________ direct access.

1.supports

2.does not support

3.is not related to

4.none of the mentioned

Question :- Many systems recognize three classifications of users in connection with each file (to condense the access control list).

1.Owner

2.Group

3. Universe

4.All of the Mentioned

Question :- Metadata includes _______

1.all of the file system structure

2.contents of files

3. both file system structure and contents of files

4.none of the mentioned

Question :- One difficulty of contiguous allocation is ____

1. finding space for a new file

2.inefficient

3.costly

4.time taking

Question :- Protection is only provided at the _____ level.

1.lower

2.central

3.higher

4.None of the mentioned

Question :- Reliability of files can be increased by _______

1.keeping the files safely in the memory

2.making a different partition for the files

3.by keeping them in external storage

4.by keeping duplicate copies of the file

Question :- The FAT is used much as a _______

1.stack

2. linked list

3. data

4.pointer

Question :- The file organization module knows about ______

1.files

2. logical blocks of files

3.physical blocks of files

4.All of the Mentioned

Question :- The first fit and best fit algorithms suffer from _________

1.internal fragmentation

2.external fragmentation

3.starvation

4.All of the Mentioned

Question :- The pointer overhead of indexed allocation is generally _________ the pointer overhead of linked allocation.

1. less than

2.equal to

3.greater than

4.keeps varying with

Question :- The series of accesses between the open and close operations is a _______

1. transaction

2.procedure

3. program

4. file session

Question :- The three major methods of allocating disk space that are in wide use are _______

1. contiguous

2. linked

3.indexed

4.All of the Mentioned

Question :- The VFS (virtual file system) activates file system specific operations to handle local requests according to their _______

1.size

2.commands

3. timings

4.file system types

Question :- There is no __________ with linked allocation.

1. internal fragmentation

2.external fragmentation

3. starvation

4.All of the Mentioned

Question :- To control access the three bits used in UNIX are represented by ______

1.r

2.w

3. x

4. All of the mentioned

Question :- To solve the problem of external fragmentation ________ needs to be done periodically.

1. compaction

2.check

3. formatting

4.replacing memory

Question :- Universe consists of _______

1. all users that aren’t included in the group or owners

2.all users that are not owners

3.all users in the system

4.None of the mentioned

Question :- What if a pointer is lost or damaged in a linked allocation?

1.the entire file could get damaged

2.only a part of the file would be affected

3.there would not be any problems

4.None of the mentioned

Question :- What is the main problem with access control lists?

1.their maintenance

2.their length

3. their permissions

4.All of the Mentioned

Question :- What is the major disadvantage with a linked allocation?

1.internal fragmentation

2. external fragmentation

3. there is no sequential access

4.there is only sequential access

Question :- What is the real disadvantage of a linear list of directory entries?

1.size of the linear list in memory

2.linear search to find a file

3. it is not reliable

4.All of the Mentioned

Question :- What will happen in a multi level directory structure?

1. the same previous techniques will be used as in the other structures

2. the same previous techniques will be used as in the other structures

3. the subdirectories do not need protection once the directory is protected

4.None of the mentioned

Question :- When in contiguous allocation the space cannot be extended easily?

1.the contents of the file have to be copied to a new space, a larger hole

2. the file gets destroyed

3.the file will get formatted and lost all its data

4.none of the mentioned

Question :- ______ and ________ are the most common strategies used to select a free hole from the set of available holes.

1. First fit, Best fit

2.Worst fit, First fit

3.Best fit, Worst fit

4.None of the mentioned