61. Preemptive —————-scheduling is sometimes called shortest remaining-time-first
scheduling.
a. First-Come-First-Served (FCFS)
b. Round-Robin
c. Sorted Job First (SJF)
d. Priority
62. OS helps manages the following except
a. Application software
b. Bus speed of the system
c. Memory
d. Virtual memoryb. non-preemptive only
c. preemptive or non-preemptive.
d. None of the given options
63. The major advantage of multi-programming system is
a. More than one jobs can be processed at a given time
b. CPU utilization can be increased
c. Jobs can be completed quickly
d. All of the options are correct
64. DOS is a single user operating system.
a. True
b. False
65. Time interval when the I/O Devices are accessed is known as ——–
a. CPU Burst
b. IO Burst
c. Time Slice
d. None of Above
66. Progress and Bounded Waiting are some of the characteristics to solve the critical section
problems.
a. True
b. False
67. A program in execution is called a _______________.
a. Command
b. Process
c. Software
d. Compiler
68. The priorities of processes in the __________ group remain fixed.
a. Kernel
b. User
69. Process State is a part of
a. Process Control block
b. Inode
c. File Allocation Table
d. None of the above
70. Virtual Memory is commonly implemented by __________.a. Segmentation
b. Swapping
c. Demand Paging
d. None of the above
71. Virtual memory is __________.
a. An extremely large main memory
b. An extremely large secondary memory
c. An illusion of extremely large main memory
d. A type of memory used in super computers
72. The kernel keeps track of the state of each task by using a data structure called __
a. Process control block
b. 2 User control block
c. 3 Memory control block
d. 4 None of the above
73. _________ page replacement algorithm suffers from Belady’s anamoly.
a. LRU
b. MRU
c. FIFO
d. LIFO
74. A program at the time of executing is called ________.
a. Dynamic program
b. Static program
c. Binded Program p
d. A Process
75. _______ OS pays more attention on the meeting of the time limits.a. Distributed
b. Network
c. Real time
d. Online
76. A process said to be in ___________ state if it was waiting for an event that will never occur.
a. Safe
b. Unsafe
c. Starvation
d. Dead lock
77. The removal of process from active contention of CPU and reintroduce them into memory later is known as ____________.
a. Interrupt
b. Swapping
c. Signal
d. Thread
78. The problem of thrashing is effected scientifically by ________.
a. Program structure
b. Program size
c. Primary storage size
d. None of the above
79. Paging _________
a. solves the memory fragmentation problem
b. allows modular programmingc. allows structured programming
d. avoids deadlock
80. Real time systems are ________.
a. Primarily used on mainframe computers
b. Used for monitoring events as they occur
c. Used for program development
d. Used for real time interactive users
