Operating System Questions & Answers – CPU Scheduling

This set of Operating System Multiple Choice Questions & Answers (MCQs) focuses on “CPU
Scheduling”.

1. Which module gives control of the CPU to the process selected by the short-term scheduler?

a) dispatcher

b) interrupt

c) scheduler

d) none of the mentioned

Answer: a

Explanation: None.

2. The processes that are residing in main memory and are ready and waiting to execute are kept on a
list called _____________

a) job queue

b) ready queue

c) execution queue

d) process queue

Answer: b

Explanation: None.

3. The interval from the time of submission of a process to the time of completion is termed as
____________

a) waiting time

b) turnaround time

c) response time

d) throughput

Answer: b

Explanation: None.

4. Which scheduling algorithm allocates the CPU first to the process that requests the CPU first?

a) first-come, first-served scheduling

b) shortest job scheduling

c) priority scheduling

d) none of the mentioned

Answer: a

Explanation: None.

5. In priority scheduling algorithm ____________

a) CPU is allocated to the process with highest priority

b) CPU is allocated to the process with lowest priority

c) Equal priority processes can not be scheduled

d) None of the mentioned

Answer: a

Explanation: None.

6. In priority scheduling algorithm, when a process arrives at the ready queue, its priority is compared
with the priority of ____________

a) all process

b) currently running process

c) parent process

d) init process

Answer: b

Explanation: None.

7. Which algorithm is defined in Time quantum?

a) shortest job scheduling algorithm

b) round robin scheduling algorithm

c) priority scheduling algorithm

d) multilevel queue scheduling algorithm

Answer: b

Explanation: None.

8. Process are classified into different groups in ____________

a) shortest job scheduling algorithm

b) round robin scheduling algorithm

c) priority scheduling algorithm

d) multilevel queue scheduling algorithm

Answer: d

Explanation: None.

9. In multilevel feedback scheduling algorithm ____________

a) a process can move to a different classified ready queue

b) classification of ready queue is permanent

c) processes are not classified into groups

d) none of the mentioned

Answer: a

Explanation: None.

10. Which one of the following can not be scheduled by the kernel?

a) kernel level thread

b) user level thread

c) process

d) none of the mentioned

Answer: b

Explanation: User level threads are managed by thread library and the kernel is unaware of them.

Operating System Questions and Answers – CPU Scheduling Benefits

1. CPU scheduling is the basis of ___________

a) multiprocessor systems

b) multiprogramming operating systems

c) larger memory sized systems

d) none of the mentioned

Answer: b

Explanation: None.

2. With multiprogramming ______ is used productively.

a) time

b) space
c) money

d) all of the mentioned

Answer: a

Explanation: None.

3. What are the two steps of a process execution?

a) I/O & OS Burst

b) CPU & I/O Burst

c) Memory & I/O Burst

d) OS & Memory Burst

Answer: b

Explanation: None.

4. An I/O bound program will typically have ____________

a) a few very short CPU bursts

b) many very short I/O bursts

c) many very short CPU bursts

d) a few very short I/O bursts

Answer: c

Explanation: None.

5. A process is selected from the ______ queue by the ________ scheduler, to be executed.

a) blocked, short term

b) wait, long term

c) ready, short term

d) ready, long term

Answer: c

Explanation: None.

6. In the following cases non – preemptive scheduling occurs?

a) When a process switches from the running state to the ready state

b) When a process goes from the running state to the waiting state

c) When a process switches from the waiting state to the ready state
d) All of the mentioned

Answer: b

Explanation: There is no other choice.

7. The switching of the CPU from one process or thread to another is called ____________

a) process switch

b) task switch

c) context switch

d) all of the mentioned

Answer: d

Explanation: None.

8. What is Dispatch latency?

a) the speed of dispatching a process from running to the ready state

b) the time of dispatching a process from running to ready state and keeping the CPU idle

c) the time to stop one process and start running another one

d) none of the mentioned

Answer: c

Explanation: None.

9. Scheduling is done so as to ____________

a) increase CPU utilization

b) decrease CPU utilization

c) keep the CPU more idle

d) none of the mentioned

Answer: a

Explanation: None.

10. Scheduling is done so as to ____________

a) increase the throughput

b) decrease the throughput

c) increase the duration of a specific amount of work

d) none of the mentioned

Answer: a

Explanation: None.

11. What is Turnaround time?

a) the total waiting time for a process to finish execution

b) the total time spent in the ready queue

c) the total time spent in the running queue

d) the total time from the completion till the submission of a process

