Operating System Objective Questions and answers pdf for GATE

Operating System Objective Questions, MCQs Multiple Choice with answers pdf for GATE and other competitive & academic examinations.

Operating System Objective

Operating System Objective Questions and answers

1. Operating System is a System Software that provides an environment to help the user to execute the programs.
Ans. True

2. A form of processing known as spooling is an acronym for ___.
Ans. Simultaneous Peripheral Operation On-Line

3. Disk Operating System (DOS) is an example of ___.
a) PC OS
b) Multi-processor OS
c) Distributed OS
d) Real-Time OS
Ans. a

4. A typical operating system that supports a multiprogramming environment will be less than 1MB in size.
Ans. False

5. ___ suggested the layered approach to lessen the design and implementation complexities of an operating system.
Ans. Dijkstra

6. The OS in IBM 370 is based on the ___ approach.
a) Kernel
b) Virtual Machine
c) Layered
d) None of the above
Ans. b

7. The UNIX kernel is divided into three modes: user mode, kernel mode, and hardware.
Ans. True

8. In the UNIX kernel, __ subsystem contains scheduler, Inter-process communication and memory management.
Ans. Process Control

9. By using ___ techniques, an operating system can create the illusion that a process has its own processor with its own memory.
a) CPU Scheduling
b) Virtual Memory
c) Both A and B
d) None of the above
Ans. c

10. Virtual environment is also referred to as the virtual private server.
Ans. True

11. ___ and ___ are two common software packages that permit a heterogeneous collection of networked UNIX and/or Windows computers to be used as a single, large, parallel computer.
Ans. Parallel Virtual Machine (PVM), Message Passing Interface (MPI)

12. ___ allows plug-in hardware to include boot-time diagnostics, configuration code, and device drivers that will run on any kind of CPU.
a) p-code
b) Java Virtual Machine (JVM)
c) Common Language Runtime (CLR)
d) Open Firmware
Ans. d

13. A process is executed in parallel, with multiple instructions at a time.
Ans. False

14. In the bottom-up approach, the overall functionality and features are determined and are separated into components.
Ans. False

15. In the Layered Approach, the bottom layer id the ___; the highest in the ___.
Ans. Hardware, User Interface

16. In the mid-1980s, researches at Carnegie Mellon University developed an operating system called ___ that modularized the kernel using the microkernel approach.
a) DOS
b) Mac
c) Unix
d) Linux
Ans. b

17. Operating System acts as an interface between user programs and hardware.
Ans. True

18. ___ is an example of an Operating System that doesn’t have a well-defined structure.

19. ___ is a part of UNIX OS.
a) Kernel
b) Module
c) Core
d) Software
Ans. a

20. A ___ serves as a repository of information about a process and varies from process to process.
Ans. Process Control Block (PCB)

21. Scheduling is a fundamental operating-system function.
Ans. True

22. The ___ selects from among the processes in memory that are ready to execute and allocates the CPU to one of them.
Ans. CPU Scheduler

23. In real systems CPU utilization ranges from ___ for a lightly loaded system to ___ for heavily loaded systems.
a) 40%, 90%
b) 50%, 50%
c) 90%, 40%
d) 25%, 75%
Ans. a) 40%, 90%

24. The FCFS algorithm is implemented by using a Last-In-First-Out (LIFO) queue structure.
Ans. False

25. In the ___ algorithm, when the CPU is available, it is assigned to the process that has the smallest next CPU burst.
Ans. Shortest-Job-First Scheduling

26. The ___ CPU scheduling algorithm is basically a preemptive scheduling algorithm designed for time-sharing systems.
Ans. Round-Robin

27. To select an algorithm first we must define, the criteria on which we can select the best algorithm.
Ans. True

28. N = Lambda x W is ___ formula.
Ans. Little’s

29. When a process is waiting for CPU, we can say it is in ___ state.
a) Ready
b) New
c) Running
d) Waiting
Ans. a) Ready

30. The main objective of multiprogramming is to see that some process is always running so as to maximize CPU utilization.
Ans. True

31. Inter-Process Communication provides a mechanism to allow processes to communicate and to synchronize their actions.
Ans. True

32. RPC stands for ___.
Ans. Remote Procedure Call

33. The ___ queue has a finite length n; thus, at most n messages can reside in it. (Pick right option)
a) Bounded Capacity
b) Zero Capacity
c) Unbounded Capacity
d) None of the above
Ans. a) Bounded Capacity

34. A critical-section is a part of the program that accesses a shared resource (data structure or device) that must not be concurrently accessed by more than one process of execution.
Ans. True

35. An algorithm developed for solving the critical-section problem for n processes is also called the ___ algorithm.
Ans. Bakery

36. If process Pi is executing in its critical section, then no other processes can be executing in their critical-sections. This is called a ___.
a) Bounded Waiting
b) Mutual Exclusion
c) Progress
d) None of the above
Ans. b) Mutual Exclusion

37. Semaphores are the classic method for restricting access to shared resources (e.g. storage) in a multi-processing environment.
Ans. True

38. Semaphores were invented by ___.
Ans. Dijkstra

