Multiple Choice Questions

Question 1

Which of the following is an example of a preemptive scheduling technique?

Option 1: Round Robin

Option 2: First Come, First Served (FCFS)

Option 3: Shortest Job First (SJF)

Option 4: Priority Scheduling (Non-Preemptive)

Correct Answer: Option 1

Question 2

What is the primary purpose of an Operating System?

Option 1: To manage hardware resources

Option 2: To increase processor speed

Option 3: To control access to network resources

Option 4: To minimize power consumption

Multiple Choice Questions

Correct Answer: Option 1

Question 3

In a multithreaded system, what is the main advantage of using threads over processes?

Option 1: Threads use less memory

Option 2: Threads can run on multiple cores

Option 3: Threads share the same memory space, reducing overhead

Option 4: Threads reduce context switching time

Correct Answer: Option 3

Question 4

What is the term for the scenario where two or more processes wait indefinitely for resources held

by each other?

Option 1: Thrashing

Option 2: Deadlock

Option 3: Page Fault

Multiple Choice Questions

Option 4: Segmentation Fault

Correct Answer: Option 2

Question 5

Which of the following is a non-preemptive scheduling algorithm?

Option 1: Shortest Remaining Time First

Option 2: Round Robin

Option 3: First Come, First Served (FCFS)

Option 4: Multilevel Queue Scheduling

Correct Answer: Option 3

Question 6

Which memory management scheme allows for a process to be divided into several pages?

Option 1: Paging

Option 2: Segmentation
Multiple Choice Questions

Option 3: Contiguous Allocation

Option 4: Virtual Memory

Correct Answer: Option 1

Question 7

Which scheduling algorithm is most suitable for time-sharing systems?

Option 1: Round Robin

Option 2: Shortest Job First

Option 3: Priority Scheduling

Option 4: Multilevel Queue

Correct Answer: Option 1

Question 8

In the context of file systems, what does fragmentation refer to?

Option 1: Files split into non-contiguous blocks

Multiple Choice Questions

Option 2: File size exceeds system capacity

Option 3: A virus affecting file data

Option 4: Loss of file metadata

Correct Answer: Option 1

Question 9

Which method is used to handle race conditions?

Option 1: Mutexes

Option 2: Forking

Option 3: Paging

Option 4: Segmentation

Correct Answer: Option 1

Question 10

What is the main purpose of a page replacement algorithm in a paging system?

Multiple Choice Questions

Option 1: To swap pages between main memory and disk

Option 2: To determine the order of page access

Option 3: To handle page faults

Option 4: To prioritize processes

Correct Answer: Option 1

Question 11

Which of the following can help prevent deadlocks in an operating system?

Option 1: Mutual exclusion

Option 2: Preemption

Option 3: Priority Scheduling

Option 4: Starvation

Correct Answer: Option 2

Question 12
Multiple Choice Questions

What is thrashing in the context of operating systems?

Option 1: Excessive paging leading to performance degradation

Option 2: A type of disk fragmentation

Option 3: CPU overload due to many processes

Option 4: Frequent context switching

Correct Answer: Option 1

Question 13

Which of the following memory allocation techniques suffers from external fragmentation?

Option 1: Paging

Option 2: Segmentation

Option 3: Contiguous Memory Allocation

Option 4: Swapping

Correct Answer: Option 2

Multiple Choice Questions

Question 14

A semaphore is a synchronization tool used to solve which problem?

Option 1: Process starvation

Option 2: Deadlock prevention

Option 3: Mutual exclusion

Option 4: Multithreading

Correct Answer: Option 3

Question 15

Which page replacement algorithm replaces the page that has been used the least recently?

Option 1: Least Recently Used (LRU)

Option 2: First-In, First-Out (FIFO)

Option 3: Optimal Page Replacement

Option 4: Clock Algorithm

Multiple Choice Questions

Correct Answer: Option 1

Question 16

Which condition leads to a race condition in a concurrent system?

Option 1: Multiple processes access shared resources without synchronization

Option 2: Two processes waiting indefinitely for resources

Option 3: Processes are swapped in and out of memory frequently

Option 4: A process exceeds its time quantum

Correct Answer: Option 1

Question 17

Which file system implementation is typically faster but less reliable?

Option 1: Journaling

Option 2: Log-structured

Option 3: Non-journaling
Multiple Choice Questions

Option 4: Network File System (NFS)

Correct Answer: Option 3

Question 18

In multithreading, what is the primary function of a mutex?

Option 1: To protect shared resources

Option 2: To prevent context switching

Option 3: To increase thread priority

Option 4: To allocate memory to threads

Correct Answer: Option 1

Question 19

Which of the following is a key advantage of paging?

Option 1: No external fragmentation

Option 2: Simplifies the allocation of memory

Multiple Choice Questions

Option 3: Faster access to data

Option 4: No internal fragmentation

Correct Answer: Option 1

Question 20

Which deadlock prevention method requires holding only one resource at a time?

Option 1: Wait-die

Option 2: Hold and wait prevention

Option 3: No preemption

Option 4: Circular wait prevention

Correct Answer: Option 2

Question 21

Which operating system is designed for handling real-time applications?

Option 1: Windows
Multiple Choice Questions

Option 2: Linux

Option 3: Real-Time Operating System (RTOS)

Option 4: MacOS

Correct Answer: Option 3

Question 22

Which of the following scheduling algorithms can lead to starvation if not properly implemented?

Option 1: First Come, First Served (FCFS)

Option 2: Round Robin

Option 3: Priority Scheduling

Option 4: Multilevel Queue Scheduling

Correct Answer: Option 3

Question 23

In a paged memory system, what is the purpose of the page table?

Multiple Choice Questions

Option 1: To manage process execution time

Option 2: To translate logical addresses into physical addresses

Option 3: To track free memory blocks

Option 4: To allocate memory to processes

Correct Answer: Option 2

Question 24

What is the advantage of contiguous memory allocation?

Option 1: Eliminates internal fragmentation

Option 2: Simplifies addressing

Option 3: Supports dynamic memory allocation

Option 4: Reduces page faults

Correct Answer: Option 2

Question 25
Multiple Choice Questions

Which scheduling algorithm uses time slices to allocate CPU time to processes?

Option 1: Priority Scheduling

Option 2: Round Robin

Option 3: Shortest Job First

Option 4: First Come, First Served

Correct Answer: Option 2

Question 26

What does a context switch refer to in process management?

Option 1: Switching from one process to another

Option 2: Changing process priority

Option 3: Terminating a process

Option 4: Allocating memory to a process

Correct Answer: Option 1

Multiple Choice Questions

Question 27

Which of the following is true about non-preemptive scheduling?

Option 1: Once a process starts, it cannot be interrupted

