| File System 1 | Cpu Scheduling Algorithms 2 |
| Network Structure Topology | Robustness |
| Types Resource Sharing | File System 2 |
| Distributed File System |
A. It keeps tracks of states of different objects
B. It maintains internally no state information at all
C. It maintains some information in them
D. None of the mentioned
A. Easier to implement
B. They are not fault-tolerant upon client or server failures
C. They store all information file server
D. They are redundant to keep data safe
A. Idempotency requirement
B. Encryption of keys
C. File locking mechanism
D. Cache consistency
A. Improves availability & performance
B. Decreases performance
C. They are consistent
D. Improves speed
A. Search for file within directory
B. Read a set of directory entries
C. Manipulate links and directories
D. All of the mentioned
A. All replicas are identical at all times
B. Replicas are perceived as identical only at some points in time
C. Users always read the most recent data in the replicas
D. All of the mentioned
A. Unix, coherent & session semantics
B. Unix, transaction & session semantics
C. Coherent, transaction & session semantics
D. Session, coherent semantics
A. Easy to implement in a single processor system
B. Data cached on a per process basis using write through case control
C. Write-back enhances access performance
D. All of the mentioned
A. Suitable for applications that are concerned about coherence of data
B. The users of this model are interested in the atomicity property for their transaction
C. Easy to implement in a single processor system
D. Write-back enhances access performance
A. Each client obtains a working copy from the server
B. When file is closed, the modified file is copied to the file server
C. The burden of coordinating file sharing is ignored by the system
D. Easy to implement in a single processor system