Multiple Choice Questions & Answers on File system management

Multiple Choice Questions & Answers on File system management

File System Concepts MCQ

1. File type can be represented by ____________
a) file name
b) file extension
c) file identifier
d) none of the mentioned
Answer: file extension

2. Mapping of file is managed by ____________
a) file metadata
b) page table
c) virtual memory
d) file system
Answer: file metadata

3. By using the specific system call, we can ____________
a) open the file
b) read the file
c) write into the file
d) all of the mentioned
Answer: all of the mentioned

4. Mapping of network file system protocol to local file system is done by ____________
a) network file system
b) local file system
c) volume manager
d) remote mirror
Answer: network file system

5. To create a file ____________
a) allocate the space in file system
b) make an entry for new file in directory
c) allocate the space in file system & make an entry for new file in directory
d) none of the mentioned
Answer: allocate the space in file system & make an entry for new file in directory

6. ______ is a unique tag, usually a number identifies the file within the file system.
a) File identifier
b) File name
c) File type
d) None of the mentioned
Answer: File identifier

7. When will file system fragmentation occur?
a) unused space or single file are not contiguous
b) used space is not contiguous
c) unused space is non-contiguous
d) multiple files are non-contiguous
Answer: unused space or single file are not contiguous

8. Which one of the following explains the sequential file access method?
a) random access according to the given byte number
b) read bytes one at a time, in order
c) read/write sequentially by record
d) read/write randomly by record
Answer: read bytes one at a time, in order

9. What is the mounting of file system?
a) crating of a filesystem
b) deleting a filesystem
c) attaching portion of the file system into a directory structure
d) removing the portion of the file system into a directory structure
Answer: attaching portion of the file system into a directory structure

10. Which file is a sequence of bytes organized into blocks understandable by the system’s linker?
a) object file
b) source file
c) executable file
d) text file
Answer: object file

File System Implementation MCQ

1. To create a new file application program calls ____________
a) basic file system
b) logical file system
c) file-organisation module
d) none of the mentioned
Answer: logical file system

2. If the block of free-space list is free then bit will ____________
a) 1
b) 0
c) any of 0 or 1
d) none of the mentioned
Answer: 1

3. The data structure used for file directory is called ____________
a) mount table
b) hash table
c) file table
d) process table
Answer: hash table

4. A file control block contains the information about ____________
a) file ownership
b) file permissions
c) location of file contents
d) all of the mentioned
Answer: all of the mentioned

5. Management of metadata information is done by ____________
a) file-organisation module
b) logical file system
c) basic file system
d) application programs
Answer: logical file system

6. Which table contains the information about each mounted volume?
a) mount table
b) system-wide open-file table
c) per-process open-file table
d) all of the mentioned
Answer: all of the mentioned

7. Which protocol establishes the initial logical connection between a server and a client?
a) transmission control protocol
b) user datagram protocol
c) mount protocol
d) datagram congestion control protocol
Answer: mount protocol

8. What will happens when a process closes the file?
a) per-process table entry is not removed
b) system wide entry’s open count is decremented
c) all of the mentioned
d) none of the mentioned
Answer: system wide entry’s open count is decremented

9. In which type of allocation method each file occupy a set of contiguous block on the disk?
a) contiguous allocation
b) dynamic-storage allocation
c) linked allocation
d) indexed allocation
Answer: contiguous allocation

10. What is raw disk?
a) disk without file system
b) empty disk
c) disk lacking logical file system
d) disk having file system
Answer: disk without file system

File Access Methods MCQ

1. The operating system keeps a small table containing information about all open files called ____________
a) system table
b) open-file table
c) file table
d) directory table
Answer: open-file table

2. For a direct access file ____________
a) there are restrictions on the order of reading and writing
b) there are no restrictions on the order of reading and writing
c) access is restricted permission wise
d) access is not restricted permission wise
Answer: there are no restrictions on the order of reading and writing

3. The index contains ____________
a) names of all contents of file
b) pointers to each page
c) pointers to the various blocks
d) all of the mentioned
Answer: pointers to the various blocks

4. A relative block number is an index relative to ____________
a) the beginning of the file
b) the end of the file
c) the last written position in file
d) none of the mentioned
Answer: the beginning of the file

5. File attributes consist of ____________
a) name
b) type
c) identifier
d) all of the mentioned
Answer: all of the mentioned

