OS MCQ Combine
OS MCQ Combine
Answer: c) Windows 10
5. Which scheduling algorithm gives priority to processes with higher priority levels?
a) Round Robin
b) First-Come, First-Served (FCFS)
c) Priority Scheduling
d) Shortest Job Next (SJN)
Answer: d) Hardware OS
Answer: c) HFS+
Answer: b) It guarantees that processes will always complete within a certain timeframe
16. Which of the following is not a memory management technique used by operating systems?
a) Paging
b) Segmentation
c) Thrashing
d) Fragmentation
Answer: c) Thrashing
Answer: b) To start the computer and load the operating system into memory
Answer: c) Android
Answer: a) A situation where two processes are waiting indefinitely for each other to release resources
20. Which of the following is not a function of an operating system's security features?
a) User authentication
b) File compression
c) Encryption
d) Access control
Answer: b) To provide an interface between application programs and the operating system
Answer: b) Linux
28. What is the role of the FAT file system in Windows operating systems?
a) It is used for managing memory
b) It is used for managing user accounts
c) It is used for managing files and directories
d) It is used for managing network connections
29. What is the purpose of the Process Control Block (PCB) in an operating system?
a) To manage system processes
b) To control input/output operations
c) To manage system resources
d) To provide an interface between the kernel and device drivers
31. What is the purpose of the init process in Unix-like operating systems?
a) To initialize hardware devices
b) To load the kernel into memory
c) To start and manage system processes
d) To execute user commands
32. Which of the following is not a function of an operating system's memory manager?
a) Allocating memory to processes
b) Freeing memory when it is no longer needed
c) Executing application programs
d) Managing virtual memory
Answer: b) ROM
Answer: b) To load the operating system into memory during the boot process
39. What is the role of the swap space in virtual memory management?
a) To store temporary files
b) To store copies of frequently accessed files
c) To provide additional memory when physical memory is full
d) To manage network connections
40. Which of the following is not a function of an operating system's input/output manager?
a) Managing device drivers
b) Controlling input/output operations
c) Managing system processes
d) Buffering data transfers
41. What is the purpose of the file allocation table (FAT) in the FAT file system?
a) To store file metadata
b) To map file names to disk addresses
c) To manage file permissions
d) To manage file compression
Answer: c) NFS
46. What is the primary function of the Memory Management Unit (MMU) in a computer system?
a) To manage file systems
b) To control input/output operations
c) To translate virtual addresses to physical addresses
d) To manage user accounts
50. What is the purpose of the page replacement algorithm in virtual memory management?
a) To allocate memory to processes
b) To manage disk space
c) To decide which memory pages to swap out to disk when physical memory is full
d) To manage file systems
Answer: c) To decide which memory pages to swap out to disk when physical memory is full
Answer: c) Android
54. Which of the following is not a function of an operating system's file management system?
a) Formatting disks
b) Allocating system resources
c) Printing documents
d) Creating spreadsheets
60. Which scheduling algorithm gives priority to processes with higher priority levels?
a) Round Robin
b) First-Come, First-Served (FCFS)
c) Priority Scheduling
d) Shortest Job Next (SJN)
Answer: c) Windows 10
Answer: b) It guarantees that processes will always complete within a certain timeframe
Answer: d) Hardware OS
Answer: c) HFS+
69. What is the primary function of an operating system's file management system?
a) Formatting disks
b) Allocating system resources
c) Printing documents
d) Creating spreadsheets
Answer: c) Android
Answer: a) A situation where two processes are waiting indefinitely for each other to release resources
Answer: b) To provide an interface between application programs and the operating system
73. What is the purpose of the Memory Management Unit (MMU) in a computer system?
a) To manage file systems
b) To control input/output operations
c) To translate virtual addresses to physical addresses
d) To manage user accounts
77. What is the purpose of the swap space in virtual memory management?
a) To store temporary files
b) To store copies of frequently accessed files
c) To provide additional memory when physical memory is full
d) To manage network connections
Answer: c) NFS
80. What is the purpose of the file allocation table (FAT) in the FAT file system?
a) To store file metadata
b) To map file names to disk addresses
c) To manage file permissions
d) To manage file compression
Answer: b) To load the operating system into memory during the boot process
85. What is the role of the swap space in virtual memory management?
a) To store temporary files
b) To store copies of frequently accessed files
c) To provide additional memory when physical memory is full
d) To manage network connections
86. What is the purpose of a process control block (PCB) in operating systems?
a) To manage system processes
b) To control input/output operations
c) To manage system resources
d) To provide an interface between the kernel and device drivers
Answer: c) Android
Answer: b) It guarantees that processes will always complete within a certain timeframe
Answer: d) Hardware OS
Answer: c) HFS+
94. What is the primary function of an operating system's file management system?
a) Formatting disks
b) Allocating system resources
c) Printing documents
d) Creating spreadsheets
Answer: c) Android
Answer: a) A situation where two processes are waiting indefinitely for each other to release resources
Answer: b) To provide an interface between application programs and the operating system
98. What is the purpose of the Memory Management Unit (MMU) in a computer system?
a) To manage file systems
b) To control input/output operations
c) To translate virtual addresses to physical addresses
d) To manage user accounts
Answer: c) To translate virtual addresses to physical addresses
10) Which of the following operating systems do you choose to implement a client-server network?
a) MS DOS
b) Windows
c) Windows Server
d) UNIX
11) Which of the following is the default file extension created by Notepad?
a) .doc
b) .html
c) .txt
d) .xml
12) Which part of the operating system is responsible for managing the file system?
a) Kernel
b) File manager
c) I/O manager
d) Memory manager
14) Which of the following is a type of memory that loses its contents when power is turned off?
a) ROM
b) RAM
c) Hard disk
d) Floppy disk
16) Which scheduling algorithm allocates the CPU first to the process that requests the CPU first?
a) Shortest Job First
b) Round Robin
c) Priority
d) First-Come, First-Served
19) Which of the following is not a component of the process control block (PCB)?
a) Process state
b) Process counter
c) Stack pointer
d) I/O status information
20) Which of the following is the most secure file system used in Windows?
a) FAT32
b) NTFS
c) exFAT
d) FAT16
25) Which scheduling algorithm is guaranteed to provide the lowest average waiting time?
a) First-Come, First-Served
b) Shortest Job First
c) Priority Scheduling
d) Round Robin
26) What is the mechanism by which the operating system prevents a single process from monopolizing the CPU?
a) Swapping
b) Context switching
c) Time slicing
d) Interrupt handling
34) Which of the following is a function of the I/O management module of an OS?
a) CPU scheduling
b) Memory management
c) Disk scheduling
d) File management
39) Which of the following is used to perform tasks that are separated into non-overlapping intervals of time?
a) Multiprocessing
b) Multithreading
c) Time slicing
d) Context switching
40) Which of the following commands is used to change the ownership of a file in UNIX?
a) chown
b) chmod
c) chgrp
d) chattr
42) What is the term for the concept where a process runs on one CPU and its tasks run on other CPUs?
a) Symmetric multiprocessing
b) Asymmetric multiprocessing
c) Distributed processing
d) Parallel processing
43) What does FIFO stand for in the context of scheduling algorithms?
a) File In, File Out
b) First In, First Out
c) File Input, File Output
d) Fast Input, Fast Output
48) What does DMA stand for in the context of operating systems?
a) Direct Memory Access
b) Dynamic Memory Allocation
c) Dual Memory Access
d) Data Memory Allocation
49) Which of the following is a device that can perform input and output operations?
a) Monitor
b) Printer
c) Disk drive
d) Keyboard
53) Which of the following is a method to handle the critical section problem?
a) Semaphore
b) Paging
c) Segmentation
d) Multitasking
55) Which of the following is a benefit of using a multi-threaded process over a single-threaded process?
a) Improved performance
b) Simplified coding
c) Reduced resource consumption
d) All of the above
62) What is the main advantage of dynamic linking over static linking?
a) Reduced execution time
b) Better modularity
c) Reduced memory footprint
d) Improved security
71) Which of the following commands is used to create a new directory in UNIX?
a) md
b) mkdir
c) make
d) dir
78) Which of the following is a method to handle multiple users in a time-sharing system?
a) Multitasking
b) Multiprocessing
c) Virtual memory
d) Time slicing
85) Which of the following is not a type of system call in operating systems?
a) Process control
b) File management
c) Device management
d) User management
90) Which of the following commands is used to view the contents of a file in UNIX?
a) cat
b) ls
c) mv
d) rm
96) What does the acronym 'SMP' stand for in operating systems?
a) Symmetric Multiprocessing
b) Synchronized Memory Processing
c) Single Memory Processing
d) Simplified Memory Protection
97) Which of the following is used to allocate unique resource sets to each process?
a) Mutex
b) Semaphore
c) Virtual memory
d) Resource allocation graph
Answer: B) 5
2. A CPU scheduling algorithm has a context switch time of 1ms. If a process requires 5ms of CPU time and the
algorithm switches context 3 times, what is the total time taken?
a. 7ms
b. 8ms
c. 9ms
d. 6ms
Answer: B) 8ms
3. In a Round Robin scheduling algorithm, if the time quantum is 4ms and a process requires 12ms of CPU time, how
many time slices will the process require?
A) 2
B) 3
C) 4
D) 6
Answer: B) 3
4. A process is allocated 10ms of CPU time using the First Come First Serve (FCFS) scheduling algorithm. If the
process arrives at time t=2ms, when will it complete?
a. t=12ms
b. t=10ms
c. t=8ms
d. t=6ms
Answer: A) t=12ms
5. In a Priority Scheduling algorithm, if a process has a priority of 5 and requires 8ms of CPU time, how many time
slices will it require if the time quantum is 2ms?
a. 2
b. 3
c. 4
d. 5
Answer: C) 4
6. Three processes P1, P2, and P3 arrive at time t=0, t=2, and t=4 respectively. Each process requires 6ms of CPU
time. What is the average turnaround time?
a. 8ms
b. 10ms
c. 12ms
d. 14ms
Answer: C) 12ms
7. A process requires 8ms of CPU time and arrives at time t=2. If the CPU is idle until the process arrives, what is the
completion time of the process?
a. t=10ms
b. t=12ms
c. t=8ms
d. t=6ms
Answer: A) t=10ms
8. Two processes P1 and P2 arrive at time t=0 and t=3 respectively. P1 requires 5ms and P2 requires 7ms of CPU
time. What is the average waiting time?
a. 2ms
b. 3ms
c. 4ms
d. 5ms
Answer: B) 3ms
9. A process requires 10ms of CPU time and arrives at time t=5. If the CPU is idle until the process arrives, what is
the turnaround time of the process?
a. 10ms
b. 15ms
c. 20ms
d. 5ms
Answer: B) 15ms
10. Three processes P1, P2, and P3 arrive at time t=0, t=2, and t=6 respectively. Each process requires 4ms of CPU
time. What is the total time required to complete all processes?
a. 12ms
b. 14ms
c. 16ms
d. 18ms
Answer: C) 16ms
11. Three processes P1, P2, and P3 arrive at time t=0 with burst times 3ms, 5ms, and 2ms respectively. What is the
average turnaround time?
a. 4ms
b. 5ms
c. 6ms
d. 7ms
Answer: B) 5ms
12. Two processes P1 and P2 arrive at time t=0 with burst times 4ms and 6ms respectively. If the context switching
time is 1ms, what is the total time required to complete both processes?
a. 10ms
b. 11ms
c. 12ms
d. 13ms
Answer: B) 11ms
13. A process requires 8ms of CPU time and arrives at time t=2. If the CPU is idle until the process arrives, what is the
completion time of the process using SJF scheduling?
a. t=10ms
b. t=12ms
c. t=14ms
d. t=16ms
Answer: A) t=10ms
14. Three processes P1, P2, and P3 arrive at time t=0 with burst times 6ms, 3ms, and 4ms respectively. What is the
average waiting time?
a. 2ms
b. 3ms
c. 4ms
d. 5ms
Answer: B) 3ms
15. Two processes P1 and P2 arrive at time t=0 with burst times 5ms and 3ms respectively. If the context switching
time is 2ms, what is the total time required to complete both processes using SJF scheduling?
a. 9ms
b. 10ms
c. 11ms
d. 12ms
Answer: C) 11ms
16. Three processes P1, P2, and P3 have priorities 3, 5, and 2 respectively, and burst times 4ms, 6ms, and 3ms
respectively. What is the average turnaround time?
a. 5ms
b. 6ms
c. 7ms
d. 8ms
Answer: B) 6ms
17. A process with priority 4 and burst time 8ms arrives at time t=2. If the CPU is idle until the process arrives, what is
the completion time of the process?
a. t=10ms
b. t=12ms
c. t=14ms
d. t=16ms
Answer: A) t=10ms
18. Two processes P1 and P2 have priorities 2 and 3 respectively, and burst times 5ms and 7ms respectively. If the
context switching time is 1ms, what is the total time required to complete both processes?
a. 12ms
b. 13ms
c. 14ms
d. 15ms
Answer: B) 13ms
19. Three processes P1, P2, and P3 have priorities 1, 3, and 2 respectively, and burst times 3ms, 6ms, and 4ms
respectively. What is the average waiting time?
a. 2ms
b. 3ms
c. 4ms
d. 5ms
Answer: B) 3ms
20. Two processes P1 and P2 have priorities 5 and 2 respectively, and burst times 4ms and 6ms respectively. If the
context switching time is 2ms, what is the total time required to complete both processes?
a. 10ms
b. 11ms
c. 12ms
d. 14ms
Answer: C) 12ms
21. A CPU uses a Round Robin scheduling algorithm with a time quantum of 2ms. If a process requires 8ms of CPU
time, how many time slices will it require?
a. 2
b. 3
c. 4
d. 5
Answer: C) 4
22. Three processes P1, P2, and P3 arrive at time t=0 with burst times 4ms, 6ms, and 2ms respectively. If the time
quantum is 2ms, what is the average turnaround time?
a. 6ms
b. 7ms
c. 8ms
d. 9ms
Answer: B) 7ms
23. A process requires 12ms of CPU time and arrives at time t=4. If the time quantum is 4ms, what is the completion
time of the process?
a. t=20ms
b. t=22ms
c. t=24ms
d. t=26ms
Answer: B) t=22ms
24. Two processes P1 and P2 arrive at time t=0 with burst times 8ms and 4ms respectively. If the time quantum is
2ms, what is the total time required to complete both processes?
a. 12ms
b. 14ms
c. 16ms
d. 18ms
Answer: B) 14ms
25. Three processes P1, P2, and P3 arrive at time t=0 with burst times 6ms, 4ms, and 8ms respectively. If the time
quantum is 3ms, what is the average waiting time?
a. 4ms
b. 5ms
c. 6ms
d. 7ms
Answer: B) 5ms
Banker's Algorithm:
26. A system has 3 processes P1, P2, and P3 with maximum resource requirements (10, 5, 3), (6, 4, 2), and (4, 3, 1)
respectively. If the available resources are (8, 4, 2), which process can be executed first?
a. P1
b. P2
c. P3
d. None
Answer: C) P3
27. A system has 2 processes P1 and P2 with resource requirements (4, 2) and (2, 1) respectively. If the available
resources are (3, 2), what is the minimum resource requirement that must be added to execute both processes?
a. (1, 0)
b. (1, 1)
c. (2, 0)
d. (2, 1)
Answer: B) (1, 1)
28. A system has 3 processes P1, P2, and P3 with resource requirements (8, 4), (4, 2), and (2, 1) respectively. If the
available resources are (10, 5), what is the maximum number of processes that can be executed?
a. 1
b. 2
c. 3
d. 0
Answer: B) 2
29. A system has 2 processes P1 and P2 with resource requirements (6, 3) and (4, 2) respectively. If the available
resources are (7, 4), what is the minimum resource requirement that must be added to execute both processes?
a. (1, 0)
b. (1, 1)
c. (2, 0)
d. (2, 1)
Answer: A) (1, 0)
30. A system has 3 processes P1, P2, and P3 with resource requirements (4, 2), (2, 1), and (1, 1) respectively. If the
available resources are (5, 3), what is the order of execution of processes using Banker's Algorithm?
a. P1, P2, P3
b. P1, P3, P2
c. P2, P1, P3
d. P3, P2, P1
31. A system uses a paging mechanism with a page size of 4KB. If a process requires 20KB of memory, how many
pages will be allocated?
a. 4
b. 5
c. 6
d. 8
Answer: B) 5
32. A system uses a segmentation mechanism with three segments of sizes 4KB, 8KB, and 12KB respectively. If a
process requires 18KB of memory, which segments will be allocated?
a. 1st and 2nd segments
b. 2nd and 3rd segments
c. 1st and 3rd segments
d. All three segments
33. A system uses a memory allocation algorithm with a block size of 8KB. If a process requires 24KB of memory, how
many blocks will be allocated?
a. 2
b. 3
c. 4
d. 6
Answer: B) 3
34. A system uses a virtual memory mechanism with a page replacement algorithm. If the page fault rate is 30% and
the average memory access time is 20ns, what is the average page replacement time?
a. 6ns
b. 10ns
c. 15ns
d. 30ns
Answer: C) 15ns
35. A system uses a memory allocation algorithm with a first-fit strategy. If the available memory blocks are 4KB, 8KB,
12KB, and 16KB respectively, and a process requires 10KB of memory, which block will be allocated?
a. 1st block
b. 2nd block
c. 3rd block
d. 4th block
Paging:
36. A system uses a paging mechanism with a page size of 2KB. If a process requires 12KB of memory, how many
pages will be allocated?
a. 4
b. 5
c. 6
d. 8
Answer: C) 6
37. A system uses a paging mechanism with a page table having 4 entries. If each page entry requires 4 bytes, what is
the total size of the page table?
a. 8 bytes
b. 12 bytes
c. 16 bytes
d. 20 bytes
Answer: C) 16 bytes
38. A system uses a paging mechanism with a page size of 4KB and a frame size of 8KB. If a process requires 20KB of
memory, how many frames will be allocated?
a. 2
b. 3
c. 4
d. 5
Answer: C) 4
39. A system uses a paging mechanism with a page replacement algorithm. If the page fault rate is 25% and the
average memory access time is 15ns, what is the average page replacement time?
a. 3.75ns
b. 5ns
c. 7.5ns
d. 10ns
Answer: A) 3.75ns
40. A system uses a paging mechanism with a page size of 8KB. If a process requires 32KB of memory, what is the
number of pages required?
a. 2
b. 3
c. 4
d. 5
Answer: C) 4
41. A disk queue uses FIFO scheduling. If three processes P1, P2, and P3 arrive at time t=0, t=2, and t=4 respectively,
and their burst times are 6ms, 4ms, and 8ms respectively, what is the average turnaround time?
a. 8ms
b. 10ms
c. 12ms
d. 14ms
Answer: B) 10ms
42. A disk queue uses FIFO scheduling. If two processes P1 and P2 arrive at time t=0 and t=3 respectively, and their
burst times are 5ms and 7ms respectively, what is the total time required to complete both processes?
a. 12ms
b. 15ms
c. 17ms
d. 20ms
Answer: B) 15ms
43. A disk queue uses FIFO scheduling. If a process arrives at time t=0 with a burst time of 10ms, and another process
arrives at time t=5 with a burst time of 8ms, what is the average waiting time?
a. 2ms
b. 3ms
c. 4ms
d. 5ms
Answer: C) 4ms
44. A disk queue uses FIFO scheduling. If three processes P1, P2, and P3 arrive at time t=0, t=2, and t=6 respectively,
and their burst times are 4ms, 6ms, and 8ms respectively, what is the average turnaround time?
a. 9ms
b. 11ms
c. 13ms
d. 15ms
Answer: B) 11ms
45. A disk queue uses FIFO scheduling. If a process arrives at time t=0 with a burst time of 8ms, and another process
arrives at time t=4 with a burst time of 6ms, what is the total time required to complete both processes?
a. 14ms
b. 16ms
c. 18ms
d. 20ms
Answer: B) 16ms
46. A disk queue uses OPT scheduling. If three processes P1, P2, and P3 arrive at cylinder numbers 5, 10, and 15
respectively, and their burst times are 4ms, 6ms, and 8ms respectively, what is the total time required to
complete all three processes?
a. 18ms
b. 20ms
c. 22ms
d. 24ms
Answer: B) 20ms
47. A disk queue uses OPT scheduling. If two processes P1 and P2 arrive at cylinder numbers 8 and 12 respectively,
and their burst times are 5ms and 7ms respectively, what is the average seek time?
a. 2ms
b. 3ms
c. 4ms
d. 5ms
Answer: B) 3ms
48. A disk queue uses OPT scheduling. If a process arrives at cylinder number 12 with a burst time of 9ms, and
another process arrives at cylinder number 6 with a burst time of 5ms, what is the total time required to
complete both processes?
a. 14ms
b. 16ms
c. 18ms
d. 20ms
Answer: B) 16ms
49. A disk queue uses OPT scheduling. If three processes P1, P2, and P3 arrive at cylinder numbers 3, 6, and 9
respectively, and their burst times are 4ms, 6ms, and 8ms respectively, what is the average turnaround time?
a. 8ms
b. 10ms
c. 12ms
d. 14ms
Answer: B) 10ms
50. A disk queue uses OPT scheduling. If a process arrives at cylinder number 9 with a burst time of 7ms, and another
process arrives at cylinder number 15 with a burst time of 9ms, what is the total time required to complete both
processes?
a. 16ms
b. 18ms
c. 20ms
d. 22ms
Answer: B) 18ms
51. A disk queue uses LRU scheduling. If three processes P1, P2, and P3 arrive at cylinder numbers 5, 10, and 15
respectively, and their burst times are 4ms, 6ms, and 8ms respectively, what is the total time required to
complete all three processes?
a. 20ms
b. 22ms
c. 24ms
d. 26ms
Answer: C) 24ms
52. A disk queue uses LRU scheduling. If two processes P1 and P2 arrive at cylinder numbers 8 and 12 respectively,
and their burst times are 5ms and 7ms respectively, what is the average seek time?
a. 3ms
b. 4ms
c. 5ms
d. 6ms
Answer: B) 4ms
53. A disk queue uses LRU scheduling. If a process arrives at cylinder number 12 with a burst time of 9ms, and
another process arrives at cylinder number 6 with a burst time of 5ms, what is the total time required to
complete both processes?
a. 16ms
b. 18ms
c. 20ms
d. 22ms
Answer: B) 18ms
54. A disk queue uses LRU scheduling. If three processes P1, P2, and P3 arrive at cylinder numbers 3, 6, and 9
respectively, and their burst times are 4ms, 6ms, and 8ms respectively, what is the average turnaround time?
a. 10ms
b. 12ms
c. 14ms
d. 16ms
Answer: B) 12ms
55. A disk queue uses LRU scheduling. If a process arrives at cylinder number 9 with a burst time of 7ms, and another
process arrives at cylinder number 15 with a burst time of 9ms, what is the total time required to complete both
processes?
a. 18ms
b. 20ms
c. 22ms
d. 24ms
Answer: C) 22ms