Exam Preparation
Master Your CPU Scheduling Knowledge
Challenge yourself with our comprehensive quiz on CPU scheduling and process management! From burst times to preemptive scheduling techniques, this quiz is designed to test your understanding of operating systems and enhance your exam preparation skills.
Key Features:
- 36 carefully curated questions
- Multiple choice format for easy answering
- Instant feedback on your performance
A process of determining which process will own CPU for execution while another process is on hold.
CPU Scheduling
Dispatcher
Process
Context Switching
Other
Please Specify:
It is a time required by the process to complete execution. It is also called running time.
Shortest Remaining Time
Dispatch Time
Burst Time
CPU Scheduling
Other
Please Specify:
This algorithm separates the ready queue into various separate queues. In this method, processes are assigned to a queue based on a specific property of the process, like the process priority, size of the memory, etc.
CPU Scheduling
Multiple-Level Queues Scheduling
Priority Based Scheduling
Round-Robin Scheduling
Is used when a process switches from running state to ready state or from the waiting state to ready state.
Preemptive Scheduling
Non-Preemptive Scheduling
CPU Scheduling
CPU/IO Burst Cycle
Other
Please Specify:
Is the primary responsible for which the Operating System must ensure that the CPU remains as active as feasible.
CPU Utilization
Throughput
Fairness
Efficiency
Each process gets fair share of the CPU.
Fairness
Throughput
Efficiency
CPU Utilization
When CPU is 100% busy then efficiency is increased.
Efficiency
Fairness
Throughput
CPU Utilization
Maximizes jobs per given time period.
Efficiency
Fairness
Throughput
CPU Utilization
When a process enters in a ready state
Arrival Time
Burst Time
Finish Time
CPU/IO burst cycle
When process complete and exit from a system
Arrival Time
Burst Time
Finish Time
CPU/IO burst cycle
A number of programs which can be present in memory at the same time.
Throughput
Jobs
Multiprogramming
CPU/IO burst cycle
It is a type of program without any kind of user interaction.
Throughput
Jobs
Multiprogramming
CPU/IO burst cycle
It is a kind of program having user interaction.
Users
Jobs
Interval Timer
Multiprogramming
It is the reference that is used for both job and user.
Users
Jobs
Process
Multiprogramming
Characterizes process execution, which alternates between CPU and I/O activity.
Users
CPU Scheduling
Process
CPU/IO burst cycle
Is the measure of how many processes are completed in a given amount of time.
Throughput
CPU Scheduling
Multiprogramming
Dispatcher
Is the length of time needed to carry out a particular process.
Turnaround Time
Response Time
Waiting Time
Interval Timer
Is the length of time in which a certain process must wait before being sent to the ready queue.
Turnaround Time
Response Time
Waiting Time
Interval Timer
Is the interval between when the request was made and when the initial response showed.
Turnaround Time
Response Time
Waiting Time
Interval Timer
Is a technique that is quite similar to preemption. It is timer that could be set to start at a specific interval when a particular process receives the CPU allocation.
Turnaround Time
Response Time
Waiting Time
Interval Timer
Is a module that gives the process control over the CPU.
Dispatcher
CPU Scheduling
Context Switching
CPU Utilization
Is the length of time to start a new process after stopping the current one.
Dispatch Latency
Waiting Time
Interval Timer
Turnaround Time
Is used to load the saved state for the new process after storing the state of the old process.
Context Switching
CPU Scheduling
Dispatcher
CPU Utilization
It is the easiest and most simple CPU scheduling algorithm.
First Come First Serve
Shortest Remaining Time
Shortest Job First
Round – Robin Scheduling
In this method, the process will be allocated to the task, which is closest to its completion.
First Come First Serve
Shortest Remaining Time
Shortest Job First
Round – Robin Scheduling
The oldest, simplest scheduling algorithm.
First Come First Serve
Shortest Remaining Time
Shortest Job First
Round – Robin Scheduling
Is a scheduling algorithm in which the process with the shortest execution time should be selected for execution next.
Priority Based Scheduling
Shortest Remaining Time
Shortest Job First
Round – Robin Scheduling
Is a method of scheduling processes based on priority.
Priority Based Scheduling
Shortest Remaining Time
Shortest Job First
Round – Robin Scheduling
A situation where a set of processes are blocked because each process is holding a resource and waiting for another resource acquired by some other process.
Deadlock
CPU Overload
Process Jam
Process Hold
One process is waiting for the resource, which is held by the second process, which is also waiting for the resource held by the third process etc. This will continue until the last process is waiting for a resource held by the first process. This creates a circular chain.
Circular wait
Mutual Exclusion
Hold and Wait
No preemptive action
A resource can be released only voluntarily by the process holding it after that process has finished its task
No preemptive action
Mutual Exclusion
Process Jam
Circular wait
In this condition, processes must be stopped from holding single or multiple resources while simultaneously waiting for one or more others.
Hold and Wait
No preemptive action
Mutual Exclusion
Circular wait
It is a special type of binary semaphore which used for controlling access to the shared resource. It includes a priority inheritance mechanism to avoid extended priority inversion problems. It allows current higher priority tasks to be kept in the blocked state for the shortest time possible.
Mutual Exclusion
No preemptive action
Hold and Wait
Circular wait
It is a set of methods for ensuring that at least one of the conditions cannot hold.
Deadlock Prevention
Deadlock Avoidance
Deadlock Detection
Deadlock Detention
A deadlock occurrence can be detected by the resource scheduler. A resource scheduler helps OS to keep track of all the resources which are allocated to different processes.
Deadlock Prevention
Deadlock Avoidance
Deadlock Detection
Deadlock Detention
The simplest and most useful model that each process declares the maximum number of resources of each type that it may need.
Deadlock Prevention
Deadlock Avoidance
Deadlock Detection
Deadlock Detention
{"name":"Exam Preparation", "url":"https://www.quiz-maker.com/QPREVIEW","txt":"Challenge yourself with our comprehensive quiz on CPU scheduling and process management! From burst times to preemptive scheduling techniques, this quiz is designed to test your understanding of operating systems and enhance your exam preparation skills.Key Features:36 carefully curated questionsMultiple choice format for easy answeringInstant feedback on your performance","img":"https:/images/course5.png"}
More Quizzes
Sheet-3 (OS)
3015250
Distributed midterm practice
12614
OS Practice Day 1
24120
Quiz # 01 _ Operating-System-Concepts _ By Engr. Ahmad Saeed
12612
Operating Systems
7442
DB Challenge
13615
Mapping Functions Quiz
15810
Understanding Computer Architecture and Organization
84117
CS 446 Practice
512647
TIS Mid Semester Revision Quiz
320
Programming Fundamentals Quiz
1165
Data Structures quiz
520