Threads, CPU scheduling algorithms, deadlock characterization and handling, memory management (paging, segmentation, demand paging) and storage management (RAID, disk scheduling). - One Line Questions

1. A 'page fault' occurs when: — A needed page is not found in main memory.
2. What is 'starvation' in the context of CPU scheduling? — A process is never selected to run.
3. A 'deadlock' is a situation where: — Two or more processes are unable to proceed because each is waiting for the other to release a resource.
4. The 'Hold and Wait' condition for deadlock means: — A process holds at least one resource and requests additional resources that are held by other processes.
5. In the context of CPU scheduling, what is 'preemption'? — The operating system interrupts a running process to allocate the CPU to another process.
6. What is the main disadvantage of the many-to-one threading model? — Blocking system calls can block the entire process.
7. In the context of threads, a 'mutex' is primarily used for: — Synchronizing access to shared resources to prevent race conditions.
8. Which of the following is a method for deadlock prevention? — Disallowing the 'Hold and Wait' condition
9. The Banker's algorithm is primarily used for: — Deadlock avoidance
10. Which of the following is a strategy for deadlock handling? — Terminating the process causing the deadlock.
11. What is the primary advantage of paging? — Eliminates external fragmentation.
12. What is a major advantage of using kernel-level threads (KLT) over user-level threads? — Can utilize multiple processors simultaneously.
13. Which scheduling algorithm is known for its fairness and is often used in time-sharing systems? — Round Robin
14. Which CPU scheduling algorithm aims to minimize the average waiting time? — Shortest Job Next (SJN)
15. Which page replacement algorithm aims to minimize the number of page faults by replacing the page that has not been used for the longest period? — Least Recently Used (LRU)
16. RAID 0 is known for: — Performance improvement through striping, but no redundancy.
17. The FIFO page replacement algorithm: — Replaces the page that has been in memory the longest.
18. What is a potential disadvantage of the SSTF algorithm? — It can lead to starvation of requests far from the current head position.
19. What is the main drawback of the First-Come, First-Served (FCFS) scheduling algorithm? — It suffers from the convoy effect.
20. What is the main disadvantage of segmentation? — It creates external fragmentation.
21. The C-SCAN (Circular-SCAN) disk scheduling algorithm differs from SCAN by: — It moves the head from one end to the other, servicing requests, and then jumps back to the beginning without servicing requests on the return trip.
22. In Priority Scheduling, a process with a higher priority number typically means: — It will be executed first.
23. What is 'demand paging'? — Loading pages into memory only when they are needed.
24. Which of the following is a characteristic of storage management? — Organizing and accessing data on secondary storage devices.
25. Which of the following is a mechanism used to implement virtual memory? — Demand Paging
26. In the SCAN disk scheduling algorithm, the disk head: — Moves in one direction, servicing all requests, then reverses direction.
27. Which of the following is NOT a necessary condition for a deadlock to occur? — Preemption
28. Which threading model maps multiple user threads to a single kernel thread? — Many-to-one model
29. Which memory management technique divides a program into logical units of varying sizes? — Segmentation
30. Which of the following memory management techniques can lead to external fragmentation? — Segmentation
31. What does the 'Circular Wait' condition imply? — A set of processes are waiting for each other in a cyclic manner.
32. In RAID levels, which level provides mirroring for fault tolerance? — RAID 1
33. Which RAID level combines striping and mirroring? — RAID 10
34. Which RAID level offers good performance and fault tolerance using parity, but requires at least three disks? — RAID 5
35. Which of the following RAID levels provides the best read performance? — RAID 0
36. RAID stands for: — Redundant Array of Independent Disks
37. Which of the following is NOT a typical state of a thread? — Terminated
38. Which memory management scheme allows a process to be non-contiguous in memory? — Paging and Segmentation
39. The SSTF disk scheduling algorithm selects the request with the: — Smallest seek time from the current head position.
40. Which disk scheduling algorithm services requests in the order they arrive? — FCFS (First-Come, First-Served)
41. In demand paging, when a page fault occurs, the operating system needs to: — Find the page in secondary storage, load it into a free frame, and update the page table.
42. In Shortest Remaining Time First (SRTF), if a new process arrives with a CPU burst length shorter than the remaining time of the currently executing process, what happens? — The currently executing process is preempted, and the new process starts execution.
43. In a user-level threads (ULT) model, thread management is handled by: — A user-space library.
44. What is the 'time quantum' in the Round Robin scheduling algorithm? — The total time a process is allowed to run before being preempted.
45. What is the main goal of deadlock avoidance? — To prevent deadlocks by ensuring the system never enters an unsafe state.
46. What is the primary goal of disk scheduling? — To increase disk I/O speed by reducing seek time and rotational latency.
47. What is the primary purpose of a thread in an operating system? — To allow a process to perform multiple tasks concurrently.
48. Virtual memory is a memory management technique that: — Allows programs to use more memory than physically available by using disk space.
49. What is 'internal fragmentation'? — Wasted space in a memory block allocated to a process, but not fully used.
All One Line Questions
E-Book Threads, CPU scheduling algorithms, deadlock characterization and handling, memory management (paging, segmentation, demand paging) and storage management (RAID, disk scheduling). Online Test Threads, CPU scheduling algorithms, deadlock characterization and handling, memory management (paging, segmentation, demand paging) and storage management (RAID, disk scheduling). Question Bank Threads, CPU scheduling algorithms, deadlock characterization and handling, memory management (paging, segmentation, demand paging) and storage management (RAID, disk scheduling).