Option 2: Processes are executed in random order

Option 3: It causes more context switches

Option 4: It reduces starvation

Correct Answer: Option 1

Question 28

In multithreading, which type of parallelism allows threads to run independently on separate

processors?

Option 1: Data Parallelism

Option 2: Task Parallelism

Option 3: Thread-Level Parallelism

Option 4: Pipeline Parallelism

Multiple Choice Questions

Correct Answer: Option 3

Question 29

In the case of a race condition, which synchronization technique can prevent multiple threads from

accessing a shared resource simultaneously?

Option 1: Semaphores

Option 2: Deadlocks

Option 3: Thrashing

Option 4: Paging

Correct Answer: Option 1

Question 30

What is the most significant advantage of multithreading in modern systems?

Option 1: Reduced memory usage

Option 2: Faster computation by sharing CPU time

Option 3: Increased performance by allowing parallel execution

Multiple Choice Questions

Option 4: Decreased need for system calls

Correct Answer: Option 3

Question 31

Which of the following is a method to detect a deadlock in an operating system?

Option 1: Wait-for Graph

Option 2: Multilevel Queue

Option 3: Round Robin Scheduling

Option 4: Preemptive Scheduling

Correct Answer: Option 1

Question 32

What happens when a system encounters a page fault?

Option 1: The system swaps the required page from disk into memory

Option 2: The process is terminated

Multiple Choice Questions

Option 3: Memory is allocated to the process

Option 4: The system resets the memory address

Correct Answer: Option 1

Question 33

Which CPU scheduling algorithm could lead to a convoy effect, where all processes wait for one

long process to finish?

Option 1: First Come, First Served (FCFS)

Option 2: Shortest Job First (SJF)

Option 3: Round Robin

Option 4: Priority Scheduling

Correct Answer: Option 1

Question 34

What is the primary benefit of using virtual memory?

Option 1: Increased CPU speed

Multiple Choice Questions

Option 2: Increased physical memory size

Option 3: Allowing more programs to run simultaneously

Option 4: Improved system stability

Correct Answer: Option 3

Question 35

Which of the following types of parallelism focuses on dividing a task into sub-tasks that are

executed simultaneously?

Option 1: Task Parallelism

Option 2: Thread-Level Parallelism

Option 3: Data Parallelism

Option 4: Process Parallelism

Correct Answer: Option 1

Question 36

Which of the following page replacement algorithms suffers from the Belady's anomaly?
Multiple Choice Questions

Option 1: First-In, First-Out (FIFO)

Option 2: Least Recently Used (LRU)

Option 3: Optimal Page Replacement

Option 4: Clock Algorithm

Correct Answer: Option 1

Question 37

What is the key difference between a thread and a process?

Option 1: Threads share memory while processes do not

Option 2: Processes are faster than threads

Option 3: Processes are more lightweight than threads

Option 4: Threads cannot be multitasked

Correct Answer: Option 1

Question 38
Multiple Choice Questions

Which of the following statements is true for the Best-Fit memory allocation strategy?

Option 1: It allocates the smallest available block of memory that is large enough for the process

Option 2: It always leads to external fragmentation

Option 3: It causes the highest degree of internal fragmentation

Option 4: It allocates memory in a round-robin manner

Correct Answer: Option 1

Question 39

In which condition would the Least Recently Used (LRU) page replacement algorithm perform better

than First-In, First-Out (FIFO)?

Option 1: When the pages used are accessed frequently

Option 2: When the pages used are not reused frequently

Option 3: When memory is fragmented

Option 4: When the system has high page fault rates

Correct Answer: Option 1

Multiple Choice Questions

Question 40

Which type of scheduling is ideal for time-critical applications?

Option 1: Real-Time Scheduling

Option 2: Round Robin

Option 3: First-Come, First-Served (FCFS)

Option 4: Shortest Job First (SJF)

Correct Answer: Option 1

Question 41

Which scheduling algorithm ensures that each process gets a fair share of CPU time?

Option 1: Priority Scheduling

Option 2: Round Robin

Option 3: First Come, First Served (FCFS)

Option 4: Shortest Job First (SJF)

Multiple Choice Questions

Correct Answer: Option 2

Question 42

Which of the following is NOT a preemptive scheduling algorithm?

Option 1: Round Robin

Option 2: Shortest Job First (SJF)

Option 3: Priority Scheduling

Option 4: First Come, First Served (FCFS)

Correct Answer: Option 4

Question 43

A system enters a deadlock state when:

Option 1: A process is unable to complete its execution

Option 2: Processes hold resources and wait for other resources

Option 3: There are too many threads running

Multiple Choice Questions

Option 4: Memory is completely utilized

Correct Answer: Option 2

Question 44

Which page replacement algorithm is considered optimal but impractical to implement?

Option 1: First-In, First-Out (FIFO)

Option 2: Least Recently Used (LRU)

Option 3: Optimal Page Replacement

Option 4: Clock Algorithm

Correct Answer: Option 3

Question 45

In a system using multithreading, what happens when a thread is in a 'blocked' state?

Option 1: It is waiting for CPU time

Option 2: It is waiting for an event like I/O completion

Multiple Choice Questions

Option 3: It is being terminated

Option 4: It is running but not using memory

Correct Answer: Option 2

Question 46

Which of the following is the primary purpose of a file system?

Option 1: To manage memory allocation

Option 2: To enable user interfaces

Option 3: To manage how data is stored and retrieved on storage devices

Option 4: To execute processes efficiently

Correct Answer: Option 3

Question 47

In a system with a high level of thrashing, what is the most likely cause?

Option 1: Excessive paging activity

Multiple Choice Questions

Option 2: Insufficient CPU speed

Option 3: Fragmented memory

Option 4: Inefficient scheduling algorithm

Correct Answer: Option 1

Question 48

Which of the following describes a 'critical section' in concurrent programming?

Option 1: A section of code that can only be executed by one process at a time

Option 2: A portion of memory used for swapping

Option 3: A reserved section of the CPU for system calls

Option 4: A portion of code that is shared among all threads

Correct Answer: Option 1

Question 49

Which of these is NOT a benefit of using threads?

Multiple Choice Questions

Option 1: Simplified data synchronization

Option 2: Improved application performance

Option 3: Parallel task execution

Option 4: Reduced context switching time

Correct Answer: Option 1

Question 50

Which type of memory allocation technique can suffer from external fragmentation?

Option 1: Paging

Option 2: Segmentation

Option 3: Contiguous memory allocation

Option 4: Dynamic allocation

Correct Answer: Option 3

Question 51
Multiple Choice Questions

In which state does a process wait for I/O operations to complete?

Option 1: Running

Option 2: Blocked

Option 3: Ready

Option 4: Terminated

Correct Answer: Option 2