Answer: d

Explanation: None.

12. Scheduling is done so as to ____________

a) increase the turnaround time

b) decrease the turnaround time

c) keep the turnaround time same

d) there is no relation between scheduling and turnaround time

Answer: b

Explanation: None.

13. What is Waiting time?

a) the total time in the blocked and waiting queues

b) the total time spent in the ready queue

c) the total time spent in the running queue

d) the total time from the completion till the submission of a process

Answer: b

Explanation: None.

14. Scheduling is done so as to ____________

a) increase the waiting time

b) keep the waiting time the same

c) decrease the waiting time

d) none of the mentioned

Answer: c
Explanation: None.

15. What is Response time?

a) the total time taken from the submission time till the completion time

b) the total time taken from the submission time till the first response is produced

c) the total time taken from submission time till the response is output

d) none of the mentioned

Answer: b

Explanation: None.

Operating System Questions and Answers – CPU Scheduling Algorithms-1

1. Round robin scheduling falls under the category of ____________

a) Non-preemptive scheduling

b) Preemptive scheduling

c) All of the mentioned

d) None of the mentioned

Answer: b

Explanation: None.

2. With round robin scheduling algorithm in a time shared system ____________

a) using very large time slices converts it into First come First served scheduling algorithm

b) using very small time slices converts it into First come First served scheduling algorithm

c) using extremely small time slices increases performance

d) using very small time slices converts it into Shortest Job First algorithm

Answer: a

Explanation: All the processes will be able to get completed.

3. The portion of the process scheduler in an operating system that dispatches processes is concerned
with ____________

a) assigning ready processes to CPU

b) assigning ready processes to waiting queue

c) assigning running processes to blocked queue

d) all of the mentioned

Answer: a

Explanation: None.

4. Complex scheduling algorithms ____________

a) are very appropriate for very large computers

b) use minimal resources

c) use many resources

d) all of the mentioned

Answer: a

Explanation: Large computers are overloaded with a greater number of processes.

5. What is FIFO algorithm?

a) first executes the job that came in last in the queue

b) first executes the job that came in first in the queue

c) first executes the job that needs minimal processor

d) first executes the job that has maximum processor needs

Answer: b

Explanation: None.

6. The strategy of making processes that are logically runnable to be temporarily suspended is called
____________

a) Non preemptive scheduling

b) Preemptive scheduling

c) Shortest job first

d) First come First served

Answer: b

Explanation: None.

7. What is Scheduling?

a) allowing a job to use the processor

b) making proper use of processor

c) all of the mentioned

d) none of the mentioned

Answer: a

Explanation: None.

8. There are 10 different processes running on a workstation. Idle processes are waiting for an input
event in the input queue. Busy processes are scheduled with the Round-Robin time sharing method.
Which out of the following quantum times is the best value for small response times, if the processes
have a short runtime, e.g. less than 10ms?

a) tQ = 15ms

b) tQ = 40ms

c) tQ = 45ms

d) tQ = 50ms

Answer: a

Explanation: None.

9. Orders are processed in the sequence they arrive if _______ rule sequences the jobs.

a) earliest due date

b) slack time remaining

c) first come, first served

d) critical ratio

Answer: c

Explanation: None.

10. Which of the following algorithms tends to minimize the process flow time?

a) First come First served

b) Shortest Job First

c) Earliest Deadline First

d) Longest Job First

Answer: b

Explanation: None.

11. Under multiprogramming, turnaround time for short jobs is usually ________ and that for long jobs
is slightly ___________

a) Lengthened; Shortened

b) Shortened; Lengthened
c) Shortened; Shortened

d) Shortened; Unchanged

Answer: b

Explanation: None.

12. Which of the following statements are true? (GATE 2010)

I. Shortest remaining time first scheduling may cause starvation

II. Preemptive scheduling may cause starvation

III. Round robin is better than FCFS in terms of response time

a) I only

b) I and III only

c) II and III only

d) I, II and III

Answer: d

Explanation: I) Shortest remaining time first scheduling is a preemptive version of shortest job
scheduling. It may cause starvation as shorter processes may keep coming and a long CPU burst process
never gets CPU.

II) Preemption may cause starvation. If priority based scheduling with preemption is used, then a low
priority process may never get CPU.

III) Round Robin Scheduling improves response time as all processes get CPU after a specified time.

Operating System Questions and Answers – CPU Scheduling Algorithms-2

1. Which is the most optimal scheduling algorithm?

a) FCFS – First come First served

b) SJF – Shortest Job First

