23.In preemptive priority scheduling, what happens when high-priority process arrives while a low-priority process runs?

The executing process will be preempted and new process assigned to CPU.

4.The function of the long-term scheduler is to:

Move the process from secondary storage to ready queue.

22.What is the function of a short-term scheduler?

Selects a process from ready queue and assigns it to the CPU.

7.What is the function of mid-term scheduler?

It swaps out the idle process from memory to secondary storage.

15.Turnaround time is:

The interval from the time of submission of a process to time of completion

14.Aging is a technique in which:

The priority of a process increases after sometime.(moves closer to 1)

12.The processes are executed in the following manner in Round Robin Algorithm.

The process is executed for a time quantum and when the time quantum

studbud

OPERATING SYSTEM S S6

25 termsStudBud Administration10 plays

Imported from external platform

Flashcards25 cardsFPractice quizPHost liveL

Questions 25

Answers

1
25.Which of the following is not an Operating System?
Solaris
Windows Explorer
Mac OS
Red Hat
2
23.In preemptive priority scheduling, what happens when high-priority process arrives while a low-priority process runs?
The executing process will be preempted and new process assigned to CPU.
The new process will be shifted to I/O queue.
The CPU will keep on executing, new process has to wait in the ready queue.
The system will crash.
3
18.The state of a process is stored in its __________.
Source code
Memory
PCB
Registers
4
4.The function of the long-term scheduler is to:
Move the process from memory to secondary storage.
Move the process between different queues.
Move the process from secondary storage to ready queue.
Move the process from the ready queue to CPU.
5
22.What is the function of a short-term scheduler?
Selects a process from ready queue and assigns it to the CPU.
Selects a process from I/O queue to moves it to the ready queue
Selects a process from secondary storage device and allocates it to CPU.
Selects a process from memory and swaps it out to secondary storage.
6
7.What is the function of mid-term scheduler?
It moves the process between different queues
It moves the process from ready queue to CPU.
It helps the CPU in executing the process.
It swaps out the idle process from memory to secondary storage.
7
5.There can be more than one process in running state at any given time.
False
True
8
10.What is an Operating System?
It is an interface between the user and the hardware.
It is the first software that runs when the computer boots up.
All of the above.
It provides a platform for the user to run applications.
9
16.All the processes that are ready to execute reside in _________.
Running queue
I/O queue
Waiting queue
Ready queue
10
9.The switching of the CPU between different processes is called _________.
Context Switching
Swapping
Multiple Switching
Organizing
11
6.Which of the following is not the function of the Operating System?
Clock Management
Memory Management
Process Management
Device Management
12
15.Turnaround time is:
The time when the process first responds.
The sum of periods spent executing on CPU.
The sum of periods spent waiting in the ready queue.
The interval from the time of submission of a process to time of completion
13
14.Aging is a technique in which:
The priority remains constant.
The priority of a process increases after sometime.(moves closer to 1)
The process becomes old and doesn't execute.
The priority of a process decreases after sometime.(moves away from 1)
14
24.The ready queue is maintained by __________.
Stack
Tree
Array
Linked list
15
1.A process is a
Program in execution
A complete software package
Operating system itself.
Interrupt handler
16
13.Which of the following scheduling algorithms use Time Quantum?
SJF
Priority Scheduling
Round Robin
FCFS
17
12.The processes are executed in the following manner in Round Robin Algorithm.
The processes are executed according to their priority.
The process coming first is executed first without preemption.
The process is executed for a time quantum and when the time quantum
The process having the smallest burst time is executed first.
18
2.Which scheduler maintains the Degree of Multiprogramming?
Mid-Term Scheduler
None of the Above
Long-Term Scheduler
Short-Term Scheduler
19
19.The full form of PCB is:
Public Control Block
Process Control Block
Process Control Box
Process Creating Block
20
3.Which of the following is not a product of Microsoft?
ME
XP
Ubuntu
Vista
21
17.From the waiting state, a process can only enter into _________
New state
Terminated state
Ready state
Running state
22
11.Each process has its own PCB.
False
True
23
20.Which of the following is an example of Single Programming Operating System?
Unix
Windows
MS-DOS
Linux
24
21.Which of the following scheduling algorithm comes under preemptive scheduling?
FCFS
Largest Job First
Round Robin
Multilevel Queue Scheduling
25
8.One of the major problems with priority scheduling is:
Context Switching
Starvation
Swapping
Aging

OPERATING SYSTEM S S6 Flashcards | StudBud