In a modern operating system, if a process wishes to use a device: A process can directly access the device to instruct it accordingly without switching to Kernel mode.[1]  In passing data to a device, the data from the process is typically first copied to a buffer that can be read by the OS in Kernel mode. [2]  Processes access data from a character (serial) device in fixed-sized blocks of bytes.[3]  Processes transfer data to a block device as a stream of individual bits, one at a time.[4] 

Which of the following would result from doubling the block size in a multilevel indexed filesystem, assuming no other changes? Doubling of maximum file size.[1]  Decrease the average read/write time on spinning disks.[2]  Increased space efficiency / utilization.[3]  Doubling of maximum filesystem size.[4] 

Which of the following models is used to protect the confidentiality of data?

Which of the following would result from halving the block size in a multilevel indexed filesystem, assuming no other changes? Halving of maximum file size.[1]  Halving of maximum filesystem size.[2]  Decrease the average read/write time on spinning disks.[3]  Increased space efficiency / utilization (in general).[4] 

Select True or False for the following statements An access control matrix that consists of a large number of groups, and objects will take up more storage space than an access control list of the same number of groups, and objects.[1] A user at security level 2 using the Bell-Lapadula model can only read objects at level 2.[2] In asymmetric secret-key cryptography, the encryption key is always announced publicly.[3]

Which of the following are true of chained table allocation (e.g. FAT file system)? I. Files are allocated in fixed-sized blocks. [BL] II. All parts of the file are stored at contiguous addresses.  [CON] III. Chained table allocation (FAT) uses a table to track free disk space.[MA] IV. Uses index block entries to locate data. [IN]  

Select True or False for the following statements. The Short Term Scheduler is responsible for maintaining memory load.[1]  The Long Term Scheduler prevents Batch systems from being overloaded.[2]  The Medium Term Scheduler selects which process will be allocated to the CPU.[3] 

Match the page eviction algorithm to the description. 1. This algorithm proceeds in a round-robin fashion. On page fault, if the current page’s reference bit is set, it is cleared and the next page is chosen, this repeats until a page whose reference bit is not set is found. That page is then evicted.[1] 2. This algorithm uses a referenced and modified bit for each page to approximate the least recently used algorithm.[2] 3. This algorithm tracks the number of times a page is used, evicting the least recently used page.[3] 4. This algorithm uses a time window to define a working set of pages that are the most active. It then attempts to evict a page that is not in the working set, only evicting the oldest page if all pages are in the working set.[4]  

Which of the following types of IO is handled by a co-processor? Memory-Mapped (MMIO).[1] Port-Mapped (PMIO).[2] Direct Memory Access (DMA).[3] Dedicated Channels.[4]

Given the following Resource Allocation Graph, identify which processes are part of a deadlock. Note: dots indicate the number of instances of a resource.   P1.[1] P2.[2] P3.[3] P4.[4]