c) RR – Round Robin

d) None of the mentioned

Answer: b

Explanation: None.

2. The real difficulty with SJF in short term scheduling is ____________

a) it is too good an algorithm

b) knowing the length of the next CPU request

c) it is too complex to understand

d) none of the mentioned

Answer: b

Explanation: None.

3. The FCFS algorithm is particularly troublesome for ____________

a) time sharing systems

b) multiprogramming systems

c) multiprocessor systems

d) operating systems

Answer: b

Explanation: In a time sharing system, each user needs to get a share of the CPU at regular intervals.

4. Consider the following set of processes, the length of the CPU burst time given in milliseconds.

Process Burst time

P1 6

P2 8

P3 7

P4 3

Assuming the above process being scheduled with the SJF scheduling algorithm.

a) The waiting time for process P1 is 3ms

b) The waiting time for process P1 is 0ms

c) The waiting time for process P1 is 16ms

d) The waiting time for process P1 is 9ms

nswer: a

Explanation: None.

5. Preemptive Shortest Job First scheduling is sometimes called ____________

a) Fast SJF scheduling

b) EDF scheduling – Earliest Deadline First

c) HRRN scheduling – Highest Response Ratio Next

d) SRTN scheduling – Shortest Remaining Time Next

Answer: d

Explanation: None.

6. An SJF algorithm is simply a priority algorithm where the priority is ____________

a) the predicted next CPU burst

b) the inverse of the predicted next CPU burst

c) the current CPU burst

d) anything the user wants

Answer: a

Explanation: The larger the CPU burst, the lower the priority.

7. Choose one of the disadvantages of the priority scheduling algorithm?

a) it schedules in a very complex manner

b) its scheduling takes up a lot of time

c) it can lead to some low priority process waiting indefinitely for the CPU

d) none of the mentioned

Answer: c

Explanation: None.

8. What is ‘Aging’?

a) keeping track of cache contents

b) keeping track of what pages are currently residing in memory

c) keeping track of how many times a given page is referenced

d) increasing the priority of jobs to ensure termination in a finite time

Answer: d

Explanation: None.

9. A solution to the problem of indefinite blockage of low – priority processes is ____________

a) Starvation

b) Wait queue

c) Ready queue

d) Aging
Answer: d

Explanation: None.

10. Which of the following statements are true? (GATE 2010)

i) Shortest remaining time first scheduling may cause starvation

ii) Preemptive scheduling may cause starvation

iii) Round robin is better than FCFS in terms of response time

a) i only

b) i and iii only

c) ii and iii only

d) i, ii and iii

Answer: d

Explanation: None.

11. Which of the following scheduling algorithms gives minimum average waiting time?

a) FCFS

b) SJF

c) Round – robin

d) Priority

Answer: b

Explanation: None.

CPU fetches the instruction from memory according to the value of:

 A. program counter

 B. status register

 C. instruction register

 D. program status word

2. A memory buffer used to accommodate a speed differential is called:

 A. stack pointer
 B. cache

 C. accumulator

 D. disk buffer

3. Which one of the following is the address generated by CPU?

 A. physical address

 B. absolute address

 C. logical address

 D. none of the mentioned

4. Run time mapping from virtual to physical address is done by:

 A. memory management unit

 B. CPU

 C. PCI

 D. none of the mentioned

5. Memory management technique in which system stores and retrieves data from
secondary storage for use in main memory is called:

 A. fragmentation

 B. paging

 C. mapping

 D. none of the mentioned

6. The address of a page table in memory is pointed by:

 A. stack pointer

 B. page table base register

 C. page register

 D. program counter

7. Program always deals with:

 A. logical address

 B. absolute address

 C. physical address
 D. relative address

8. The page table contains:

 A. base address of each page in physical memory

 B. page offset

 C. page size

 D. none of the mentioned

9. What is compaction?

 A. a technique for overcoming internal fragmentation

 B. a paging technique

 C. a technique for overcoming external fragmentation

 D. a technique for overcoming fatal error

10. Operating System maintains the page table for:

 A. each process

 B. each thread

 C. each instruction

 D. each address

11. The operating system is :

 A. in the low memory

 B. in the high memory

 C. either a or b (depending on the location of interrupt vector)

 D. None of these

12. In contiguous memory allocation :

 A. each process is contained in a single contiguous section of memory

 B. all processes are contained in a single contiguous section of memory

 C. the memory space is contiguous

 D. None of these

13. The relocation register helps in :

 A. providing more address space to processes

 B. a different address space to processes

 C. to protect the address spaces of processes

 D. None of these

