1. Which of the following scheduling algorithms gives minimum average waiting time for a set of processes?

  • A) First-Come-First-Served
  • B) Round Robin
  • C) Shortest Job First
  • D) Priority Scheduling
    Answer: C) Shortest Job First

2. Which mechanism is used to avoid deadlock in a system by denying resource requests that could potentially cause deadlock?

  • A) Preemption
  • B) Banker’s Algorithm
  • C) Priority Inversion
  • D) Paging
    Answer: B) Banker’s Algorithm

3. What is the primary purpose of the “exec()” system call in an operating system?

  • A) Create a new process
  • B) Change the priority of a process
  • C) Replace the current process image with a new process image
  • D) Terminate a process
    Answer: C) Replace the current process image with a new process image

4. Which of the following page replacement algorithms suffers from Belady’s anomaly?

  • A) Least Recently Used (LRU)
  • B) Optimal Page Replacement
  • C) First-In-First-Out (FIFO)
  • D) Clock Algorithm
    Answer: C) First-In-First-Out (FIFO)

5. In which of the following situations will a page fault occur?

  • A) When the page is found in the page table
  • B) When a requested page is not in memory
  • C) When a requested page is in memory
  • D) When memory allocation is complete
    Answer: B) When a requested page is not in memory

6. What is the main advantage of using threads over processes in an operating system?

  • A) Lower overhead in context switching
  • B) Better security
  • C) Easier to debug
  • D) More memory usage
    Answer: A) Lower overhead in context switching

7. In a system with multiple processors, what is the primary advantage of symmetric multiprocessing (SMP)?

  • A) Improved reliability
  • B) Better memory management
  • C) Parallel execution of processes
  • D) Enhanced I/O performance
    Answer: C) Parallel execution of processes

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

  • A) Shortest Job First (SJF)
  • B) Round Robin
  • C) Priority Scheduling
  • D) First-Come-First-Served (FCFS)
    Answer: D) First-Come-First-Served (FCFS)

9. Which of the following is not a condition for deadlock to occur?

  • A) Mutual Exclusion
  • B) Hold and Wait
  • C) Preemption
  • D) Circular Wait
    Answer: C) Preemption

10. In the context of virtual memory, what does “thrashing” refer to?

  • A) Excessive swapping between main memory and disk
  • B) Deadlock in paging
  • C) Fragmentation of physical memory
  • D) Delayed I/O operations
    Answer: A) Excessive swapping between main memory and disk

11. Which one of the following is a true statement about a system’s critical section problem?

  • A) It occurs only in batch processing systems
  • B) It can be solved using semaphores
  • C) It is solved by deadlock avoidance
  • D) It cannot be solved using mutex locks
    Answer: B) It can be solved using semaphores

12. Which of the following disk scheduling algorithms gives the minimum variance of response time?

  • A) Shortest Seek Time First (SSTF)
  • B) First Come First Serve (FCFS)
  • C) SCAN
  • D) C-SCAN
    Answer: A) Shortest Seek Time First (SSTF)

13. Which of the following is true about demand paging?

  • A) Pages are loaded into memory before execution begins
  • B) Pages are loaded only when they are needed during execution
  • C) It is a form of preemptive memory allocation
  • D) Pages are allocated in a fixed block size
    Answer: B) Pages are loaded only when they are needed during execution

14. Which of the following is a correct statement regarding segmentation?

  • A) Segmentation eliminates internal fragmentation
  • B) Segmentation is a type of file system
  • C) Segmentation increases external fragmentation
  • D) Segmentation uses fixed-size partitions
    Answer: A) Segmentation eliminates internal fragmentation

15. Which of the following is an advantage of the buddy system in memory management?

  • A) It minimizes external fragmentation
  • B) It provides variable-sized partitions
  • C) It supports large page sizes
  • D) It eliminates internal fragmentation
    Answer: A) It minimizes external fragmentation

16. Which of the following is not a type of system call?

  • A) Process control
  • B) Memory management
  • C) File management
  • D) Cache invalidation
    Answer: D) Cache invalidation

17. Which is the correct order of the steps involved in handling an interrupt?

  • A) Execute the interrupt service routine (ISR), save the processor state, acknowledge the interrupt
  • B) Save the processor state, acknowledge the interrupt, execute the ISR
  • C) Acknowledge the interrupt, execute the ISR, save the processor state
  • D) Save the processor state, execute the ISR, acknowledge the interrupt
    Answer: B) Save the processor state, acknowledge the interrupt, execute the ISR

18. Which one of the following is a disadvantage of the Round Robin (RR) scheduling algorithm?

  • A) High average turnaround time
  • B) Long response time
  • C) Starvation
  • D) High context-switching overhead
    Answer: D) High context-switching overhead

19. In UNIX, which of the following is used to achieve inter-process communication (IPC)?

  • A) Pipes
  • B) Fork
  • C) Exec
  • D) Yield
    Answer: A) Pipes

20. Which of the following synchronization mechanisms does not suffer from the busy-waiting problem?

  • A) Spinlocks
  • B) Mutex locks
  • C) Semaphores with blocking
  • D) Test-and-set locks
    Answer: C) Semaphores with blocking

21. Which type of kernel allows processes to be swapped in and out from the main memory?

  • A) Microkernel
  • B) Monolithic Kernel
  • C) Hybrid Kernel
  • D) Swapping Kernel
    Answer: D) Swapping Kernel

22. Which of the following is an example of a preemptive scheduling algorithm?

  • A) First-Come-First-Served
  • B) Shortest Job First
  • C) Round Robin
  • D) Priority Scheduling without aging
    Answer: C) Round Robin

23. In UNIX, what is the outcome of executing the fork() system call?

  • A) Creates a new thread
  • B) Duplicates the current process
  • C) Replaces the current process image
  • D) Terminates the current process
    Answer: B) Duplicates the current process

24. What is the major drawback of using contiguous memory allocation?

  • A) Inefficient use of memory
  • B) Fragmentation
  • C) High overhead for memory management
  • D) Increased I/O operation delays
    Answer: B) Fragmentation

25. Which of the following statements about the Dining Philosophers Problem is true?

  • A) It can be solved using only mutex locks
  • B) It cannot be solved using semaphores
  • C) It is a classic example of process synchronization problems
  • D) It can always be solved by using priority scheduling
    Answer: C) It is a classic example of process synchronization problems

Published by Pragyanxetu

One Earth. One Future