Operating System Mcqs

Page No. 11

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


aLengthened; Shortened


bShortened; Lengthened


cShortened; Shortened


dShortened; Unchanged


View Answer Shortened; Lengthened

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


aFirst come First served


bShortest Job First


cEarliest Deadline First


dLongest Job First


View Answer Shortest Job First

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


aearliest due date


bslack time remaining


cfirst come, first served


dcritical ratio



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?


atQ = 15ms


btQ = 40ms


ctQ = 45ms


dtQ = 50ms


View Answer tQ = 15ms

What is Scheduling?


aallowing a job to use the processor


bmaking proper use of processor


call of the mentioned


dnone of the mentioned



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


aNon preemptive scheduling


bPreemptive scheduling


cShortest job first


dFirst come First served


View Answer Preemptive scheduling

What is FIFO algorithm?


afirst executes the job that came in last in the queue


bfirst executes the job that came in first in the queue


cfirst executes the job that needs minimal processor


dfirst executes the job that has maximum processor needs



Complex scheduling algorithms ____________


aare very appropriate for very large computers


buse minimal resources


cuse many resources


dall of the mentioned



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


aassigning ready processes to CPU


bassigning ready processes to waiting queue


cassigning running processes to blocked queue


dall of the mentioned



With round robin scheduling algorithm in a time shared system ____________


ausing very large time slices converts it into First come First served scheduling algorithm


busing very small time slices converts it into First come First served scheduling algorithm


cusing extremely small time slices increases performance


dusing very small time slices converts it into Shortest Job First algorithm



Goto Page No.

Page 11 of 108

Alphabetical MCQs Categories

Here below You find all kind of categories of MCQs in alphabetical order.


"Comprehensive Collection of MCQs: Alphabetically Organized by Subject"

"Discover an extensive collection of multiple-choice questions (MCQs) neatly categorized by subject from A to Z. This resource is designed for anyone eager to explore various topics in a straightforward and organized manner. Whether you're a student preparing for exams, an educator seeking supplementary materials, or simply curious about different subjects, this compilation offers a convenient way to learn and assess your knowledge. With questions arranged alphabetically, navigation is effortless, allowing you to delve into subjects of interest at your own pace. Engage, learn, and expand your understanding with this accessible and comprehensive repository of MCQs!"


BolPakistan

bolpakistan.com.pk includes Job Mcqs and Pak Mcqs is the Top Largest Mcqs Forum in World, in which you can read Mcqs of All Subjects, PPSC test preparation, FPSC, NTS and PPSC PAST PAPERS, PPSC PAST MCQS. A Collection of Repeated MCQs for JOBs seekers.

Copyright © 2024, Designed & Developed by BolPakistan