[Q.46] Which synchronization primitive uses atomic wait() and signal() operations to manage concurrent resource access?
Counting/binary semaphores control shared resource access via atomic wait (P) and signal (V) operations.
[Q.47] In UNIX filesystem architecture, what information does an 'inode' store?
Inodes store file attributes and block location pointers. The filename is stored in directory entries.
[Q.48] What is external memory fragmentation?
External fragmentation leaves sufficient overall free memory fragmented into unusable small non-contiguous blocks.
[Q.49] The Dining Philosophers Problem is a classic synchronization problem used to demonstrate issues of:
Dining Philosophers illustrates resource contention leading to deadlock and starvation risks.
[Q.50] Which CPU scheduling algorithm guarantees minimum average waiting time for a given set of processes?
SJF (non-preemptive) is provably optimal for minimizing average waiting time.