Question 52

Which of the following describes the concept of 'thrashing'?

Option 1: A system spends most of its time swapping pages, rather than executing processes

Option 2: A process is repeatedly switching between CPU and I/O

Option 3: A CPU is overloaded by too many threads

Option 4: The OS is unable to allocate memory to processes

Correct Answer: Option 1

Multiple Choice Questions

Question 53

Which of the following conditions is necessary to avoid deadlocks?

Option 1: Processes must release all resources before requesting new ones

Option 2: No process should hold any resource while waiting for another one

Option 3: Processes must request resources in increasing order of priority

Option 4: All processes must be preemptable

Correct Answer: Option 2

Question 54

Which of the following describes 'semaphores' in process synchronization?

Option 1: A technique to prevent deadlock by locking all resources

Option 2: A signaling mechanism used to synchronize processes

Option 3: A priority queue for scheduling processes

Option 4: A technique to allocate memory to threads

Multiple Choice Questions

Correct Answer: Option 2

Question 55

Which of the following is an example of a non-preemptive scheduling algorithm?

Option 1: Round Robin

Option 2: Shortest Job First (SJF)

Option 3: Priority Scheduling

Option 4: First Come, First Served (FCFS)

Correct Answer: Option 4

Question 56

Which page replacement algorithm always evicts the page that will not be used for the longest

period of time in the future?

Option 1: Least Recently Used (LRU)

Option 2: Optimal Page Replacement

Option 3: Clock Algorithm

Multiple Choice Questions

Option 4: First-In, First-Out (FIFO)

Correct Answer: Option 2

Question 57

Which type of memory allocation strategy places a new process in the smallest available memory

partition that can hold the process?

Option 1: First-Fit

Option 2: Best-Fit

Option 3: Worst-Fit

Option 4: Next-Fit

Correct Answer: Option 2

Question 58

Which of the following structures is essential for virtual memory management in paging?

Option 1: Page Table

Option 2: Interrupt Vector

Multiple Choice Questions

Option 3: Scheduler

Option 4: File System

Correct Answer: Option 1

Question 59

Which scheduling algorithm is the most efficient for short, bursty jobs?

Option 1: Round Robin

Option 2: Priority Scheduling

Option 3: Shortest Job First (SJF)

Option 4: Multilevel Feedback Queue

Correct Answer: Option 3

Question 60

In a multithreaded environment, what is the primary purpose of 'monitors'?

Option 1: To handle process synchronization using mutual exclusion

Multiple Choice Questions

Option 2: To manage system calls

Option 3: To manage I/O operations

Option 4: To allocate CPU resources to threads

Correct Answer: Option 1

Question 61

In the context of paging, what is a 'page fault'?

Option 1: A hardware error when memory is corrupted

Option 2: An attempt to access a page that is not currently in memory

Option 3: An I/O error during memory access

Option 4: A process termination error

Correct Answer: Option 2

Question 62

Which of the following deadlock prevention methods allows a process to request resources only

when it has none?

Multiple Choice Questions

Option 1: Wait-die

Option 2: Hold and Wait

Option 3: Circular Wait

Option 4: No Preemption

Correct Answer: Option 2

Question 63

In the context of file systems, which of the following refers to 'metadata'?

Option 1: Data about the file system's internal structure

Option 2: Information that describes a file, such as its size, permissions, and creation date

Option 3: The actual data stored within the file

Option 4: The encryption keys used to protect the file

Correct Answer: Option 2

Question 64
Multiple Choice Questions

Which page replacement algorithm evicts the page that was brought into memory the longest time

ago?

Option 1: Least Recently Used (LRU)

Option 2: First-In, First-Out (FIFO)

Option 3: Optimal Page Replacement

Option 4: Clock Algorithm

Correct Answer: Option 2

Question 65

What is the main advantage of using monitors for process synchronization?

Option 1: They automatically manage mutual exclusion

Option 2: They reduce CPU load

Option 3: They eliminate deadlocks

Option 4: They prevent thrashing

Correct Answer: Option 1

Multiple Choice Questions

Question 66

Which of the following best describes 'semaphores'?

Option 1: Software locks that manage mutual exclusion

Option 2: CPU scheduling algorithms

Option 3: I/O control systems

Option 4: Memory management units

Correct Answer: Option 1

Question 67

In which situation is the use of a preemptive scheduling algorithm most beneficial?

Option 1: When the system needs to ensure fairness among all processes

Option 2: When the system is running a single application

Option 3: When CPU utilization is low

Option 4: When processes are independent and do not share resources

Multiple Choice Questions

Correct Answer: Option 1

Question 68

Which of the following is an example of contiguous memory allocation?

Option 1: A process is allocated a single, large block of memory

Option 2: A process is allocated multiple non-adjacent blocks of memory

Option 3: A process is divided into fixed-sized pages

Option 4: Memory is dynamically allocated as needed

Correct Answer: Option 1

Question 69

Which condition must be met to detect a deadlock using the wait-for graph?

Option 1: There must be at least one cycle in the graph

Option 2: There must be multiple processes waiting for the same resource

Option 3: The system must have more than one CPU

Multiple Choice Questions

Option 4: There must be no resource preemption

Correct Answer: Option 1

Question 70

What is the primary role of the CPU scheduler?

Option 1: To allocate memory to processes

Option 2: To determine which process will execute next

Option 3: To handle I/O requests

Option 4: To manage system calls

Correct Answer: Option 2

Question 71

Which of the following techniques helps prevent a race condition in a multithreaded environment?

Option 1: Using mutual exclusion locks

Option 2: Increasing CPU speed

Multiple Choice Questions

Option 3: Preemptive scheduling

Option 4: Virtual memory management

Correct Answer: Option 1

Question 72

Which scheduling technique can lead to starvation if not properly handled?

Option 1: Priority Scheduling

Option 2: Round Robin

Option 3: First Come, First Served

Option 4: Shortest Job First

Correct Answer: Option 1

Question 73

What is the purpose of a 'thread pool' in multithreading?

Option 1: To reduce the overhead of creating and destroying threads

Multiple Choice Questions

Option 2: To prioritize certain threads over others

Option 3: To allocate memory to each thread

Option 4: To minimize CPU utilization

Correct Answer: Option 1

Question 74

Which type of file system structure is the most commonly used in modern operating systems?

Option 1: Single-level directory

Option 2: Two-level directory

Option 3: Tree-structured directory

Option 4: Acyclic-graph directory

Correct Answer: Option 3

Question 75

Which condition leads to 'thrashing' in an operating system?

Multiple Choice Questions

Option 1: Too many page faults occurring in a short period

Option 2: CPU overload due to many running threads

Option 3: Excessive I/O requests

Option 4: A deadlock between processes

Correct Answer: Option 1

