MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 1690 Mcqs, each offering curated multiple-choice questions to sharpen your Technical Programming knowledge and support exam preparation. Choose a topic below to get started.
| 851. |
For every pair of component and directory vnode after path name translation : |
| A. | a single NFS lookup call is used sequentially |
| B. | a single NFS lookup call is used beginning from the last component |
| C. | at least two NFS lookup calls per component are performed |
| D. | a separate NFS lookup call is performed |
| Answer» E. | |
| 852. |
_______________ in NFS involves the parsing of a path name into separate directory entries – or components. |
| A. | Path parse |
| B. | Path name parse |
| C. | Path name translation |
| D. | Path name parsing |
| Answer» D. Path name parsing | |
| 853. |
The NFS protocol, __________ concurrency control mechanisms. |
| A. | provides |
| B. | does not provide |
| C. | may provide |
| D. | none of the mentioned |
| Answer» C. may provide | |
| 854. |
A single NFS write procedure : |
| A. | can be atomic |
| B. | is atomic |
| C. | is non atomic |
| D. | none of the mentioned |
| Answer» C. is non atomic | |
| 855. |
The server must write all NFS data ___________ |
| A. | synchronously |
| B. | asynchronously |
| C. | index-wise |
| D. | none of the mentioned |
| Answer» B. asynchronously | |
| 856. |
A server crash and recovery will __________ to a client. |
| A. | be visible |
| B. | affect |
| C. | be invisible |
| D. | harm |
| Answer» D. harm | |
| 857. |
Every NFS request has a _________ allowing the server to determine if a request is duplicated or if any are missing. |
| A. | name |
| B. | transaction |
| C. | sequence number |
| D. | all of the mentioned |
| Answer» D. all of the mentioned | |
| 858. |
The NFS servers : |
| A. | are stateless |
| B. | save the current state of the request |
| C. | maybe stateless |
| D. | none of the mentioned |
| Answer» B. save the current state of the request | |
| 859. |
In UNIX, the file handle consists of a __________ and __________ |
| A. | file-system identifier & an inode number |
| B. | an inode number & FAT |
| C. | a FAT & an inode number |
| D. | a file pointer & FAT |
| Answer» B. an inode number & FAT | |
| 860. |
The server maintains a/an ________ that specifies local file systems that it exports for mounting, along with names of machines that are permitted to mount them. |
| A. | export list |
| B. | import list |
| C. | sending list |
| D. | receiving list |
| Answer» B. import list | |
| 861. |
The mount request is mapped to the corresponding _____ and is forwarded to the mount server running on the specific server machine. |
| A. | IPC |
| B. | System |
| C. | CPU |
| D. | RPC |
| Answer» C. CPU | |
| 862. |
A mount operation includes the : |
| A. | name of the network |
| B. | name of the remote directory to be mounted |
| C. | name of the server machine storing it |
| D. | all of the mentioned |
| Answer» C. name of the server machine storing it | |
| 863. |
The mount mechanism ________ a transitive property. |
| A. | exhibits |
| B. | does not exhibit |
| C. | may exhibit |
| D. | none of the mentioned |
| Answer» C. may exhibit | |
| 864. |
___________ mounts, is when a file system can be mounted over another file system, that is remotely mounted, not local. |
| A. | recursive |
| B. | cascading |
| C. | trivial |
| D. | none of the mentioned |
| Answer» C. trivial | |
| 865. |
The _________ becomes the name of the root of the newly mounted directory. |
| A. | root of the previous directory |
| B. | local directory |
| C. | remote directory itself |
| D. | none of the mentioned |
| Answer» C. remote directory itself | |
| 866. |
A _________ directory is mounted over a directory of a _______ file system. |
| A. | local, remote |
| B. | remote, local |
| C. | local, local |
| D. | none of the mentioned |
| Answer» E. | |
| 867. |
A machine in Network file system (NFS) can be ________ |
| A. | client |
| B. | server |
| C. | both client and server |
| D. | neither client nor server |
| Answer» D. neither client nor server | |
| 868. |
All the changes that were done from a transaction that did not commit before the system crashed, have to be _________ |
| A. | saved |
| B. | saved and the transaction redone |
| C. | undone |
| D. | none of the mentioned |
| Answer» D. none of the mentioned | |
| 869. |
A circular buffer : |
| A. | writes to the end of its space and then continues at the beginning |
| B. | overwrites older values as it goes |
| C. | all of the mentioned |
| D. | none of the mentioned |
| Answer» B. overwrites older values as it goes | |
| 870. |
When an entire committed transaction is completed, ___________ |
| A. | it is stored in the memory |
| B. | it is removed from the log file |
| C. | it is redone |
| D. | none of the mentioned |
| Answer» C. it is redone | |
| 871. |
Once the changes are written to the log, they are considered to be ________ |
| A. | committed |
| B. | aborted |
| C. | completed |
| D. | none of the mentioned |
| Answer» B. aborted | |
| 872. |
Each set of operations for performing a specific task is a _________ |
| A. | program |
| B. | code |
| C. | transaction |
| D. | all of the mentioned |
| Answer» D. all of the mentioned | |
| 873. |
A consistency checker __________________ and tries to fix any inconsistencies it finds. |
| A. | compares the data in the secondary storage with the data in the cache |
| B. | compares the data in the directory structure with the data blocks on disk |
| C. | compares the system generated output and user required output |
| D. | all of the mentioned |
| Answer» C. compares the system generated output and user required output | |
| 874. |
A systems program such as fsck in ______ is a consistency checker. |
| A. | UNIX |
| B. | Windows |
| C. | Macintosh |
| D. | Solaris |
| Answer» B. Windows | |
| 875. |
Some directory information is kept in main memory or cache to ___________ |
| A. | fill up the cache |
| B. | increase free space in secondary storage |
| C. | decrease free space in secondary storage |
| D. | speed up access |
| Answer» E. | |
| 876. |
With _______ a requested page and several subsequent pages are read and cached. |
| A. | write ahead |
| B. | read ahead |
| C. | free-behind |
| D. | add-front |
| Answer» C. free-behind | |
| 877. |
In the optimized technique for sequential access ___________ removes a page from the buffer as soon as the next page is requested. |
| A. | write ahead |
| B. | read ahead |
| C. | free-behind |
| D. | add-front |
| Answer» D. add-front | |
| 878. |
A file being read or written sequentially should not have its pages replaced in LRU order, because _____________ |
| A. | it is very costly |
| B. | the most recently used page will be used last |
| C. | it is not efficient |
| D. | all of the mentioned |
| Answer» C. it is not efficient | |
| 879. |
In ___________ writes, the data is stored in the cache. |
| A. | Asynchronous |
| B. | Regular |
| C. | Synchronous |
| D. | Irregular |
| Answer» B. Regular | |
| 880. |
____________ writes occur in the order in which the disk subsystem receives them, and the writes are not buffered. |
| A. | Asynchronous |
| B. | Regular |
| C. | Synchronous |
| D. | Irregular |
| Answer» D. Irregular | |
| 881. |
By preallocating the inodes and spreading them across the volume, we ___________ the system performance. |
| A. | improve |
| B. | decrease |
| C. | maintain |
| D. | do not affect |
| Answer» B. decrease | |
| 882. |
In UNIX, even an ’empty’ disk has a percentage of its space lost to ______ |
| A. | programs |
| B. | inodes |
| C. | virtual memory |
| D. | stacks |
| Answer» C. virtual memory | |
| 883. |
_______ tend to represent a major bottleneck in system performance. |
| A. | CPUs |
| B. | Disks |
| C. | Programs |
| D. | I/O |
| Answer» C. Programs | |
| 884. |
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» E. | |
| 885. |
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» B. at least two | |
| 886. |
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» D. keeps varying with | |
| 887. |
Indexed allocation _________ direct access. |
| A. | supports |
| B. | does not support |
| C. | is not related to |
| D. | none of the mentioned |
| Answer» B. does not support | |
| 888. |
Each _______ has its own index block. |
| A. | partition |
| B. | address |
| C. | file |
| D. | all of the mentioned |
| Answer» D. all of the mentioned | |
| 889. |
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» B. internal – fragmentation & external – fragmentation | |
| 890. |
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» B. linked allocation | |
| 891. |
The FAT is used much as a _________ |
| A. | stack |
| B. | linked list |
| C. | data |
| D. | pointer |
| Answer» C. data | |
| 892. |
If the extents are too large, then the problem that comes in is : |
| A. | internal fragmentation |
| B. | external fragmentation |
| C. | starvation |
| D. | all of the mentioned |
| Answer» B. external fragmentation | |
| 893. |
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» B. adding an index table to the first contiguous block | |
| 894. |
By using FAT, random access time is __________ |
| A. | the same |
| B. | increased |
| C. | decreased |
| D. | not affected |
| Answer» D. not affected | |
| 895. |
FAT stands for : |
| A. | File Attribute Transport |
| B. | File Allocation Table |
| C. | Fork At Time |
| D. | None of the mentioned |
| Answer» C. Fork At Time | |
| 896. |
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» B. only a part of the file would be affected | |
| 897. |
The major disadvantage with linked allocation is that : |
| A. | internal fragmentation |
| B. | external fragmentation |
| C. | there is no sequential access |
| D. | there is only sequential access |
| Answer» E. | |
| 898. |
There is no __________ with linked allocation. |
| A. | internal fragmentation |
| B. | external fragmentation |
| C. | starvation |
| D. | all of the mentioned |
| Answer» C. starvation | |
| 899. |
In the linked allocation, the directory contains a pointer to the : I. first block II. last block |
| A. | I only |
| B. | II only |
| C. | Both I and II |
| D. | Neither I nor II |
| Answer» D. Neither I nor II | |
| 900. |
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» B. the file gets destroyed | |