C191 Operating Systems for Programmers Practice Questions - Set 2 - Part 1

Test your knowledge of data-driven decision making concepts with these practice questions. Each question includes detailed explanations to help you understand the correct answers.

Question 1: What is the purpose of the long-term scheduler in an operating system?

A) To manage the CPU

B) To decide which processes should be added to the ready queue

C) To swap processes in and out of memory

D) To handle device management

Question 2: In a system with demand paging, what causes a page fault?

A) When a process accesses a page that is not in main memory

B) When the CPU utilization is low

C) When a process terminates

D) When the page is modified in memory

Question 3: Which of the following is true about the First-Come, First-Served (FCFS) scheduling algorithm?

A) It can cause the convoy effect

B) It preempts processes with a higher priority

C) It is the most efficient scheduling algorithm

D) It minimizes the average waiting time

Question 4: What is a major disadvantage of the Banker’s algorithm?

A) It is simple to implement

B) It does not prevent deadlocks

C) It requires knowing the maximum resource requirements in advance

D) It uses too many resources

Question 5: What is the purpose of the short-term scheduler?

A) To select which process should be executed next

B) To manage I/O devices

C) To handle deadlocks

D) To allocate memory

Question 6: In Round-Robin scheduling, what happens when a process’s time quantum expires?

A) It continues running until it completes

B) It is terminated

C) It is moved to the end of the ready queue

D) It is placed in the blocked state

Question 7: Which of the following is an example of preemptive scheduling?

A) Shortest Job First (SJF)

B) First-Come, First-Served (FCFS)

C) Round-Robin

D) Long-Term Scheduling

Question 8: What is the key advantage of dynamic linking?

A) It loads all libraries at compile time

B) It reduces memory usage by sharing library code among processes

C) It avoids page faults

D) It eliminates the need for address translation

Question 9: What is the purpose of a page replacement algorithm?

A) To handle deadlock situations

B) To select which page to remove from memory when a new page must be loaded

C) To determine which process gets the CPU

D) To allocate virtual memory

Question 10: Which of the following is true about the Least Recently Used (LRU) page replacement algorithm?

A) It removes the most frequently used page

B) It removes the least frequently used page

C) It removes the page that has not been used for the longest time

D) It removes a random page

Question 11: Which of the following is NOT a deadlock prevention strategy?

A) Circular wait

B) Hold and wait

C) No preemption

D) Request and release

Question 12: In segmentation, what is a segment?

A) A portion of the virtual address space that corresponds to a specific program module

B) A fixed-size block of memory

C) A cache memory section

D) A disk partition

Question 13: What is the primary drawback of the Best-Fit memory allocation strategy?

A) It always uses the smallest available memory block

B) It creates many small holes in memory, leading to fragmentation

C) It results in the fastest memory allocation

D) It leads to starvation of processes

Question 14: What is a context switch?

A) Switching from user mode to kernel mode

B) Saving the state of one process and loading the state of another

C) Switching between threads in a single process

D) Moving a process from the ready queue to the running state

Question 15: In a paging system, what is the purpose of the Translation Lookaside Buffer (TLB)?

A) To store frequently used pages

B) To map virtual addresses to physical addresses more quickly

C) To manage disk I/O

D) To prevent thrashing

Question 16: What is the main goal of the I/O scheduler?

A) To manage process creation

B) To allocate memory

C) To optimize the performance of input/output operations

D) To prevent deadlocks

Question 17: What happens during a fork() system call in Unix-based systems?

A) A new process is created as an exact copy of the parent

B) The current process is terminated

C) A new thread is created

D) Memory is reallocated for the parent process

Question 18: What is a major disadvantage of contiguous memory allocation?

A) It increases external fragmentation

B) It increases internal fragmentation

C) It is difficult to implement

D) It uses too much memory

Question 19: In a multi-threaded environment, what does thread synchronization ensure?

A) That all threads run at the same speed

B) That threads do not interfere with each other while accessing shared resources

C) That threads run independently of each other

D) That threads share the same stack space

Question 20: What is the primary function of the dispatcher in an operating system?

A) To manage file I/O operations

B) To decide which process will be scheduled next

C) To switch the CPU to the process selected by the short-term scheduler

D) To handle page faults

Need Guaranteed Results?

Don't want to study? Our exam support service guarantees you'll pass your OA on the first attempt. Pay only after you pass!

Get Exam Support