Help
Options
Didn't know it?
click below
click below
Knew it?
click below
click below
Don't Know
Remaining cards (0)
Know
retry
shuffle
restart
0:00
Embed Code - If you would like this activity on your web page, copy the script below and paste it into your web page.
Normal Size Small Size show me how
Normal Size Small Size show me how
COP4610Chapter13T/F
| Question | Answer |
|---|---|
| Although caching and buffering are distinct functions, sometimes a region of memory can be used for both purposes. | True |
| A dedicated device cannot be used concurrently by several processes or threads. | True |
| STREAMS I/O is asynchronous except when the user process communicates with the stream head. | True |
| A maskable interrupt can never be disabled. | False |
| An expansion bus is used to connect relatively high speed devices to the main bus. | False |
| Tertiary storage is usually implemented as a jukebox of tapes or removable disks | True |
| Disk controllers do not usually have a built-in cache. | False |
| RAID level 0 provides no redundancy. | True |
| In Solaris, swap space is only used as a backing store for pages of anonymous memory. | True |
| LOOK disk head scheduling offers no practical benefit over SCAN disk head scheduling. | False |
| In general, LOOK disk head scheduling will involve less movement of the disk heads than SCAN disk head scheduling. | True |
| Data striping provides reliability for RAID systems. | False |
| In asynchronous replication, each block is written locally and remotely before the write is considered complete. | False |
| In most RAID implementations, a hot spare disk is not used for data, but is configured for replacement should any other disk fail. | True |
| A unified buffer cache uses the same cache for ordinary disk I/O as well as memory-mapped I/O | True |
| On log-structured file systems, all metadata and file data updates are written sequentially to a log. | False |
| On log-structured file systems, a transaction is considered complete only when it is written to disk. | False |
| VFS allows dissimilar file systems to be accessed similarly. | True |
| The WAFL file system can be used in conjunction with NFS. | True |
| A consistency checker only checks for inconsistencies, it cannot fix any that it may find. | False |
| In NTFS, the volume control block (per volume) and the directory structure (per file system) is stored in the master file table. | True |
| Metadata includes all of the file-system structure, including the actual data (or contents of the file). | False |
| Indexed allocation may require substantial overhead for its index block. | True |
| Linked allocation suffers from external fragmentation. | False |
| The NFS protocol provides concurrency-control mechanisms. | False |
| Windows systems employ mandatory locking. | True |
| On a UNIX system, writes to an open file are not immediately visible to other users who also have the same file open. | False |
| All files in a single-level directory must have unique names. | True |
| Typically, a mount point is an empty directory. | True |
| A relative path name begins at the root. | False |
| As a general rule, UNIX systems employ mandatory locks | False |
| An absolute path name must always begin at the root. | True |
| The most common approach to file protection is to make access dependent upon the identity of the user. | True |
| A file on a Solaris system with permissions -rwx--x--x+ is an example of both access-control lists as well as owner/group/universe protection. | True |
| Solaris uses both a local and global page replacement policy. | False |
| If the page-fault rate is too high, the process may have too many frames. | False |
| A page fault must be preceded by a TLB miss. | True |
| In general, virtual memory decreases the degree of multiprogramming in a system. | False |
| Only a fraction of a process's working set needs to be stored in the TLB. | False |
| Non-uniform memory access has little effect on the performance of a virtual memory system | False |
| The buddy system for allocating kernel memory is very likely to cause fragmentation within the allocated segments. | True |
| Stack algorithms can never exhibit Belady's anomaly. | True |
| On a system with demand-paging, a process will experience a high page fault rate when the process begins execution. | True |
| On systems that provide it, vfork() should always be used instead of fork(). | False |
| Hashed page tables are commonly used when handling addresses larger than 32 bits. | True |
| Hashed page tables are particularly useful for processes with sparse address spaces. | True |
| 3. There is a 1:1 correspondence between the number of entries in the TLB and the number of entries in the page table. | False |
| A relocation register is used to check for invalid memory addresses generated by a CPU. | False |
| Reentrant code cannot be shared. | False |
| Hierarchical page tables are appropriate for 64-bit architectures. | False |
| Fragmentation does not occur in a paging system. | False |
| A 32-bit logical address with 8 KB page size will have 1,000,000 entries in a conventional page table. | False |
| Inverted page tables require each process to have its own page table. | False |
| The Linux operating system does not rely on segmentation and uses it minimally. | True |
| Without a mechanism such as an address-space identifier, the TLB must be flushed during a context switch. | True |
Created by:
ohmsy