Question 76

In paging, what does the 'frame' refer to?

Option 1: A fixed-size block of physical memory

Option 2: A variable-size block of physical memory

Option 3: A unit of CPU time allocation

Option 4: A page in secondary storage

Correct Answer: Option 1

Question 77
Multiple Choice Questions

Which of the following conditions can lead to deadlock in a system?

Option 1: Mutual exclusion

Option 2: Circular wait

Option 3: Hold and wait

Option 4: All of the above

Correct Answer: Option 4

Question 78

Which algorithm is typically used to allocate CPU time in time-sharing systems?

Option 1: Round Robin

Option 2: First Come, First Served

Option 3: Shortest Job First

Option 4: Priority Scheduling

Correct Answer: Option 1

Multiple Choice Questions

Question 79

Which memory management technique divides the memory into fixed-sized units?

Option 1: Segmentation

Option 2: Paging

Option 3: Dynamic Allocation

Option 4: Contiguous Allocation

Correct Answer: Option 2

Question 80

In a system with multiple threads, which of the following is a common problem related to shared

data?

Option 1: Deadlock

Option 2: Race condition

Option 3: Starvation

Option 4: Thrashing
Multiple Choice Questions

Correct Answer: Option 2

Question 81

Which of the following best defines the term 'context switch' in operating systems?

Option 1: Switching between different memory management techniques

Option 2: Switching between different processes or threads

Option 3: Switching between different file systems

Option 4: Switching between I/O devices

Correct Answer: Option 2

Question 82

Which of the following is a non-preemptive scheduling algorithm?

Option 1: Shortest Job First

Option 2: Round Robin

Option 3: Priority Scheduling

Multiple Choice Questions

Option 4: First Come, First Served

Correct Answer: Option 4

Question 83

In which case would a thread yield its execution voluntarily?

Option 1: During a context switch

Option 2: During a system interrupt

Option 3: When using the yield() function in multithreading

Option 4: When facing an I/O request

Correct Answer: Option 3

Question 84

Which page replacement algorithm is often considered the optimal solution, though impractical to

implement?

Option 1: Least Recently Used (LRU)

Option 2: First-In, First-Out (FIFO)

Multiple Choice Questions

Option 3: Optimal Page Replacement

Option 4: Clock Algorithm

Correct Answer: Option 3

Question 85

Which of the following terms best describes the mechanism that guarantees no two processes can

access the same shared resource at the same time?

Option 1: Deadlock

Option 2: Mutual Exclusion

Option 3: Multithreading

Option 4: Page Fault

Correct Answer: Option 2

Question 86

Which of the following methods is typically used to detect deadlocks?

Option 1: Banker's Algorithm

Multiple Choice Questions

Option 2: Monitors

Option 3: Semaphores

Option 4: Round Robin Scheduling

Correct Answer: Option 1

Question 87

Which memory allocation technique suffers from internal fragmentation?

Option 1: Paging

Option 2: Segmentation

Option 3: Contiguous Allocation

Option 4: Dynamic Allocation

Correct Answer: Option 1

Question 88

Which scheduling algorithm is designed to give each process a small, fixed amount of CPU time in a

cyclic manner?
Multiple Choice Questions

Option 1: Priority Scheduling

Option 2: First Come, First Served

Option 3: Round Robin

Option 4: Multilevel Queue Scheduling

Correct Answer: Option 3

Question 89

In multithreading, what is the purpose of a 'mutex'?

Option 1: To prevent multiple threads from executing simultaneously in a critical section

Option 2: To assign priority levels to different threads

Option 3: To improve CPU utilization

Option 4: To increase the size of a process's memory

Correct Answer: Option 1

Question 90
Multiple Choice Questions

What does the term 'spooling' refer to in operating systems?

Option 1: Simultaneous Peripheral Operation Online

Option 2: Scheduling CPU resources

Option 3: Handling page faults

Option 4: Managing file systems

Correct Answer: Option 1

Question 91

Which of the following is an example of a non-preemptive scheduling technique?

Option 1: Round Robin

Option 2: First Come, First Served

Option 3: Shortest Remaining Time First

Option 4: Priority Scheduling

Correct Answer: Option 2

Multiple Choice Questions

Question 92

What is the main disadvantage of the 'First-In, First-Out' (FIFO) page replacement algorithm?

Option 1: It may lead to high page fault rates

Option 2: It requires additional hardware for implementation

Option 3: It may cause race conditions

Option 4: It increases context switch overhead

Correct Answer: Option 1

Question 93

What is a race condition in a multithreaded environment?

Option 1: A situation where multiple threads access shared data simultaneously leading to

unpredictable results

Option 2: A condition where two threads wait for each other to release a resource

Option 3: A situation where thread starvation occurs

Option 4: A state where the CPU is overloaded

Multiple Choice Questions

Correct Answer: Option 1

Question 94

Which of the following algorithms is used to avoid deadlock by ensuring safe resource allocation?

Option 1: Banker's Algorithm

Option 2: Priority Scheduling

Option 3: FIFO

Option 4: Clock Algorithm

Correct Answer: Option 1

Question 95

In paging, which part of the virtual address is used as an index into the page table?

Option 1: The page number

Option 2: The frame number

Option 3: The offset

Multiple Choice Questions

Option 4: The page size

Correct Answer: Option 1

Question 96

Which type of operating system architecture is based on the concept of a 'virtual machine'?

Option 1: Monolithic OS

Option 2: Microkernel OS

Option 3: Layered OS

Option 4: VM-based OS

Correct Answer: Option 4

Question 97

Which type of memory allocation leads to 'external fragmentation'?

Option 1: Contiguous allocation

Option 2: Paging
Multiple Choice Questions

Option 3: Non-contiguous allocation

Option 4: Dynamic allocation

Correct Answer: Option 1

Question 98

What is the primary function of a 'condition variable' in a monitor?

Option 1: To allow processes to wait for certain conditions to be true

Option 2: To manage CPU scheduling

Option 3: To control memory access

Option 4: To prevent race conditions

Correct Answer: Option 1

Question 99

Which of the following is a key advantage of the 'microkernel' architecture in operating systems?

Option 1: It simplifies memory management

Multiple Choice Questions

Option 2: It enhances system security and stability

Option 3: It reduces CPU overhead

Option 4: It improves disk I/O performance

Correct Answer: Option 2

Question 100

Which of the following is a benefit of multithreading?

Option 1: Improved process isolation

Option 2: Efficient use of system resources

Option 3: Faster context switching

Option 4: Increased memory utilization

Correct Answer: Option 2

Question 101

Which scheduling algorithm is particularly suited for time-sharing systems?

Multiple Choice Questions

Option 1: Round Robin

Option 2: First Come, First Served

