Operating System
MCQ questions and answers
- 4.5/5.0
- 1k Enrolled
- All levels
- Last updated 11/2023
- English
Operating System MCQ (100)
| 1. | ____ is used to manage the computer hardwares. |
| A | Application program |
| B | Operating System |
| C | Boot loader |
| D | Utility program |
|
Answer: B |
|
| 2. | Which of the following is a type of application software? |
| A | Word processor |
| B | Spreedsheet |
| C | Web browser |
| D | All of the above |
|
Answer: D |
|
| 3. | What is known as a resource manager? |
| A | Processor |
| B | Memory |
| C | Operating system |
| D | CPU |
|
Answer: C |
|
| 4. | ___ is primarily used for programs that translate source code from a high-level programming language to a lower level language |
| A | Interpreter |
| B | Source editor |
| C | Assembler |
| D | Compiler |
|
Answer: D |
|
| 5. | _____ is a computer program that is the core of a computer’s operating system, with complete control over everything in the system |
| A | Shell |
| B | Application |
| C | Antivirus – service |
| D | Kernel |
|
Answer: D |
|
| 6. | _____ sit on top of systems software because they are unable to run without the operating system and system utilities |
| A | Device driver |
| B | Application program |
| C | Programming |
| D | Control program |
|
Answer: B |
|
| 7. | The ______ is a digital circuit that manages the flow of data going to and from the computer’s main memory. |
| A | processor |
| B | device controller |
| C | memory controller |
| D | hard drive |
|
Answer: C |
|
| 8. | Which of the following program load initially? |
| A | Bootstrap program |
| B | Interrupt |
| C | Batch program |
| D | Firmware program |
|
Answer: A |
|
| 9. | ______ an input signal to the processor indicating an event that needs immediate attention. |
| A | operating system |
| B | kernel |
| C | shell |
| D | interrupt |
|
Answer: D |
|
| 10. | _____ is a register in a computer processor that contains the address (location) of the instruction being executed at the current time. |
| A | stack |
| B | register |
| C | memory |
| D | program counter |
|
Answer: D |
|
| 11. | ____ is based on the stored-program computer concept, where instruction data and program data are stored in the same memor |
| A | Modern system architecture |
| B | Von Neumann architecture |
| C | Turing architecture |
| D | None |
|
Answer: B |
|
| 12. | The CPU fetches an instruction from memory, it is temporarily stored in the ____ |
| A | instruction register |
| B | stack pointer |
| C | program counter |
| D | cache memory |
|
Answer: A |
|
| 13. | SCSI stands for |
| A | Small Command System Interface |
| B | Single Computer System Interface |
| C | Small Computer System Interface |
| D | Small Computer System Index |
|
Answer: C |
|
| 14. | Parallel system is also known as __________. |
| A | single processor system. |
| B | mainframe system. |
| C | tightly coupled system. |
| D | cloud system. |
|
Answer: C |
|
| 15. | The purpose of _____ is to prevent catastrophic failure. |
| A | fault tolerant |
| B | graceful degradation |
| C | compaction |
| D | starvation |
|
Answer: B |
|
| 16. | Some system uses __________ multiprocessing policy, in which each of the processors is assigned a specific task. |
| A | symmetric |
| B | asymmetric |
| C | graceful degradation |
| D | parallel processing |
|
Answer: B |
|
| 17. | A single-threaded process has one __________ which is used to specify the next instructions to execute. |
| A | instruction register |
| B | program counter |
| C | stack pointer |
| D | data segment register |
|
Answer: B |
|
| 18. | Which is most commonly used interface? |
| A | CLI |
| B | GUI |
| C | Batch Interface |
| D | Icon |
|
Answer: B |
|
| 19. | ________ model allows multiple processes to read and write data to the message queue without being connected to each other. |
| A | shared memory |
| B | message passing |
| C | process synchronization |
| D | databus |
|
Answer: B |
|
| 20. | a _____ is a user interface for access to an operating system’s services. |
| A | kernel |
| B | compiler |
| C | linker |
| D | shell |
|
Answer: D |
|
| 21. | ____ is a set of commands, functions, protocols, and objects that programmers can use to create software or interact with an external system |
| A | Application Programming Interface |
| B | Application program |
| C | Kernel |
| D | Shell |
|
Answer: A |
|
| 22. | _____ is used to handle the dump file when it is written to the disk. |
| A | kernel |
| B | shell |
| C | control card |
| D | debugger |
|
Answer: D |
|
| 23. | Which system call is used to start the new process? |
| A | fork() |
| B | exe() |
| C | createProcess() |
| D | init() |
|
Answer: A |
|
| 24. | ____ is a performance analysis and troubleshooting tool that is included by default with various operating systems. |
| A | shell |
| B | kernel |
| C | DTrace |
| D | Antivirus |
|
Answer: C |
|
| 25. | ______ is an operating system (OS) or application environment that is installed on software, which imitates dedicated hardware. |
| A | emulation |
| B | virtual machine |
| C | para-virtual |
| D | simulation |
|
Answer: B |
|
| 26. | ____ queue keeps all the processes in the system. |
| A | Ready queue |
| B | Job queue |
| C | Device queue |
| D | None |
|
Answer: B |
|
| 27. | ____ is an area of dynamically-allocated memory that is managed automatically by the OS or the memory manager library. |
| A | Program counter |
| B | Data section |
| C | Heap area |
| D | CPU register |
|
Answer: C |
|
| 28. | Sub process is called as __________. |
| A | program |
| B | instruction |
| C | thread |
| D | job |
|
Answer: C |
|
| 29. | _____ is a queue of all processes that are waiting to be scheduled on a core/CPU |
| A | ready queue |
| B | job queue |
| C | memory |
| D | RAM |
|
Answer: A |
|
| 30. | The set of processes waiting for allocation of certain I/O devices is kept in the ______. |
| A | job queue |
| B | ready queue |
| C | device queue |
| D | none |
|
Answer: C |
|
| 31. | ____ is a unique number that identifies each of the running processes in an operating system. |
| A | CID |
| B | PID |
| C | QID |
| D | RID |
|
Answer: B |
|
| 32. | The processes are waiting for a particular I/O device, such type of processes are allocated to the ___ queue. |
| A | device queue |
| B | ready queue |
| C | Both are same |
| D | None |
|
Answer: A |
|
| 33. | The long term scheduler is called as __________. |
| A | short term scheduler |
| B | CPU scheduler |
| C | medium-term scheduler |
| D | job scheduler |
|
Answer: D |
|
| 34. | Which scheduler is known as CPU scheduler? |
| A | Short term scheduler |
| B | Long term scheduler |
| C | Medium term scheduler |
| D | Job scheduler |
|
Answer: A |
|
| 35. | ____scheduler select the process from the disk and loads them into the memory for further processing. |
| A | Short term scheduler |
| B | CPU scheduler |
| C | Long term scheduler |
| D | None of these |
|
Answer: C |
|
| 36. | _______ scheduler is in-charge of handling the swapped out-processes. |
| A | Medium-term scheduler |
| B | CPU scheduler |
| C | Long term scheduler |
| D | None of the above |
|
Answer: A |
|
| 37. | What is controlled by the long term scheduler? |
| A | Degree of multiprogramming |
| B | Degree of multiprocessing |
| C | Page fault |
| D | Processor |
|
Answer: A |
|
| 38. | ______ refers to a condition in which the time it takes to complete a computation is determined principally by the period spent waiting for input/output operations to be completed |
| A | CPU bound process |
| B | I/O bound process |
| C | Swapping |
| D | Scheduling |
|
Answer: B |
|
| 39. | ____ describes the maximum number of processes that a single-processor system can accommodate efficiently |
| A | Degree of multiprogramming |
| B | Degree of transmission |
| C | Scheduling |
| D | None of the above |
|
Answer: A |
|
| 40. | The process can be reintroduced into the memory and its execution continue where it is left off, this concept is known as __________. |
| A | Thrashing |
| B | Swapping |
| C | Scheduling |
| D | Multiprogramming |
|
Answer: B |
|
| 41. | _____ is a set of programming interfaces that allow a programmer to coordinate activities among different program processes that can run concurrently in an operating system |
| A | shared memory |
| B | Message passing |
| C | Interprocess communication |
| D | Data segment register |
|
Answer: C |
|
| 42. | ____ memory can be simultaneously accessed by multiple processes. |
| A | Shared memory |
| B | Secondary memory |
| C | All of the above |
| D | None of the above |
|
Answer: A |
|
| 43. | _____ is the instance of a computer program that is being executed by one or many threads. |
| A | Software |
| B | Process |
| C | Application |
| D | none of these |
|
Answer: B |
|
| 44. | ____is a single sequence stream within a process and they are called as light weight processes. |
| A | Program |
| B | Thread |
| C | Message |
| D | interrupt |
|
Answer: B |
|
| 45. | RPC stands for |
| A | Remote Program Call |
| B | Remote Procedure Call |
| C | Return Procedure Call |
| D | Remote Procedure Catalog |
|
Answer: B |
|
| 46. | _____ is a protocol that one program can use to request a service from a program located in another computer on a network without having to understand the network’s details. |
| A | RPC |
| B | RRC |
| C | CISC |
| D | XDR |
|
Answer: A |
|
| 47. | ____ is a connection between two processes, such that the standard output from one process becomes the standard input of the other process |
| A | thread |
| B | pipe |
| C | bridge |
| D | link |
|
Answer: B |
|
| 48. | The _____ is a register in the system to point to the end of the stack. |
| A | Program counter |
| B | stack pointer |
| C | Heap pointer |
| D | none |
|
Answer: B |
|
| 49. | _____ is a function that executes asynchronously in the context of a particular thread. |
| A | Asynchronous Procedure Call |
| B | Synchronous Procedure Call |
| C | Interrupt |
| D | Multithread |
|
Answer: A |
|
| 50. | ____ is a collection of threads on which work items can be scheduled and managed by the class library or OS. |
| A | Queue |
| B | Dispatcher |
| C | Threadpool |
| D | Stub |
|
Answer: C |
|
| 51. | The communication between the user thread library and the kernel is known as __________. |
| A | message passing |
| B | upcall handler |
| C | scheduler activation |
| D | None of the above |
|
Answer: C |
|
| 52. | Which function is used to create the thread in a Linux system? |
| A | clone() |
| B | fork() |
| C | exe() |
| D | CreateThread() |
|
Answer: A |
|
| 53. | once a process enters the running state, it cannot be preempted until it completes its allotted time is known as ______ |
| A | Preemptive |
| B | Non-preemptive |
| C | SJF |
| D | None of these |
|
Answer: B |
|
| 54. | Which is the module that gives control of the CPU to the process selected by the short-term scheduler? |
| A | Kernel |
| B | Dispatcher |
| C | Program counter |
| D | None |
|
Answer: B |
|
| 55. | The time is taken by the dispatcher to respond to a request for a process to begin operation which is known as ____ |
| A | turn arround time |
| B | seek time |
| C | dispatch latency |
| D | response time |
|
Answer: C |
|
| 56. | Waiting time is the sum of the periods spend in waiting state in __________. |
| A | ready queue |
| B | feedback queue |
| C | job queue |
| D | device queue |
|
Answer: A |
|
| 57. | FCFS stands for |
| A | First connect first serve |
| B | First come first select |
| C | First come first serve |
| D | none |
|
Answer: C |
|
| 58. | Priority scheduling can be either __________. |
| A | preemptive |
| B | non-preemptive |
| C | either preemptive or non-preemptive |
| D | none of these |
|
Answer: C |
|
| 59. | Which scheduling algorithm causes the starvation? |
| A | SJF |
| B | R-R |
| C | FCFS |
| D | Priority scheduling and SJF |
|
Answer: D |
|
| 60. | What is the solution to avoid the starvation? |
| A | Indefinite blocking |
| B | Aging |
| C | Processor sharing |
| D | Round Robin scheduling |
|
Answer: B |
|
| 61. | A time quantum is generally from __________ to __________ millisecond in length. |
| A | 1 to 100 |
| B | 10 to 100 |
| C | 50 to 500 |
| D | 10 to 1000 |
|
Answer: B |
|
| 62. | ______occur when two threads interact in a negatve (buggy) way depending on the exact order that their different instructions are executed. |
| A | deadlock |
| B | spin lock |
| C | race condition |
| D | critical section |
|
Answer: C |
|
| 63. | _____ is a code segment that accesses shared variables and has to be executed as an atomic action. |
| A | entry section |
| B | critical section |
| C | mutual exclusion |
| D | none |
|
Answer: B |
|
| 64. | A binary semaphore is known __________ which provide the mutual exclusion. |
| A | spin lock |
| B | mutex lock |
| C | both |
| D | none |
|
Answer: B |
|
| 65. | ___ is a situation where a set of processes are blocked because of each process is holding a resource and waiting for another resource acquired by some other process. |
| A | Deadlock |
| B | Spin lock |
| C | Semaphore |
| D | mutex |
|
Answer: A |
|
| 66. | ______ is loaded with the physical location where the process begins the execution |
| A | stack pointer |
| B | base register |
| C | program counter |
| D | limit register |
|
Answer: B |
|
| 67. | __________ register specify the length of processes. |
| A | limit register |
| B | stack pointer |
| C | base register |
| D | none |
|
Answer: A |
|
| 68. | _____ is a collection of processes in storage that are waiting to be brought into memory to run a program. |
| A | ready queue |
| B | memory |
| C | job queue |
| D | input queue |
|
Answer: D |
|
| 69. | The run-time mapping of the virtual address to the physical address is performed by the hardware device called __________. |
| A | Memory Management Unit (MMU) |
| B | Memory Address Register (MAR) |
| C | Virtual Memory Unit (VMU |
| D | none of these |
|
Answer: A |
|
| 70. | _____ is a small program routine that substitutes for a longer program, possibly to be loaded later or that is located remotely. |
| A | Loader |
| B | Linker |
| C | Stub |
| D | Compiler |
|
Answer: C |
|
| 71. | Which addresses are computed at the time of execution? |
| A | Logical address |
| B | Physical address |
| C | Both A and B |
| D | None of these |
|
Answer: B |
|
| 72. | _____ also refers to a module that, once loaded into main memory, is expected to remain in memory for a short time. |
| A | Fragmentation |
| B | Stub |
| C | Transient |
| D | Compaction |
|
Answer: C |
|
| 73. | Which memory allocation policy is faster? |
| A | First fit |
| B | Best fit |
| C | Worst fit |
| D | None |
|
Answer: A |
|
| 74. | The first-fit and best-fit strategies of the memory allocation are suffered from the __________. |
| A | Internal fragmentation |
| B | External fragmentation |
| C | Page fault |
| D | None of the above |
|
Answer: B |
|
| 75. | ____ is a memory management scheme by which computer stores and retrieves the data from secondary storage for use in main memory. |
| A | Swapping |
| B | Demand paging |
| C | Paging |
| D | Non-contiguous |
|
Answer: C |
|
| 76. | Breaking a logical memory into block of the same size called __________. |
| A | frame |
| B | pages |
| C | page offset |
| D | block |
|
Answer: B |
|
| 77. | Breaking the physical memory into the fixed-sized block called __________. |
| A | page |
| B | memory block |
| C | frames |
| D | fragmentation |
|
Answer: C |
|
| 78. | TLB stands for __________. |
| A | Transformation Look Buffer |
| B | Translation Look-aside Buffer |
| C | Transformation Look aside Buffer |
| D | Transformation Look Block |
|
Answer: B |
|
| 79. | The ______ stores the recent translations of virtual memory to physical memory and can be called an address-translation cache. |
| A | TLB |
| B | heap area |
| C | MMU |
| D | Pointer |
|
Answer: A |
|
| 80. | ____ is commonly required in operating systems and in applications intended to be shared in multi-use systems. |
| A | Reentrant code |
| B | Stub |
| C | Source |
| D | none |
|
Answer: A |
|
| 81. | ____ can be used to overcome the drawbacks of the page table |
| A | Inverted page table |
| B | Clustered page table |
| C | Hash page table |
| D | Sparse page table |
|
Answer: A |
|
| 82. | _____ page table store the mappings for multiple base pages in a single PTE. |
| A | inverted |
| B | clustered |
| C | sparse |
| D | none of the above |
|
Answer: B |
|
| 83. | ____ is a memory management technique in which, the memory is divided into the variable size parts. |
| A | Page mapping |
| B | Segmentation |
| C | Demand paging |
| D | Compaction |
|
Answer: B |
|
| 84. | LDT stands for |
| A | Local Data Table |
| B | Local Descriptor Table |
| C | Linear Data Table |
| D | Local Data Time |
|
Answer: B |
|
| 85. | Which memory allows processes to share the files easily and to implement shared memory managment scheme? |
| A | Primary |
| B | Secondary memory |
| C | Cache memory |
| D | Virtual address |
|
Answer: D |
|
| 86. | ______ is a type of computer file that attempts to use file system space more efficiently when the file itself is partially empty. |
| A | kernel file |
| B | block file |
| C | boot.ini file |
| D | sparse file |
|
Answer: D |
|
| 87. | __________ is used in a virtual memory of the system. |
| A | segmentation |
| B | paging |
| C | demand paging |
| D | page replacement |
|
Answer: C |
|
| 88. | _____ never swaps the page into memory unless that page will be needed. |
| A | Lazy swapper |
| B | Pager |
| C | Garbage collector |
| D | none |
|
Answer: A |
|
| 89. | Which technique is used to copy the data resources in a computer system? |
| A | copy-on-write |
| B | Locality of reference |
| C | Page protection |
| D | None of the above |
|
Answer: A |
|
| 90. | If the number of page frames increases then number of page faults is also increasing for certain memory access patterns, such a phenomenon is known as ____. |
| A | Belady anomaly |
| B | Deadlock |
| C | Dirty bit |
| D | Victim frame |
|
Answer: A |
|
| 91. | The belady’s anomaly is commonly experienced when using the ______ page replacement algorithm. |
| A | FIFO page replacement |
| B | Optimal page replacement |
| C | LRU |
| D | MRU |
|
Answer: A |
|
| 92. | LRU stands for |
| A | Least Recently Used |
| B | Last Replaceed unit |
| C | Least Replaced Unit |
| D | none |
|
Answer: A |
|
| 93. | An optimal page replacement algorithm replaces the most recently used page to minimize the page faults is also known as ______. |
| A | Least Recently Used (LRU) |
| B | Most Recently Used (MRU) |
| C | Just Recently Used (JRU) |
| D | Demand paging |
|
Answer: B |
|
| 94. | In ____ the operating system keeps track of all pages in the memory in a queue, the oldest page is in the front of the queue. |
| A | MRU |
| B | LRU |
| C | FIFO |
| D | LIFO |
|
Answer: C |
|
| 95. | When a process needs a page which is not in the memory, it can bring in the new page and allocate it a frame from the set of all frames, even if that frame is currently allocated to some other process is known as ______. |
| A | Local replacement |
| B | Global replacement |
| C | Proportional replacement |
| D | Least Recently Used |
|
Answer: B |
|
| 96. | ______ is a method of configuring a cluster of the microprocessor in a multiprocessing system so that they can share memory locally which improve the performance and the ability of the system. |
| A | Uniform Memory Access |
| B | Non-Uniform Memory Access (NUMA) |
| C | Realtime system |
| D | Direct Memory Access System (DMA) |
|
Answer: B |
|
| 97. | If process is spending more time on paging rather than execution is called as __________. |
| A | thrashing |
| B | page fault |
| C | dead lock |
| D | spin lock |
|
Answer: A |
|
| 98. | ___ is the actual contenter of the data associated with objects of the specific kind of the containing cache. |
| A | Cache |
| B | Frame |
| C | Stub |
| D | Slab |
|
Answer: D |
|
| 99. | When the amount of free memory falls below the threshold, the virtual memory manager uses a tactic to restore a value above the threshold is known as ______. |
| A | automatic working set trimming |
| B | priority paging |
| C | pageout |
| D | none |
|
Answer: A |
|
| 100. | ____is a storage mechanism used to retrieve processes from the secondary storage into the main memory in the form of pages. |
| A | Paging |
| B | Page-out |
| C | Compaction |
| D | Defragmentation |
| Answer: A |
Video Lectures of C Language
