1. Consider the following page reference stream: 7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 2, 1, 2, 0, 1, 7, 0, 1. How many page faults would occur for LRU and FIFO replacement algorithms assuming 3 frames? Which one of the above is most efficient? (06 Marks) (Dec.2019/Jan.2020)

---

---

2. Explain demand paging system. (05 Marks) (Dec.2019/Jan.2020)

3. What is thrashing? How can it be controlled? (05 Marks) (Dec.2019/Jan.2020)

4. Explain briefly the various operations performed on files. (06 Marks) (Dec.2019/Jan.2020)

5. Explain the various access methods of files. (05 Marks) (Dec.2019/Jan.2020)

6. Explain various allocation methods in implementing file systems. (05 Marks) (Dec.2019/Jan.2020)

7. Illustrate how demand paging affects systems performance. (08 Marks) (June/July.2019)

---

---

8. Describe the steps in handling a page fault. (08 Marks) (June/July.2019)

9. Explain the various types of directory structures. (08 Marks) (June/July.2019)

10. Describe various file allocation methods. (08 Marks) (June/July.2019)

11. For the following page reference string 1, 2, 3, 4, 1, 2, 5, 1, 2, 3, 4, 5. Calculate the page faults using FIFO and LRU tor memory with 3 and 4 frames. (08 Marks) (Dec.2018/Jan.2019)

12. Explain demand paging in detail. (08 Marks) (Dec.2018/Jan.2019)

13. What do you mean by free space List? With suitable example, explain any 3 methods of free space list implementation. (08 Marks) (Dec.2018/Jan.2019)

14. Write short notes on linked and indexed allocation method with a neat diagram. (08 Marks) (Dec.2018/Jan.2019)

---

---

15. What is a page fault? With a supporting diagram explain the steps involved in handling page fault. (06 Marks) (June/July 2018)

16. Consider the page reference string for a memory with three frames, how many page faults will occur for FIFO, LRU and optimal page replacement algorithms. Which is most efficient?

Reference String: 7 0 1 2 0 3 0 4 2 3 0 3 2 1 2 0 1 7 0 1

(06 Marks) (June/July 2018)

17. Explain copy-on-write process in virtual memory. (04 Marks) (June/July 2018)

18. What are the different allocation methods in disk? Explain in detail any two methods. (06 Marks) (June/July 2018)

19. List the different directory structure. Explain acyclic - graph directory and tree structured directory. (07 Marks) (June/July 2018)

20. What is a file? Also list different file operations. (03 Marks) (June/July 2018)

---

---

21. Discuss the steps involved in handling page faults with diagram. (06 Marks) (Dec.2017/Jan.2018)

22. Consider the following page reference string, 7 0 1 2 0 3 0 4 2 3 0 3 2 1 2 0 1 7 0 1 for a memory with three frames. How many page faults would occur for LRU, FIFO and optimal page replacement algorithm? Which is the most efficient among them? (08 Marks) (Dec.2017/Jan.2018)

23. Explain the following (i) file types (ii) file operations (iii) file attributes (12 Marks) (Dec.2017/Jan.2018)

24. Explain the methods used for implementing directories. (08 Marks) (Dec.2017/Jan.2018)

25. What is the cause of threshing? How does the system detect thrashing? (06 Marks) (June/July.2017)

26. What is a file? Explain the different allocation methods. (10 Marks) (June/July.2017)

27. Explain different approaches to managing free space on disk storage. (10 Marks) (June/July.2017)

---

---

28. A hypothetical mam memory can store only 3 frames simultaneously. The sequence in which the pages will be required is given below: 7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 0, 3,2, 1, 2, 0,1, 7, 0, 1 (Twenty operations). Indicate the sequence in which the three frames will be filled in i) FIFO ii) Optimal Page Replacement and iii) Least Recently used methods of page replacement. Indicate number of page faults in each case. (10 Marks) (Dec.2016/Jan.2017)

29. List any five typical file attributes and any five file operations indicating their purpose in one line each. (10 Marks) (Dec.2016/Jan.2017)

30. Briefly explain the methods of keeping track of free space on disks, (10 Marks) (Dec.2016/Jan.2017)