Option 3: Priority Scheduling

Option 4: Shortest Job First

Correct Answer: Option 1

Question 102

What is the main role of the 'fork()' system call in Unix-based systems?

Option 1: To terminate a process

Option 2: To create a new process

Option 3: To allocate memory

Option 4: To handle page faults

Correct Answer: Option 2

Question 103
Multiple Choice Questions

Which of the following techniques is used to deal with thrashing in operating systems?

Option 1: Increasing the degree of multiprogramming

Option 2: Implementing demand paging

Option 3: Reducing the degree of multiprogramming

Option 4: Using a FIFO page replacement algorithm

Correct Answer: Option 3

Question 104

In the context of operating systems, what does the term 'thrashing' refer to?

Option 1: Excessive CPU usage

Option 2: Excessive page swapping between RAM and disk

Option 3: Uncontrolled multithreading

Option 4: File system corruption

Correct Answer: Option 2

Multiple Choice Questions

Question 105

What is the primary goal of the 'working set model' in memory management?

Option 1: To minimize page faults

Option 2: To allocate processes fairly

Option 3: To increase CPU utilization

Option 4: To reduce context switching

Correct Answer: Option 1

Question 106

Which of the following is an example of preemptive scheduling?

Option 1: Shortest Job First

Option 2: First Come, First Served

Option 3: Round Robin

Option 4: Multilevel Queue Scheduling

Multiple Choice Questions

Correct Answer: Option 3

Question 107

In Unix-based systems, which system call is responsible for terminating a process?

Option 1: fork()

Option 2: exec()

Option 3: kill()

Option 4: exit()

Correct Answer: Option 4

Question 108

What type of scheduling algorithm is typically used in real-time operating systems?

Option 1: Round Robin

Option 2: Priority Scheduling

Option 3: First Come, First Served

Multiple Choice Questions

Option 4: Multilevel Feedback Queue

Correct Answer: Option 2

Question 109

Which of the following is a key benefit of implementing multilevel feedback queue scheduling?

Option 1: Simplifies CPU utilization

Option 2: Provides better response time for shorter jobs

Option 3: Reduces memory fragmentation

Option 4: Decreases context switch time

Correct Answer: Option 2

Question 110

What is the primary benefit of a 'thread pool' in multithreaded programming?

Option 1: Reduced overhead in creating and destroying threads

Option 2: Better memory management

Multiple Choice Questions

Option 3: Increased CPU utilization

Option 4: Improved process scheduling

Correct Answer: Option 1

Question 111

Which of the following best describes a 'critical section' in concurrent programming?

Option 1: A section of code where only one thread can execute at a time

Option 2: A section of code that is executed by all threads

Option 3: A section of memory shared by multiple threads

Option 4: A section of code that contains I/O operations

Correct Answer: Option 1

Question 112

Which of the following is NOT a valid strategy for handling deadlocks?

Option 1: Deadlock prevention

Multiple Choice Questions

Option 2: Deadlock avoidance

Option 3: Deadlock detection

Option 4: Deadlock promotion

Correct Answer: Option 4

Question 113

What does the 'time quantum' represent in Round Robin scheduling?

Option 1: The total execution time required by a process

Option 2: The maximum time a process can run before being swapped out

Option 3: The total time allocated for a set of processes

Option 4: The number of processes in the ready queue

Correct Answer: Option 2

Question 114

Which of the following scenarios can result in 'priority inversion'?

Multiple Choice Questions

Option 1: A high-priority task waiting for a low-priority task to release a resource

Option 2: A low-priority task receiving more CPU time than a high-priority task

Option 3: All tasks in the system having equal priority

Option 4: A task being executed before its allocated time quantum

Correct Answer: Option 1

Question 115

Which of the following is a primary characteristic of a 'real-time operating system'?

Option 1: Supports multithreading

Option 2: Ensures guaranteed response time to events

Option 3: Supports virtual memory

Option 4: Has a monolithic kernel

Correct Answer: Option 2

Question 116
Multiple Choice Questions

Which of the following is true for 'demand paging'?

Option 1: Pages are loaded into memory only when they are needed

Option 2: All pages are pre-loaded into memory at process startup

Option 3: It does not allow for virtual memory

Option 4: All pages remain in memory until the process terminates

Correct Answer: Option 1

Question 117

Which type of memory management involves dividing memory into fixed-size blocks?

Option 1: Segmentation

Option 2: Paging

Option 3: Dynamic Allocation

Option 4: Contiguous Allocation

Correct Answer: Option 2

Multiple Choice Questions

Question 118

In a distributed system, what is the main advantage of 'load balancing'?

Option 1: Minimizes CPU scheduling overhead

Option 2: Improves resource utilization by distributing tasks evenly across nodes

Option 3: Ensures process isolation

Option 4: Reduces memory fragmentation

Correct Answer: Option 2

Question 119

What is the primary purpose of a 'swap space' in an operating system?

Option 1: To provide backup storage for files

Option 2: To extend the physical memory using disk space

Option 3: To allocate memory to CPU registers

Option 4: To store system logs

Multiple Choice Questions

Correct Answer: Option 2

Question 120

Which page replacement algorithm replaces the page that has been in memory the longest?

Option 1: LRU (Least Recently Used)

Option 2: FIFO (First In, First Out)

Option 3: Clock Algorithm

Option 4: Optimal Algorithm

Correct Answer: Option 2

Question 121

Which of the following is a common approach to preventing race conditions?

Option 1: Using critical sections

Option 2: Implementing file locks

Option 3: Scheduling processes fairly

Multiple Choice Questions

Option 4: Allocating more CPU cycles

Correct Answer: Option 1

Question 122

Which of the following describes 'semaphores' in operating systems?

Option 1: Variables used to control access to shared resources in concurrent programming

Option 2: Data structures that store process control information

Option 3: Locks that prevent deadlocks

Option 4: Methods of inter-process communication

Correct Answer: Option 1

Question 123

What is the primary purpose of multithreading in an application?

Option 1: To increase the number of threads running concurrently

Option 2: To manage process scheduling

Multiple Choice Questions

Option 3: To enhance the user interface responsiveness

Option 4: To allocate memory dynamically

Correct Answer: Option 1

Question 124

Which of the following scenarios could lead to a deadlock situation?

Option 1: Two processes competing for two resources without a defined order

Option 2: A single process executing sequentially

Option 3: Processes that do not share resources

Option 4: Threads that operate in isolation

Correct Answer: Option 1

Question 125

In which situation is non-preemptive scheduling most commonly used?

Option 1: Real-time systems

Multiple Choice Questions

Option 2: Time-sharing systems

Option 3: Batch processing systems

Option 4: Interactive systems

Correct Answer: Option 3

Question 126

What is the primary function of the 'exec()' system call in Unix-based systems?