6. System wide table in UNIX contains process independent information such as ____________
a) location of file on disk
b) access dates
c) file size
d) all of the mentioned
Answer: all of the mentioned

7. Data cannot be written to secondary storage unless written within a ______
a) file
b) swap space
c) directory
d) text format
Answer: file

8. In the sequential access method, information in the file is processed ____________
a) one disk after the other, record access doesnt matter
b) one record after the other
c) one text document after the other
d) none of the mentioned
Answer: one record after the other

9. The information about all files is kept in ____________
a) swap space
b) operating system
c) seperate directory structure
d) none of the mentioned
Answer: seperate directory structure

10. A file is a/an _______ data type.
a) abstract
b) primitive
c) public
d) private
Answer: abstract

11. The open file table has a/an _______ associated with each file.
a) file content
b) file permission
c) open count
d) close count
Answer: open count

12. The index contains pointers to the ___________
a) contents of file
b) each page
c) various blocks
d) all of the mentioned
Answer: various blocks

13. The direct access method is based on a ______ model of a file
a) magnetic tape
b) tape
c) disk
d) all of the mentioned
Answer: disk

14. The UNIX sytem uses a/an ________ stored at the beginning of a some files to indicate roughly the type of file.
a) identifier
b) extension
c) virtual number
d) magic number
Answer: magic number

15. The larger the block size, the ______ the internal fragmentation.
a) greater
b) lesser
c) same
d) none of the mentioned
Answer: greater

16. Sequential access method ______ on random access devices.
a) works well
b) doesnt work well
c) maybe works well and doesnt work well
d) none of the mentioned
Answer: works well

17. The direct access method is based on a ______ model of a file, as _____ allow random access to any file block.
a) magnetic tape, magnetic tapes
b) tape, tapes
c) disk, disks
d) all of the mentioned
Answer: disk, disks

18. Which of the following are the two parts of the file name?
a) name & identifier
b) identifier & type
c) extension & name
d) type & extension
Answer: extension & name

19. For large files, when the index itself becomes too large to be kept in memory?
a) index is called
b) an index is created for the index file
c) secondary index files are created
d) all of the mentioned
Answer: an index is created for the index file

20. In UNIX, what will the open system call return?
a) pointer to the entry in the open file table
b) pointer to the entry in the system wide table
c) a file to the process calling it
d) none of the mentioned
Answer: pointer to the entry in the open file table
 

File Directory Structure MCQ


1. When two users keep a subdirectory in their own directories, the structure being referred to is _____________
a) tree structure
b) cyclic graph directory structure
c) two level directory structure
d) acyclic graph directory
Answer: acyclic graph directory

2. When a user job starts in a two level directory system, or a user logs in _____________
a) the users user file directory is searched
b) the system’s master file directory is not searched
c) the master file directory is indexed by user name or account number, and each entry points to the UFD for that user
d) all of the mentioned
Answer: the master file directory is indexed by user name or account number, and each entry points to the UFD for that user

3. In the tree structured directories _____________
a) the tree has the stem directory
b) the tree has the leaf directory
c) the tree has the root directory
d) all of the mentioned
Answer: the tree has the root directory

4. To organise file systems on disk _______________
a) they are split into one or more partitions
b) information about files is added to each partition
c) they are made on different storage spaces
d) all of the mentioned
Answer: information about files is added to each partition

5. An absolute path name begins at the _____________
a) leaf
b) stem
c) current directory
d) root
Answer: root

6. The current directory contains, most of the files that are _____________
a) of current interest to the user
b) stored currently in the system
c) not used in the system
d) not of current interest to the system
Answer: of current interest to the user

7. When keeping a list of all the links/references to a file, and the list is empty, implies that _____________
a) the file has no copies
b) the file is deleted
c) the file is hidden
d) none of the mentioned
Answer: the file is deleted

8. With a shared file _____________
a) actual file exists
b) there are two copies of the file
c) the changes made by one person are not reflected to the other
d) the changes made by one person are reflected to the other
Answer: the changes made by one person are reflected to the other

9. When a cycle exists, the reference count maybe non zero, even when it is no longer possible to refer to a directory or file, due to _______
a) the possibility of one hidden reference
b) the possibility of two hidden references
c) the possibility of self referencing
d) none of the mentioned
Answer: the possibility of self referencing

10. A relative path name begins at the _____________
a) leaf
b) stem
c) current directory
d) root
Answer: current directory