39. ___ is a high-level synchronization construct that is a collection of procedures, variables and data structures grouped together.
a) Semaphores
b) Processes
c) Monitor
d) None of the above
Ans. c) Monitor

40. The operating system ___ schedules processes from the ready queue for execution by the CPU.
Ans. Scheduler

41. Several processes compete for a finite set of resources in a multi-programmed environment.
Ans. True

42. A process Pi that is waiting for some currently unavailable resource is said to be ___.
Ans. Blocked

43. A condition where at least one of the resources is non-shareable in a system is called ___.
a) Mutual Exclusion
b) Hold and Wait
c) Circular Wait
d) None of the above
Ans. a) Mutual Exclusion

44. Shared resources always involve in deadlocks.
Ans. False

45. A deadlock ___ algorithm requires each process to make known in advance the maximum number of resources of each type that it may need.
Ans. Avoidance

46. ___ algorithm is used where resources have multiple instances.
a) Resource Allocation Graph
b) Banker’s
c) Resource Request
d) None of the above
Ans. b) Banker’s

47. If the system does not ensure that a deadlock cannot be prevented or a deadlock cannot be avoided, then a deadlock may occur.
Ans. True

48. ___ is a variant of the resource allocation graph, which can be used to detect deadlocks in the system that has resources, all of which have only single instances.
Ans. Wait-for Graph

49. ___, ___ and ___ are the three basic approaches to handle deadlocks.
Ans. Prevention, Avoidance, Detection

50. CPU switching from one process to another requires saving the state of the current process and loading the latest state of the next process. This is known as a ___.
a) Program Switch
b) Context Switch
c) Process Switch
d) OS Switch
Ans. b) Context Switch

51. The logical address is also sometimes referred to as a virtual address.
Ans. True

52. An address generated by the CPU is referred to as a ___.
Ans. Logical Address

53. MAR stands for ___.
a) Memory Address Register
b) Memory Allocation Register
c) Main Address Register
d) Main Allocation Register
Ans. a) Memory Address Register

54. The operating system is usually present in the upper portion of the main memory.
Ans. False

55. The method of relocating processes in memory so that the fragmented holes create one contiguous hole in memory is called ___.
Ans. Compaction

56. PTBR stands for ___.
a) Page Table Box Register
b) Page Table Base Register
c) Physical Table Base Register
d) Physical Table Box Register
Ans. b) Page Table Base Register

57. Memory management using paging provides two entirely different views of memory – logical view and physical view.
Ans. True

58. ___ is a memory management scheme that supports the user’s view of the main memory.
Ans. Segmentation

59. Segments of user programs are allocated memory by the ___.
a) FCFC Scheduler
b) FIFO Scheduler
c) Bob Scheduler
d) LIFO Scheduler
Ans. c) Bob Scheduler

60. An application program provides a mechanism for process creation and termination.
Ans. False

61. Every process needs to be loaded into physical memory for execution.
Ans. True

62. ___ is implemented using demand paging.
Ans. Virtual Memory

63. When a process is to be executed then only that page of the process, which needs to be currently executed, is swapped into memory. This method is called a ___.
a) Demand Paging
b) Request Paging
c) Swap Paging
d) Change Paging
Ans. a) Demand Paging

64. Whenever a page fault occurs instead of using any page replacement algorithms simply terminate the process.
Ans. False

65. ___ algorithm is more a benchmark algorithm for comparison.
Ans. Optimal Page Replacement

66. Generally when the number of frames available increases, the number of page faults should decrease. Instead, if the page faults also increase, this unexpected result is called ___.
a) Charlie’s anomaly
b) Belady’s anomaly
c) John’s anomaly
d) Pascal’s anomaly
Ans. b) Belady’s Anamoly

67. The operating system closely monitors CPU utilization.
Ans. True

68. ___ is a high paging activity in which a process spends more time in paging than executing.
Ans. Thrashing

69. PFF stands for ___.
a) Page Fault Finder
b) Page Finding Frequency
c) Page Fault Frequency
d) Page Fault Finding
Ans. c) Page Fault Frequency

70. A process terminates when it finishes executing its last statement and asks the operating system to delete it by using the ___.
Ans. Exit System Call

71. The operating system provides a uniform logical view of information stored in different storage media.
Ans. True

72. A ___ is a collection of related information recorded on the secondary storage.
Ans. File

73. Usually a block size will be ___ bytes.
a) 512
b) 256
c) 128
d) 64
Ans. a) 512

51. ___ can be improved by executing a number of unrelated user processes on different processors in parallel.
Ans. Throughput

52. MIMD means ___.
Ans. Multiple Instruction Streams, Multiple Data Stream

53. ___ occurs when more than one processor attempts to access the same memory at the same time.
Ans. Contention

54. Processors and memory in a multiprocessor system can be interconnected by the use of ___.
Ans. Multistage switch

55. In a uniprocessor system an illusion of multiprocessing is created by multiplexing the processor among ___.
Ans. virtual processes

Leave a Comment

Your email address will not be published. Required fields are marked *

Scroll to Top