Reference no: EM13861817

Part -1:

1. What is address binding?
2. What are the main purposes of swapping, paging, and segmentation in memory management?
3. When should an operating system designer consider using hashed paging and inverted paging instead of hierarchical paging?
4. How does an Intel architecture support both paging and segmentation?

Part -2:

1. Why is virtual memory an important feature of modern operating systems?
2. What is page replacement? How should different page replacement algorithms be chosen?
3. How are memory-mapped files used for memory sharing?

Part -3:

1. What are the different file access methods? How are they related to file organization?
2. How does access control support file sharing and file protection?

Part -4:

1. What are the drawbacks of a layered structure in a file-system implementation?
2. When would you consider designing a special file system instead of using the one distributed with an operating system?
3. What are the two most important functions of the Virtual File System (VFS) layer?
4. What are the problems associated with linked allocation of disk space routines?

Part -5:

1. What is disk attachment? Name several kinds of disk attachment, outline their differences, and outline their differences in usability.
2. What are the main disk scheduling algorithms, and how do they work?
3. What are the main tasks in disk management?
4. What are RAID levels, and how does one determine which level to use for a specific computer system?
5. What technologies are used in new tertiary storage devices?

Part -6:

1. How are data transferred between an I/O device and memory?
2. What is DMA, and why do we need it as an alternative to standard memory access systems such as programmed I/O?
3. What is the purpose of device drivers in operating systems?
4. What are the main tasks of the kernel I/O subsystem?

Part -7:

1. What are the advantages of using dynamic loading?

2. Explain the basic method for implementing paging.

3. Briefly describe the segmentation memory management scheme. How does it differ from the paging memory management scheme in terms of the user's view of memory?

4. Explain the distinction between a demand-paging system and a paging system with swapping.

5. How does the second-chance algorithm for page replacement differ from the FIFO page replacement algorithm?

6. Explain how copy-on-write operates.

7. If you were creating an operating system to handle files, what are the six basic file operations that you should implement?

8. To create a new file, an application program calls on the logical file system. Describe the steps the logical file system takes to create a file.

9. How is a hash table superior to a simple linear list structure? What issue must be handled by hash table implementation?

10. What are the factors influencing the selection of a disk-scheduling algorithm?

11. Explain the disadvantage(s) of the SSTF scheduling algorithm.

12. Explain the concepts of a bus and a daisy chain. Indicate how these concepts are related.

13. What are the three reasons that buffering is performed?