SAQS
UNIT-III
1. What are the differences between blocking and non-blocking communication in IPC?
2. How shared memory and semaphores can be used together for process synchronization.
3. Which IPC mechanism is faster: shared memory or message passing? Why?
4. What does the shmget () function do in shared memory IPC?
5. What are the advantages and disadvantages of using IPC?
6. How can IPC be used in a real-world application?
7. Differentiate between counting and binary semaphore.
8. What are some common methods of IPC?
UNIT-IV
9. Why is address translation needed in memory management?
10. Why is swapping used?
11. What is a page fault in demand paging?
12. Which page replacement algorithm is best among the FIFO, LRU& Optimal and why? Justify your
answer.
13. Why is virtual memory beneficial?
14. How is segmentation different from paging?
15. Differentiate between internal and external fragmentation?
16. Why is LRU preferred over FIFO in many systems?
UNIT-V
17. Can a file support more than one access method?
18. List the various File Attributes
19. What is the need of File Allocation Table(FAT)
20. Differentiate between SCAN and C-SCAN?
21. What is the purpose of ioctl () system call?
22. How does grouping help in free-space management?
23. Which allocation method is best for large files with frequent random access?
24. What information does stat() provide?
25. What is the key idea behind the SCAN algorithm
LAQS
UNIT-III
1. What is a semaphore? Explain how producer-consumer problem is solved using semaphore with
an example?
2. Explain the following IPC mechanisms with an example.
(i)Pipes (ii) Shared Memory.
3, Explain the following IPC mechanisms with an example.
(i) FIFO (ii) Message Queue.
UNIT-IV
4. a)Compare Paging with Segmentation with respect to the amount of memory required by
the address translation structures in order to convert virtual addresses to physical
addresses.
b) Write a detailed note on Virtual Memory.
5. Differentiate between paging and segmentation? Explain paging concept with an example.
6. 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 With
four Frames. How many page faults would occur for the Optimal page replacement
algorithms?
7. Differentiate between paging and segmentation? Explain segmentation concept with an
example.
8. What is the need of Page Replacement? Consider the following reference string 7, 0, 1, 2, 0,
3, 0, 4, 2, 3, 0, 3, 2, 1, 2, 0, 1, 7, 0, 1. Find the number of Page Faults with LRU Page
replacement with three frames which are empty initially.
9. Calculate the number of page faults for the following reference string with three page
frames using FIFO algorithm.
Reference string is : 9, 2, 3, 1, 2, 5, 3, 4, 6, 9, 9, 1, 0, 5, 4, 6, 2, 3, 0, 1
UNIT-V
10. What is File system and what are the various File access methods? Explain
11. Suppose that a disk drive has 5000 cylinders, numbered 0 to 4999. The current head
position is at cylinder 143. The queue of pending requests is: 86, 1470, 913, 1774,
948, 1509, 1022, 1750, 130. What is the total distance that the disk arm moves to
satisfy all the pending requests for each of the following Disk scheduling algorithms?
a) SSTF b) SCAN
12. Consider a swapping system in which memory consists of the following hole sizes in
memory order: 12 KB, 4 KB, 24 KB, 15 KB, 9 KB, 7 KB, 10 KB, and 11 KB. Which
hole is taken for successive segment requests of : (i) 14 KB (ii) 8 KB (iii) 5 KB for
first fit, best fit, worst fit approaches
13. Consider a disk queue with requests for I/O to blocks on cylinders 98, 183, 41, 122,
14, 124, 65, 67. The C-SCAN scheduling algorithm is used. The head is initially at
cylinder number 53 moving towards larger cylinder numbers on its servicing pass.
The cylinders are numbered from 0 to 199. Find out the total head movements (in
number of cylinders) incurred while servicing these requests.
14. What do you mean by directory structure? Also discuss different types of directory
structures.
15. Describe linked and indexed allocation methods for files with the help of neat
diagrams.
