DEPARTMENT OF INFORMATION TECHNOLOGY

OPERATING SYSTEMS
QUESTION BANK

PART A

1) Define Swapping.
2) What you mean by Address Binding?

3) What is Logical address?

4) State the difference between logical and physical addresses.
5) What is fragmentation?
6) Define Preallocation.
7) What is Garbage collection?
8) Define Internal fragmentation

9) What is compaction?

10) Why should we use Virtual memory?

11) Under what circumstances do page faults occur?

12) What do you mean by Thrashing?

13) Describe the difference between first fit, best fit and next fit allocation strategies.
14) When will Demand paging occur?
15) What is waiting time and Response time?
16) Define Key field .
17) What is File allocation table?
18) Name the entries that make up a File Control Block.

19) List out the operations that can be performed on a directory.

20) Define Seek Time.

21) Define paging.

22) What is segmentation?
23) Mention the services of file system.

Ms.R.RAJAKUMARI AP/IT, PMU, VALLAM

24) Write the goals of disk scheduling.
25) List out the various operations of file.
26) Define disk access time and seek time.
27) Mention various file allocation techniques.
28) Write the significance of TLB.
29) Define Virtual file system.
30) Draw the structure of page table.

PART-B
1. Discuss the basic method of Segmentation and the conversion of Logical address into
physical address with necessary Hardware. (10)

2. Write short notes on Overlay. (5)

3. Discuss the First fit,Best fit and Worst fit strategies for Memory Allocation . (9)

4. Write short notes on Fragmentation. (6)

5. Discuss about Demand paging. (5)

6. Explain the free space management. (7)

7. Explain the file allocation methods (8)

8. Discuss the following page replacement algorithms, giving a suitable page reference

string.

(i) LRU (ii) FIFO (iii) Optimal (15)

9. Consider the following page-reference string:

1, 2, 3, 4, 5, 3, 4, 1, 6, 7, 8, 7, 8, 9, 7, 8, 9, 5, 4, 5, 4, 2.

Calculate the number of page faults would occur for the following page replacement
algorithms with the frame size of three.

(i) LRU (ii) FIFO (iii) Optimal (15)

Ms.R.RAJAKUMARI AP/IT, PMU, VALLAM

10. State the various attributes of a file and their purpose.Discuss the various file
operations. (10)

11. Briefly explain the Disk Management and the Swap space Management. (15)

12. Write short notes on

(i) FCFS Scheduling.

(ii)Shortest seek time first scheduling

(iii)SCAN Scheduling. (15)

13. Explain the File Allocation Methods. (15)

14. Explain the layered architecture of a file system. (15)

15. Describe different schemes for defining the logical structure of a directory. (15)

16. Discuss the I/O buffering in detail. (15)

17. What are the five fundamental file organizations? Explain them in detail. (15)

18. Explain the Operation of Translation Look aside Buffer(TLB) (8)

19. Explain the functionality of Direct Memory Access (DMA) (7)

20. What are the different types of Memory Management Techniques? Explain them in

detail. (15)

21. Explain the functions of memory management system. (15)

22. Discuss in detail the methods of segmentation. (15)

23. Describe the paging methods used in memory management systems. (15)

24. Discuss in detail the functions of thrashing (15)

25. Explain the various schemes of page replacement. (15)

26. Describe the concepts of demand paging. (15)

Ms.R.RAJAKUMARI AP/IT, PMU, VALLAM

27. Discuss in detail the various methods used in file systems (15)

28. Compare the following Disk-Scheduling Algorithms (15)

1) FIFO

2) SSTF

3) SCAN

4) C-SCAN

29. Discuss the basic method of Segmentation in detail and segmentation with paging.(20)

30. Expalin the basic method of paging technique with the details of page table and discuss
the address translation mechanism using Hardware Support. (20)
31. Write short notes on the following. (20)
i. FCFS
ii. SSTF
iii.SCAN
iv.CSCAN.
v. LOOK

ALL THE BEST !!!!!!!!!!!!!

Ms.R.RAJAKUMARI AP/IT, PMU, VALLAM