14. With relocation and limit registers, each logical address must be _______ the limit
register.

 A. less than

 B. equal to

 C. greater than

 D. None of these

15. The operating system and the other processes are protected from being modified by an
already running process because :

 A. they are in different memory spaces

 B. they are in different logical addresses

 C. they have a protection algorithm

 D. every address generated by the CPU is being checked against the relocation and limit
registers

16.Transient operating system code is code that :

 A. is not easily accessible

 B. comes and goes as needed

 C. stays in the memory always

 D. never enters the memory space

17. Using transient code, _______ the size of the operating system during program
execution.

 A. increases

 B. decreases

 C. changes

 D. maintains
18. When memory is divided into several fixed sized partitions, each partition may contain
________.

 A. exactly one process

 B. atleast one process

 C. multiple processes at once

 D. None of these

19. In fixed sized partition, the degree of multiprogramming is bounded by ___________.

 A. the number of partitions

 B. the CPU utilization

 C. the memory size

 D. All of these

20. The first fit, best fit and worst fit are strategies to select a ______.

 A. process from a queue to put in memory

 B. processor to run the next process

 C. free hole from a set of available holes

 D. All of these

21. In internal fragmentation, memory is internal to a partition and :

 A. is being used

 B. is not being used

 C. is always used

 D. None of these

22. A solution to the problem of external fragmentation is :

 A. compaction

 B. larger memory space

 C. smaller memory space

 D. None of these

23. Another solution to the problem of external fragmentation problem is to :

 A. permit the logical address space of a process to be noncontiguous

 B. permit smaller processes to be allocated memory at last

 C. permit larger processes to be allocated memory at last

 D. All of these

24. If relocation is static and is done at assembly or load time, compaction _________.

 A. cannot be done

 B. must be done

 C. must not be done

 D. can be done

25. The disadvantage of moving all process to one end of memory and all holes to the other
direction, producing one large hole of available memory is :

 A. the cost incurred

 B. the memory used

 C. the CPU used

 D. All of these

26. __________ is generally faster than _________ and _________.

 A. first fit, best fit, worst fit

 B. best fit, first fit, worst fit

 C. worst fit, best fit, first fit

 D. None of these

27. External fragmentation exists when :

 A. enough total memory exists to satisfy a request but it is not contiguous

 B. the total memory is insufficient to satisfy a request

 C. a request cannot be satisfied even when the total memory is free

 D. None of these

28. External fragmentation will not occur when :

 A. first fit is used

 B. best fit is used

 C. worst fit is used

 D. no matter which algorithm is used, it will always occur

29. Sometimes the overhead of keeping track of a hole might be :

 A. larger than the memory

 B. larger than the hole itself

 C. very small

 D. All of these

30. When the memory allocated to a process is slightly larger than the process, then :

 A. internal fragmentation occurs

 B. external fragmentation occurs

 C. both a and b

 D. neither a nor b

1. What is the reusable resource?

 A. that can be used by one process at a time and is not depleted by that use

 B. that can be used by more than one process at a time

 C. that can be shared between various threads

 D. none of the mentioned

2. Which of the following condition is required for deadlock to be possible?

 A. mutual exclusion

 B. a process may hold allocated resources while awaiting assignment of other resources

 C. no resource can be forcibly removed from a process holding it

 D. all of the mentioned

3. A system is in the safe state if:

 A. the system can allocate resources to each process in some order and still avoid a
deadlock

 B. there exist a safe sequence

 C. both (a) and (b)

  D. none of the mentioned

4. The circular wait condition can be prevented by:

 A. defining a linear ordering of resource types

 B. using thread

 C. using pipes

 D. all of the mentioned

5. Which one of the following is the deadlock avoidance algorithm?

 A. banker’s algorithm

 B. round-robin algorithm

 C. elevator algorithm

 D. karn’s algorithm

6. For effective operating system, when to check for deadlock?

 A. every time a resource request is made

 B. at fixed time intervals

 C. both (a) and (b)

 D. none of the mentioned

7. A problem encountered in multitasking when a process is perpetually denied necessary

resources is called:

 A. deadlock

 B. starvation

 C. inversion

 D. aging

8. Which one of the following is a visual ( mathematical ) way to determine the deadlock
occurrence?

 A. resource allocation graph

 B. starvation graph
 C. inversion graph

 D. none of the mentioned

9. To avoid deadlock:

 A. there must be a fixed number of resources to allocate

 B. resource allocation must be done only once

 C. all deadlocked processes must be aborted

 D. inversion technique can be used