Option 1: To create a new process

Option 2: To terminate the current process

Option 3: To load a new program into the current process

Option 4: To wait for a process to finish

Correct Answer: Option 3

Question 127

In the context of file systems, what does 'journaling' refer to?

Multiple Choice Questions

Option 1: A method of logging file access

Option 2: A technique for enhancing file security

Option 3: A strategy to prevent data corruption during unexpected shutdowns

Option 4: A process of file backup

Correct Answer: Option 3

Question 128

Which of the following best describes 'paging' in memory management?

Option 1: Dividing memory into variable-size sections

Option 2: Using fixed-size blocks of memory called pages

Option 3: Allocating memory based on process requirements

Option 4: Storing entire processes in contiguous memory

Correct Answer: Option 2

Question 129
Multiple Choice Questions

In a virtual memory system, what happens when a page fault occurs?

Option 1: The page is already in memory

Option 2: The process is terminated

Option 3: The operating system loads the page from disk into memory

Option 4: The system crashes

Correct Answer: Option 3

Question 130

Which algorithm is used to ensure the most frequently used pages remain in memory?

Option 1: Least Recently Used (LRU)

Option 2: First-In, First-Out (FIFO)

Option 3: Most Recently Used (MRU)

Option 4: Least Frequently Used (LFU)

Correct Answer: Option 1

Multiple Choice Questions

Question 131

What does the term 'context switch' refer to in operating systems?

Option 1: Changing the execution priority of a process

Option 2: Saving the state of a currently running process and loading the state of another

Option 3: Allocating memory to a new process

Option 4: Switching between user mode and kernel mode

Correct Answer: Option 2

Question 132

In the context of process management, what is a 'process control block' (PCB)?

Option 1: A data structure that stores information about a process

Option 2: A set of instructions for executing a process

Option 3: A method for allocating CPU time to processes

Option 4: A type of memory allocation

Multiple Choice Questions

Correct Answer: Option 1

Question 133

Which scheduling algorithm does not consider the priority of processes?

Option 1: Priority Scheduling

Option 2: Shortest Job First

Option 3: First Come, First Served

Option 4: Round Robin

Correct Answer: Option 3

Question 134

Which of the following is an example of a non-preemptive scheduling algorithm?

Option 1: Round Robin

Option 2: Shortest Job First

Option 3: Priority Scheduling

Multiple Choice Questions

Option 4: Multilevel Queue Scheduling

Correct Answer: Option 2

Question 135

What is the purpose of the 'ready queue' in an operating system?

Option 1: To hold processes that are waiting for I/O

Option 2: To hold processes that are currently executing

Option 3: To hold processes that are ready to run but not currently executing

Option 4: To hold processes that have terminated

Correct Answer: Option 3

Question 136

What does 'volatile memory' refer to?

Option 1: Memory that retains data without power

Option 2: Memory that loses its contents when power is turned off
Multiple Choice Questions

Option 3: Memory that can be used for long-term storage

Option 4: Memory that is only accessible by the CPU

Correct Answer: Option 2

Question 137

In a system using paging, what is a 'page table'?

Option 1: A data structure that maps virtual addresses to physical addresses

Option 2: A record of process execution states

Option 3: A list of currently active processes

Option 4: A cache of frequently accessed data

Correct Answer: Option 1

Question 138

What type of deadlock prevention strategy allocates resources only if the process can obtain all

resources it needs?

Option 1: Hold and Wait

Multiple Choice Questions

Option 2: Preemption

Option 3: Banker's Algorithm

Option 4: Circular Wait

Correct Answer: Option 3

Question 139

In multithreading, which term describes the situation where multiple threads execute

simultaneously?

Option 1: Concurrency

Option 2: Parallelism

Option 3: Synchronization

Option 4: Asynchronous execution

Correct Answer: Option 2

Question 140

What is the main purpose of semaphores in operating systems?

Multiple Choice Questions

Option 1: To manage memory allocation

Option 2: To synchronize access to shared resources

Option 3: To schedule processes

Option 4: To monitor CPU usage

Correct Answer: Option 2

Question 141

In the context of process scheduling, what does 'turnaround time' refer to?

Option 1: The time taken to execute a process from submission to completion

Option 2: The time taken to allocate resources to a process

Option 3: The time a process waits in the ready queue

Option 4: The time taken to switch between processes

Correct Answer: Option 1

Question 142
Multiple Choice Questions

Which of the following describes a situation in which a process cannot continue execution?

Option 1: I/O-bound process

Option 2: Race condition

Option 3: Starvation

Option 4: Deadlock

Correct Answer: Option 4

Question 143

What is the primary goal of process synchronization?

Option 1: To improve CPU utilization

Option 2: To prevent race conditions

Option 3: To reduce turnaround time

Option 4: To maximize throughput

Correct Answer: Option 2

Multiple Choice Questions

Question 144

In a time-sharing system, how is CPU time allocated to processes?

Option 1: Equally among all processes

Option 2: Based on process priority

Option 3: In fixed time slots or quantum

Option 4: According to process size

Correct Answer: Option 3

Question 145

Which memory allocation technique is based on dividing memory into fixed-size partitions?

Option 1: Paging

Option 2: Segmentation

Option 3: Contiguous allocation

Option 4: Dynamic partitioning

Multiple Choice Questions

Correct Answer: Option 1

Question 146

What is the primary function of a monitor in process synchronization?

Option 1: To control process execution

Option 2: To provide mutual exclusion

Option 3: To manage memory allocation

Option 4: To maintain the ready queue

Correct Answer: Option 2

Question 147

What occurs during a context switch?

Option 1: A new process is created

Option 2: The current process is terminated

Option 3: The CPU state is saved and restored for a different process
Multiple Choice Questions

Option 4: Memory is reallocated to active processes

Correct Answer: Option 3

Question 148

In an operating system, which of the following is used to manage threads?

Option 1: Thread table

Option 2: Process table

Option 3: CPU scheduling algorithm

Option 4: Memory allocation table

Correct Answer: Option 1

Question 149

Which of the following conditions is necessary for deadlock to occur?

Option 1: Resource preemption

Option 2: Circular wait

Multiple Choice Questions

Option 3: Mutual exclusion

Option 4: Hold and wait

Correct Answer: Option 2

Question 150

Which of the following is NOT a method of deadlock avoidance?

Option 1: Resource Allocation Graph

Option 2: Banker's Algorithm

Option 3: Wait-Die Scheme

Option 4: Hold and Wait

Correct Answer: Option 4

Question 151

In operating systems, which type of scheduling algorithm assigns CPU time to processes based on

their priority levels?

Option 1: Round Robin

Multiple Choice Questions

Option 2: First Come, First Served

Option 3: Priority Scheduling