11. The directory can be viewed as a _________ that translates file names into their directory entries.
a) symbol table
b) partition
c) swap space
d) cache
Answer: symbol table

12. The operating system _______ the links when traversing directory trees, to preserve the acyclic structure of the system.
a) considers
b) ignores
c) deletes
d) none of the mentioned
Answer: ignores

13. A tree structure ______ the sharing of files and directories.
a) allows
b) may restrict
c) restricts
d) none of the mentioned
Answer: restricts

14. The deletion of a link ________ the original file.
a) deletes
b) affects
c) does not affect
d) none of the mentioned
Answer: does not affect

15. What will happen in the single level directory?
a) All files are contained in different directories all at the same level
b) All files are contained in the same directory
c) Depends on the operating system
d) None of the mentioned
Answer: All files are contained in the same directory

16. What is the disadvantage of the two level directory structure?
a) it does not solve the name collision problem
b) it solves the name collision problem
c) it does not isolate users from one another
d) it isolates users from one another
Answer: it isolates users from one another

17. What will happen in the two level directory structure?
a) each user has his/her own user file directory
b) the system doesn’t its own master file directory
c) all of the mentioned
d) none of the mentioned
Answer: each user has his/her own user file directory

18. Which of the following are the types of Path names?
a) absolute & relative
b) local & global
c) global & relative
d) relative & local
Answer: absolute & relative

19. When a user refers to a particular file?
a) system MFD is searched
b) his own UFD is not searched
c) both MFD and UFD are searched
d) every directory is searched
Answer: both MFD and UFD are searched

20. In a tree structure, when deleting a directory that is not empty?
a) The contents of the directory are safe
b) The contents of the directory are also deleted
c) contents of the directory are not deleted
d) none of the mentioned
Answer: The contents of the directory are also deleted

21. In UNIX, what is a link?
a) a directory entry
b) a pointer to another file or subdirectory
c) implemented as an absolute or relative path name
d) all of the mentioned
Answer: all of the mentioned

22. What will happen in the single level directory?
a) all directories must have unique names
b) all files must have unique names
c) all files must have unique owners
d) all of the mentioned
Answer: all files must have unique names

file Allocation Methods MCQ

1. FAT stands for _____________
a) File Attribute Transport
b) File Allocation Table
c) Fork At Time
d) None of the mentioned
Answer: File Allocation Table

2. One difficulty of contiguous allocation is _____________
a) finding space for a new file
b) inefficient
c) costly
d) time taking
Answer: finding space for a new file

3. If too little space is allocated to a file _____________
a) the file will not work
b) there will not be any space for the data, as the FCB takes it all
c) the file cannot be extended
d) the file cannot be opened
Answer: the file cannot be extended

4. In indexed allocation _____________
a) each file must occupy a set of contiguous blocks on the disk
b) each file is a linked list of disk blocks
c) all the pointers to scattered blocks are placed together in one location
d) none of the mentioned
Answer: all the pointers to scattered blocks are placed together in one location

5. The first fit and best fit algorithms suffer from _____________
a) internal fragmentation
b) external fragmentation
c) starvation
d) all of the mentioned
Answer: external fragmentation

6. The file organization module knows about _____________
a) files
b) logical blocks of files
c) physical blocks of files
d) all of the mentioned
Answer: all of the mentioned

7. For processes to request access to file contents, they need _____________
a) to run a seperate program
b) special interrupts
c) to implement the open and close system calls
d) none of the mentioned
Answer: to implement the open and close system calls

8. Metadata includes _____________
a) all of the file system structure
b) contents of files
c) both file system structure and contents of files
d) none of the mentioned
Answer: both file system structure and contents of files

9. By using FAT, random access time is _________
a) the same
b) increased
c) decreased
d) not affected
Answer: decreased

10. The FAT is used much as a _________
a) stack
b) linked list
c) data
d) pointer
Answer: linked list

11. 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 _____________
a) 10000110000001110011111100011111…
b) 110000110000001110011111100011111…
c) 01111001111110001100000011100000…
d) 001111001111110001100000011100000…
Answer: 001111001111110001100000011100000…

12. A section of disk at the beginning of each partition is set aside to contain the table in _____________
a) fat
b) linked allocation
c) hashed allocation
d) indexed allocation
Answer: fat

13. A better way of contiguous allocation to extend the file size is _____________
a) adding an extent (another chunk of contiguous space)
b) adding an index table to the first contiguous block
c) adding pointers into the first contiguous block
d) none of the mentioned
Answer: adding an extent (another chunk of contiguous space)