10. The number of resources requested by a process :

 A. must always be less than the total number of resources available in the system

 B. must always be equal to the total number of resources available in the system

 C. must not exceed the total number of resources available in the system

 D. must exceed the total number of resources available in the system

11. The request and release of resources are ___________.

 A. command line statements

 B. interrupts

 C. system calls

 D. special programs

12. Multithreaded programs are :

 A. lesser prone to deadlocks

 B. more prone to deadlocks

 C. not at all prone to deadlocks

 D. None of these

13. For Mutual exclusion to prevail in the system :

 A. at least one resource must be held in a non sharable mode

 B. the processor must be a uniprocessor rather than a multiprocessor

 C. there must be at least one resource in a sharable mode

 D. All of these

14. For a Hold and wait condition to prevail :

 A. A process must be not be holding a resource, but waiting for one to be freed, and then
request to acquire it

 B. A process must be holding at least one resource and waiting to acquire additional
resources that are being held by other processes

 C. A process must hold at least one resource and not be waiting to acquire additional
resources

 D. None of these

15. Deadlock prevention is a set of methods :

 A. to ensure that at least one of the necessary conditions cannot hold

 B. to ensure that all of the necessary conditions do not hold

 C. to decide if the requested resources for a process have to be given or not

 D. to recover from a deadlock

16. For non sharable resources like a printer, mutual exclusion :

 A. must exist

 B. must not exist

 C. may exist

 D. None of these

17. For sharable resources, mutual exclusion :

 A. is required

 B. is not required

 C. None of these

18. To ensure that the hold and wait condition never occurs in the system, it must be
ensured that :

 A. whenever a resource is requested by a process, it is not holding any other resources

 B. each process must request and be allocated all its resources before it begins its
execution
 C. a process can request resources only when it has none

 D. All of these

19. The disadvantage of a process being allocated all its resources before beginning its
execution is :

 A. Low CPU utilization

 B. Low resource utilization

 C. Very high resource utilization

 D. None of these

20. To ensure no preemption, if a process is holding some resources and requests another
resource that cannot be immediately allocated to it :

 A. then the process waits for the resources be allocated to it

 B. the process keeps sending requests until the resource is allocated to it

 C. the process resumes execution without the resource being allocated to it

 D. then all resources currently being held are preempted

21. One way to ensure that the circular wait condition never holds is to :

 A. impose a total ordering of all resource types and to determine whether one precedes
another in the ordering

 B. to never let a process acquire resources that are held by other processes

 C. to let a process wait for only one resource at a time

 D. All of these

1. Because of virtual memory, the memory can be shared among:

 A. processes

 B. threads

 C. instructions

 D. none of the mentioned

2. _____ is the concept in which a process is copied into main memory from the secondary
memory according to the requirement.

 A. Paging

 B. Demand paging
 C. Segmentation

 D. Swapping

3. The pager concerns with the:

 A. individual page of a process

 B. entire process

 C. entire thread

 D. first page of a process

4. Swap space exists in:

 A. primary memory

 B. secondary memory

 C. CPU

 D. none of the mentioned

5. When a program tries to access a page that is mapped in address space but not loaded
in physical memory, then?

 A. segmentation fault occurs

 B. fatal error occurs

 C. page fault occurs

 D. no error occurs

6. Effective access time is directly proportional to:

 A. page-fault rate

 B. hit ratio

 C. memory access time

 D. none of the mentioned

7. In FIFO page replacement algorithm, when a page must be replaced:

 A. oldest page is chosen

 B. newest page is chosen

 C. random page is chosen

 D. none of the mentioned

8. Which algorithm chooses the page that has not been used for the longest period of time whenever
the page required to be replaced?

 A. first in first out algorithm

 B. additional reference bit algorithm

 C. least recently used algorithm

 D. counting based page replacement algorithm

9. A process is thrashing if:

 A. it is spending more time paging than executing

 B. it is spending less time paging than executing

 C. page fault occurs

 D. swapping can not take place

10. Working set model for page replacement is based on the assumption of:

 A. modularity

 B. locality

 C. globalization

 D. random access

1. CPU fetches the instruction from memory according to the value of:

 A. program counter

 B. status register

 C. instruction register

 D. program status word

2. A memory buffer used to accommodate a speed differential is called:

 A. stack pointer

 B. cache

 C. accumulator

 D. disk buffer
3. Which one of the following is the address generated by CPU?

 A. physical address

 B. absolute address

 C. logical address

 D. none of the mentioned