Option 4: Shortest Job First

Correct Answer: Option 3

Question 152

What does the term 'thrashing' refer to in operating systems?

Option 1: Excessive page swapping

Option 2: Deadlock resolution

Option 3: High CPU utilization

Option 4: Resource starvation

Correct Answer: Option 1

Question 153

What is the primary function of a mutex in multithreading?

Multiple Choice Questions

Option 1: To increase CPU speed

Option 2: To allow multiple threads to execute simultaneously

Option 3: To prevent race conditions by providing mutual exclusion

Option 4: To schedule threads efficiently

Correct Answer: Option 3

Question 154

Which of the following best describes 'context switching'?

Option 1: Switching between user and kernel modes

Option 2: The process of saving the state of a CPU so that it can restore the state later

Option 3: Changing the priority of a process

Option 4: Switching between different processors in a multi-core system

Correct Answer: Option 2

Question 155
Multiple Choice Questions

Which scheduling algorithm is designed to minimize the average waiting time for a set of processes?

Option 1: First Come, First Served

Option 2: Shortest Job First

Option 3: Round Robin

Option 4: Priority Scheduling

Correct Answer: Option 2

Question 156

In a preemptive scheduling environment, which of the following conditions is true?

Option 1: A running process cannot be interrupted.

Option 2: Higher priority processes can preempt lower priority processes.

Option 3: Processes are scheduled based solely on arrival time.

Option 4: All processes run until completion.

Correct Answer: Option 2

Multiple Choice Questions

Question 157

What is the effect of a page fault on the performance of a system?

Option 1: It reduces the overall system performance.

Option 2: It improves the performance by optimizing memory usage.

Option 3: It has no impact on performance.

Option 4: It causes the system to crash.

Correct Answer: Option 1

Question 158

In which scenario would you use the Banker's Algorithm?

Option 1: When you need to allocate resources in a non-preemptive way.

Option 2: When you need to ensure deadlock avoidance in a system.

Option 3: When you want to increase CPU efficiency.

Option 4: When you have multiple threads running.

Multiple Choice Questions

Correct Answer: Option 2

Question 159

Which memory allocation technique allows processes to be loaded into non-contiguous memory

blocks?

Option 1: Contiguous Memory Allocation

Option 2: Paging

Option 3: Segmentation

Option 4: Fixed Partitioning

Correct Answer: Option 2

Question 160

In the context of operating systems, what does the term 'kernel' refer to?

Option 1: The user interface of the operating system

Option 2: The central part of an operating system that manages system resources

Option 3: The application layer of the operating system

Multiple Choice Questions

Option 4: The hardware component of the computer

Correct Answer: Option 2

Question 161

Which of the following is NOT a type of thread scheduling?

Option 1: User-level scheduling

Option 2: Kernel-level scheduling

Option 3: Hybrid scheduling

Option 4: Direct scheduling

Correct Answer: Option 4

Question 162

In a multithreaded application, what is the primary challenge associated with thread

synchronization?

Option 1: Increasing CPU usage

Option 2: Avoiding race conditions

Multiple Choice Questions

Option 3: Reducing memory consumption

Option 4: Enhancing throughput

Correct Answer: Option 2

Question 163

What is the purpose of using a semaphore in an operating system?

Option 1: To control access to shared resources

Option 2: To improve CPU scheduling

Option 3: To manage memory allocation

Option 4: To store process states

Correct Answer: Option 1

Question 164

In an operating system, which of the following best describes 'I/O-bound' processes?

Option 1: Processes that spend most of their time waiting for I/O operations to complete
Multiple Choice Questions

Option 2: Processes that utilize a significant amount of CPU resources

Option 3: Processes that have a fixed execution time

Option 4: Processes that do not require user input

Correct Answer: Option 1

Question 165

What is the effect of the 'shortest remaining time first' (SRTF) scheduling algorithm?

Option 1: It guarantees minimum waiting time for all processes.

Option 2: It reduces the turnaround time for long processes.

Option 3: It minimizes the average waiting time for processes.

Option 4: It causes starvation for longer processes.

Correct Answer: Option 3

Question 166

What does the term 'starvation' refer to in operating systems?

Multiple Choice Questions

Option 1: A condition where a process is indefinitely delayed from execution

Option 2: A process that is terminated before completion

Option 3: A process that consumes all system resources

Option 4: A condition where a system runs out of memory

Correct Answer: Option 1

Question 167

In a paging system, what happens to a process when it tries to access a page that is not in

memory?

Option 1: The process is terminated.

Option 2: A page fault occurs and the page is loaded from disk.

Option 3: The process waits indefinitely.

Option 4: The process is moved to the ready queue.

Correct Answer: Option 2

Question 168
Multiple Choice Questions

Which scheduling algorithm is best suited for real-time systems?

Option 1: First Come, First Served

Option 2: Shortest Job First

Option 3: Round Robin

Option 4: Rate Monotonic Scheduling

Correct Answer: Option 4

Question 169

What is the role of the file system in an operating system?

Option 1: To manage CPU scheduling

Option 2: To provide a user interface

Option 3: To manage data storage and retrieval

Option 4: To handle process execution

Correct Answer: Option 3

Multiple Choice Questions

Question 170

In a non-preemptive scheduling environment, when can a process release the CPU?

Option 1: When it voluntarily gives up the CPU

Option 2: When a higher priority process arrives

Option 3: After a fixed time quantum

Option 4: When it is terminated

Correct Answer: Option 1

Question 171

Which of the following algorithms is used for page replacement when a page fault occurs?

Option 1: First-In, First-Out (FIFO)

Option 2: Round Robin

Option 3: Shortest Job First

Option 4: Multilevel Queue Scheduling

Multiple Choice Questions

Correct Answer: Option 1

Question 172

What is the main purpose of process creation in an operating system?

Option 1: To allocate CPU time to processes

Option 2: To create a new process for execution

Option 3: To manage system resources

Option 4: To improve memory efficiency

Correct Answer: Option 2

Question 173

In a multithreaded environment, what is the benefit of using threads?

Option 1: Increased memory consumption

Option 2: Enhanced responsiveness and resource sharing

Option 3: Reduced complexity in application design

Multiple Choice Questions

Option 4: Decreased CPU utilization

Correct Answer: Option 2

Question 174

Which of the following best defines 'segmentation' in memory management?

Option 1: Dividing memory into fixed-size pages

Option 2: Dividing memory into variable-size segments based on logical divisions

Option 3: Allocating memory in contiguous blocks

Option 4: Using a single contiguous block for all processes

Correct Answer: Option 2

Question 175

What is the function of the ready queue in an operating system?

Option 1: To store processes that are terminated

Option 2: To hold processes waiting for CPU allocation

Multiple Choice Questions