14. The three major methods of allocating disk space that are in wide use are _____________
a) contiguous
b) linked
c) indexed
d) all of the mentioned
Answer: all of the mentioned

15. In linked allocation _____________
a) each file must occupy a set of contiguous blocks on the disk
b) each file is a linked list of disk blocks
c) all the pointers to scattered blocks are placed together in one location
d) none of the mentioned
Answer: each file is a linked list of disk blocks

16. In contiguous allocation _____________
a) each file must occupy a set of contiguous blocks on the disk
b) each file is a linked list of disk blocks
c) all the pointers to scattered blocks are placed together in one location
d) none of the mentioned
Answer: each file must occupy a set of contiguous blocks on the disk

17. On systems where there are multiple operating system, the decision to load a particular one is done by _____________
a) boot loader
b) bootstrap
c) process control block
d) file control block
Answer: boot loader

18. Contiguous allocation of a file is defined by _____________
a) disk address of the first block & length
b) length & size of the block
c) size of the block
d) total size of the file
Answer: disk address of the first block & length

19. The VFS (virtual file system) activates file system specific operations to handle local requests according to their _______
a) size
b) commands
c) timings
d) file system types
Answer: file system types

20. During compaction time, other normal system operations _______ be permitted.
a) can
b) cannot
c) is
d) none of the mentioned
Answer: cannot

21. To solve the problem of external fragmentation ________ needs to be done periodically.
a) compaction
b) check
c) formatting
d) replacing memory
Answer: compaction

22. For each file there exists a ___________ that contains information about the file, including ownership, permissions and location of the file contents.
a) metadata
b) file control block
c) process control block
d) all of the mentioned
Answer: file control block

23. Each _______ has its own index block.
a) partition
b) address
c) file
d) all of the mentioned
Answer: file

24. There is no __________ with linked allocation.
a) internal fragmentation
b) external fragmentation
c) starvation
d) all of the mentioned
Answer: external fragmentation

25. Indexed allocation _________ direct access.
a) supports
b) does not support
c) is not related to
d) none of the mentioned
Answer: supports

26. The pointer overhead of indexed allocation is generally _________ the pointer overhead of linked allocation.
a) less than
b) equal to
c) greater than
d) keeps varying with
Answer: greater than

27. For any type of access, contiguous allocation requires ______ access to get a disk block.
a) only one
b) at least two
c) exactly two
d) none of the mentioned
Answer: only one

28. A device driver can be thought of like a translator. Its input consists of _____ commands and output consists of _______ instructions.
a) high level, low level
b) low level, high level
c) complex, simple
d) low level, complex
Answer: high level, low level

29. _______ and ________ are the most common strategies used to select a free hole from the set of available holes.
a) First fit, Best fit
b) Worst fit, First fit
c) Best fit, Worst fit
d) None of the mentioned
Answer: First fit, Best fit

30. Contiguous allocation has two problems _________ and _________ that linked allocation solves.
a) external – fragmentation & size – declaration
b) internal – fragmentation & external – fragmentation
c) size – declaration & internal – fragmentation
d) memory – allocation & size – declaration
Answer: external – fragmentation & size – declaration

31. When in contiguous allocation the space cannot be extended easily?
a) the contents of the file have to be copied to a new space, a larger hole
b) the file gets destroyed
c) the file will get formatted and lost all its data
d) none of the mentioned
Answer: the contents of the file have to be copied to a new space, a larger hole

32. What is the real disadvantage of a linear list of directory entries?
a) size of the linear list in memory
b) linear search to find a file
c) it is not reliable
d) all of the mentioned
Answer: linear search to find a file

33. If the extents are too large, then what is the problem that comes in?
a) internal fragmentation
b) external fragmentation
c) starvation
d) all of the mentioned
Answer: internal fragmentation

33. In the linked allocation, the directory contains a pointer to which block?
I. first block
II. last block
a) I only
b) II only
c) Both I and II
d) Neither I nor II
Answer: Both I and II

34. What is the major disadvantage with a linked allocation?
a) internal fragmentation
b) external fragmentation
c) there is no sequential access
d) there is only sequential access
Answer: there is only sequential access

35. What if a pointer is lost or damaged in a linked allocation?
a) the entire file could get damaged
b) only a part of the file would be affected
c) there would not be any problems
d) none of the mentioned
Answer: the entire file could get damaged

Comments