4. Run time mapping from virtual to physical address is done by:

 A. memory management unit

 B. CPU

 C. PCI

 D. none of the mentioned

5. Memory management technique in which system stores and retrieves data from
secondary storage for use in main memory is called:

 A. fragmentation

 B. paging

 C. mapping

 D. none of the mentioned

6. The address of a page table in memory is pointed by:

 A. stack pointer

 B. page table base register

 C. page register

 D. program counter

7. Program always deals with:

 A. logical address

 B. absolute address

 C. physical address

 D. relative address
8. The page table contains:

 A. base address of each page in physical memory

 B. page offset

 C. page size

 D. none of the mentioned

9. What is compaction?

 A. a technique for overcoming internal fragmentation

 B. a paging technique

 C. a technique for overcoming external fragmentation

 D. a technique for overcoming fatal error

10. Operating System maintains the page table for:

 A. each process

 B. each thread

 C. each instruction

 D. each address

11. The operating system is :

 A. in the low memory

 B. in the high memory

 C. either a or b (depending on the location of interrupt vector)

 D. None of these

12. In contiguous memory allocation :

 A. each process is contained in a single contiguous section of memory

 B. all processes are contained in a single contiguous section of memory

 C. the memory space is contiguous

 D. None of these

13. The relocation register helps in :

 A. providing more address space to processes

 B. a different address space to processes

 C. to protect the address spaces of processes

 D. None of these

14. With relocation and limit registers, each logical address must be _______ the limit
register.

 A. less than

 B. equal to

 C. greater than

 D. None of these

15. The operating system and the other processes are protected from being modified by an
already running process because :

 A. they are in different memory spaces

 B. they are in different logical addresses

 C. they have a protection algorithm

 D. every address generated by the CPU is being checked against the relocation and
limit

16. Transient operating system code is code that :

 A. is not easily accessible

 B. comes and goes as needed

 C. stays in the memory always

 D. never enters the memory space

17. Using transient code, _______ the size of the operating system during program execution.

 A. increases

 B. decreases

 C. changes

 D. maintains

18. When memory is divided into several fixed sized partitions, each partition may contain
________.

 A. exactly one process

 B. atleast one process

 C. multiple processes at once

 D. None of these

19. In fixed sized partition, the degree of multiprogramming is bounded by ___________.

 A. the number of partitions

 B. the CPU utilization

 C. the memory size

 D. All of these

20. The first fit, best fit and worst fit are strategies to select a ______.

 A. process from a queue to put in memory

 B. processor to run the next process

 C. free hole from a set of available holes

 D. All of these

21. In internal fragmentation, memory is internal to a partition and :

 A. is being used

 B. is not being used

 C. is always used

 D. None of these

22. A solution to the problem of external fragmentation is :

 A. compaction

 B. larger memory space

 C. smaller memory space

 D. None of these

23. Another solution to the problem of external fragmentation problem is to :

 A. permit the logical address space of a process to be noncontiguous

 B. permit smaller processes to be allocated memory at last

 C. permit larger processes to be allocated memory at last

 D. All of these

24. If relocation is static and is done at assembly or load time, compaction _________.

 A. cannot be done

 B. must be done

 C. must not be done

 D. can be done

25. The disadvantage of moving all process to one end of memory and all holes to the other
direction, producing one large hole of available memory is :

 A. the cost incurred

 B. the memory used

 C. the CPU used

 D. All of these

26. __________ is generally faster than _________ and _________.

 A. first fit, best fit, worst fit

 B. best fit, first fit, worst fit

 C. worst fit, best fit, first fit

 D. None of these

27. External fragmentation exists when :

 A. enough total memory exists to satisfy a request but it is not contiguous

 B. the total memory is insufficient to satisfy a request

 C. a request cannot be satisfied even when the total memory is free

 D. None of these

28. External fragmentation will not occur when :

 A. first fit is used

 B. best fit is used

 C. worst fit is used

 D. no matter which algorithm is used, it will always occur

29. Sometimes the overhead of keeping track of a hole might be :

 A. larger than the memory

 B. larger than the hole itself

 C. very small

 D. All of these

30. When the memory allocated to a process is slightly larger than the process, then :

 A. internal fragmentation occurs

 B. external fragmentation occurs

 C. both a and b

 D. neither a nor b

https://compscibits.com/mcq-questions/Operating-System/Introduction-to-Operating-Systems

https://engineeringinterviewquestions.com/operating-systems-multiple-choice-questions-and-answers/