OS Process and Memory Management Quiz

1. Which scheduling algorithm minimizes average waiting time for processes?

Round Robin

Shortest Job First

Priority Scheduling

FIFO

Submit

3. In preemptive scheduling, the OS can interrupt a running process to allocate CPU time to another. True or false?

True

False

4. What is thrashing in virtual memory?

Excessive page faults causing high disk I/O

A type of caching strategy

Fragmentation of the page table

Rapid process creation and termination

Submit

6. Which memory allocation strategy assigns the smallest available partition that fits a process?

First Fit

Best Fit

Worst Fit

Next Fit

Submit

9. What is internal fragmentation in memory management?

Unused memory within allocated blocks

Unused memory between allocated blocks

Memory scattered across the disk

Inability to load a program due to size

Submit

11. What is the primary difference between a process and a thread?

A process has its own memory space; threads share memory within a process

Threads are faster than processes

A process can only run one task at a time

Threads cannot be created by a process

Submit

13. A deadlock can occur when processes hold resources and wait for others. Which condition is NOT required for deadlock?

Mutual exclusion

Preemption

Hold and wait

Circular wait

14. What synchronization primitive is used to protect a critical section accessed by multiple processes?

Semaphore

Context switch

Cache

Interrupt handler

Submit

16. In memory management, what is a page fault?

An error in the page table

A hardware failure in RAM

An interrupt when a required page is not in physical memory

A memory leak in the operating system

17. What is the primary advantage of paging over segmentation?

Paging eliminates external fragmentation

Paging is easier to implement

Paging allows larger virtual address spaces

Paging requires no page tables

Submit

19. Which process state represents a process waiting for an I/O operation to complete?

Running

Waiting

Ready

Terminated

20. In process scheduling, what does the FCFS algorithm stand for?

First Come First Served

Fast Context First Switch

First CPU First Scheduled

Fastest Core First Selection

General OS Intermediate Process and Memory Management Quiz

1. Which scheduling algorithm minimizes average waiting time for processes?

2.

What first name or nickname would you like us to use?

2. The OS maintains a ____ for each process to track its resource allocation and execution state.

3. In preemptive scheduling, the OS can interrupt a running process to allocate CPU time to another. True or false?

4. What is thrashing in virtual memory?

5. The working set model in virtual memory aims to keep frequently used pages ____ to minimize page faults.

6. Which memory allocation strategy assigns the smallest available partition that fits a process?

7. In Round Robin scheduling, the time slice allocated to each process is known as the ____.

8. A semaphore with an initial value of 1 used to protect a critical section is called a ____.

9. What is internal fragmentation in memory management?

10. In virtual memory, the Translation Lookaside Buffer (TLB) stores ____ mappings.

11. What is the primary difference between a process and a thread?

12. Context switching involves saving and restoring the ____ of a process.

13. A deadlock can occur when processes hold resources and wait for others. Which condition is NOT required for deadlock?

14. What synchronization primitive is used to protect a critical section accessed by multiple processes?

15. The LRU (Least Recently Used) page replacement algorithm evicts the page that ____ recently.

16. In memory management, what is a page fault?

17. What is the primary advantage of paging over segmentation?

18. Virtual memory allows programs to use more memory than physically available by using ____.

19. Which process state represents a process waiting for an I/O operation to complete?

20. In process scheduling, what does the FCFS algorithm stand for?