Option 3: To manage I/O operations

Option 4: To keep track of processes in the memory

Correct Answer: Option 2

Question 176

What is the primary purpose of the system call interface in an operating system?

Option 1: To manage CPU scheduling

Option 2: To facilitate communication between user applications and the kernel

Option 3: To allocate memory for processes

Option 4: To implement security measures

Correct Answer: Option 2

Question 177

What does the term 'preemptive multitasking' mean?

Option 1: Processes run until they voluntarily yield control

Multiple Choice Questions

Option 2: The operating system can forcibly take control from a running process

Option 3: Processes are executed in a strict order

Option 4: All processes are treated equally without priority

Correct Answer: Option 2

Question 178

In a scenario where two processes are waiting indefinitely for each other to release resources, which

condition is present?

Option 1: Starvation

Option 2: Deadlock

Option 3: Race condition

Option 4: Context switch

Correct Answer: Option 2

Question 179

Which of the following is a common method for deadlock prevention?

Multiple Choice Questions

Option 1: Allowing all resources to be preempted

Option 2: Ensuring circular wait does not occur

Option 3: Increasing process priority

Option 4: Randomly terminating processes

Correct Answer: Option 2

Question 180

What is a primary characteristic of a real-time operating system?

Option 1: It can be interrupted at any time.

Option 2: It prioritizes task execution based on time constraints.

Option 3: It allows for high resource utilization.

Option 4: It operates on a first-come, first-served basis.

Correct Answer: Option 2

Question 181
Multiple Choice Questions

What happens when a process enters the waiting state?

Option 1: It is terminated immediately.

Option 2: It is ready to execute.

Option 3: It is waiting for an I/O operation to complete.

Option 4: It is being executed by the CPU.

Correct Answer: Option 3

Question 182

Which of the following is NOT a process state in the process lifecycle?

Option 1: Running

Option 2: Waiting

Option 3: Suspended

Option 4: Linked

Correct Answer: Option 4

Multiple Choice Questions

Question 183

In a multilevel queue scheduling system, processes are divided into different queues based on what

criteria?

Option 1: The arrival time of processes

Option 2: The type of process and priority

Option 3: The length of the process

Option 4: The memory requirements

Correct Answer: Option 2

Question 184

In the context of operating systems, what does 'CPU bound' mean?

Option 1: A process that spends most of its time waiting for I/O operations

Option 2: A process that requires a significant amount of CPU resources

Option 3: A process that does not require any CPU resources

Option 4: A process that runs in user mode

Multiple Choice Questions

Correct Answer: Option 2

Question 185

Which of the following algorithms uses a time quantum to allocate CPU time to processes?

Option 1: First Come, First Served

Option 2: Shortest Job First

Option 3: Round Robin

Option 4: Priority Scheduling

Correct Answer: Option 3

Question 186

What does the term 'process starvation' refer to?

Option 1: A process being indefinitely delayed from execution

Option 2: A process that has completed execution

Option 3: A process that has been terminated

Multiple Choice Questions

Option 4: A process that is running efficiently

Correct Answer: Option 1

Question 187

Which of the following best describes a 'race condition'?

Option 1: Two processes are waiting for each other to release resources.

Option 2: Multiple processes are competing for the same resource simultaneously.

Option 3: A process is terminated before it completes execution.

Option 4: A process cannot be allocated memory.

Correct Answer: Option 2

Question 188

In a paging system, what is the size of a page typically defined by?

Option 1: The operating system

Option 2: The CPU architecture

Multiple Choice Questions

Option 3: The physical memory size

Option 4: The storage device capacity

Correct Answer: Option 2

Question 189

What does 'thrashing' indicate about a system's performance?

Option 1: It has high CPU utilization.

Option 2: It is experiencing excessive paging.

Option 3: It runs processes efficiently.

Option 4: It has low memory requirements.

Correct Answer: Option 2

Question 190

Which of the following best describes 'preemptive multitasking'?

Option 1: Processes run until they complete execution.

Multiple Choice Questions

Option 2: The operating system can interrupt and switch between processes.

Option 3: Processes are executed based on their priority.

Option 4: Processes are scheduled based on their arrival time.

Correct Answer: Option 2

Question 191

Which scheduling algorithm is best for time-sharing systems?

Option 1: First Come, First Served

Option 2: Round Robin

Option 3: Shortest Job First

Option 4: Priority Scheduling

Correct Answer: Option 2

Question 192

In a system using paging, which of the following best describes the term 'page table'?
Multiple Choice Questions

Option 1: A list of all processes in the system

Option 2: A mapping between logical pages and physical frames

Option 3: A queue of processes waiting for execution

Option 4: A storage for executing processes

Correct Answer: Option 2

Question 193

What is the purpose of a file descriptor in an operating system?

Option 1: To identify files in the file system

Option 2: To manage process states

Option 3: To store user credentials

Option 4: To handle system calls

Correct Answer: Option 1

Question 194
Multiple Choice Questions

Which of the following techniques can be used to prevent deadlock?

Option 1: Resource preemption

Option 2: Hold and wait

Option 3: Circular wait

Option 4: Mutual exclusion

Correct Answer: Option 1

Question 195

In a system that implements paging, which of the following is true regarding fragmentation?

Option 1: Paging eliminates external fragmentation.

Option 2: Paging creates internal fragmentation.

Option 3: Both external and internal fragmentation are eliminated.

Option 4: Fragmentation does not occur in paging.

Correct Answer: Option 3

Multiple Choice Questions

Question 196

What is the role of a 'dispatcher' in an operating system?

Option 1: To allocate memory to processes

Option 2: To switch between processes and manage the CPU

Option 3: To handle I/O operations

Option 4: To create new processes

Correct Answer: Option 2

Question 197

In a multithreaded application, what does 'context switching' involve?

Option 1: Switching between user and kernel modes

Option 2: Saving and restoring the state of threads

Option 3: Allocating resources to threads

Option 4: Managing memory allocation

Multiple Choice Questions

Correct Answer: Option 2

Question 198

What does a 'deadlock' signify in a computer system?

Option 1: All processes are completed.

Option 2: Processes are in a waiting state indefinitely.

Option 3: Processes are executed successfully.

Option 4: There is an I/O operation pending.

Correct Answer: Option 2

Question 199

Which type of file system organizes files into a hierarchical structure?

Option 1: Flat file system

Option 2: Database file system

Option 3: Hierarchical file system

Multiple Choice Questions

Option 4: Network file system

Correct Answer: Option 3

Question 200

In a thread, which data structure is used to manage the state of the thread?

Option 1: Thread Control Block (TCB)

Option 2: Process Control Block (PCB)

Option 3: File Descriptor Table

Option 4: Page Table

Correct Answer: Option 1