Operating System - Programming Language (MCQ) questions for Q. 273

Q.  Match the following:
List – I - - - - - - - - - - - - - - - - - - - - - - - - - List – II
a. Multilevel feedback queue - - - - - - - - - i. Time-slicing
b. FCFS - - - - - - - - - - - - - - - - - - - - - - - -ii. Criteria to move processes between queues
c. Shortest process next - - - - - - - - - - - -iii. Batch processing
d. Round robin scheduling - - - - - - - - - - -iv. Exponential smoothing

- Published on 17 Jun 15

a. a-i, b-iii, c-ii, d-iv
b. a-iv, b-iii, c-ii, d-i
c. a-iii, b-i, c-iv, d-i
d. a-ii, b-iii, c-iv, d-i

ANSWER: a-ii, b-iii, c-iv, d-i

Related Content

 

    Discussion

  • Nirja Shah   -Posted on 25 Nov 15
    Multilevel feedback queue
    - It is a scheduling algorithm.
    - This algorithm is implemented by Solaris 2.6 Time-Sharing (TS) scheduler.
    - Examples of this can be Mac OS X and Microsoft Windows schedulers of the broader class of multilevel feedback queue schedulers.
    - This scheduling algorithm is intended to meet the following design requirements for multimode systems:

    1. Give preference to short jobs.
    2. Give preference to I/O bound processes.
    3. Separate processes into categories based on their need for the processor.

    FCFS
    - It is known as first-in, first-served and first-come, first choice
    - It is a service policy whereby the requests are attended in the order that they arrived, without other biases or preferences.

    Shortest job next (SJN)
    - Shortest job next (SJN), also known as Shortest Job First (SJF) or Shortest Process Next (SPN), is a scheduling policy that selects the waiting process with the smallest execution time to execute next.
    - It is a non-preemptive algorithm.
    - It is a preemptive variant of SJN.

    Round Robin scheduling
    - It is an algorithm employed by process and network schedulers in computing.
    - It is generally used where time slices are assigned to each process in equal portions and in circular order, handling all processes without priority (also known as cyclic executive).
    - It is simple, easy to implement, and starvation-free.
    - It is also applied to other scheduling problems, such as data packet scheduling in computer networks.

➨ Post your comment / Share knowledge


Enter the code shown above:

(Note: If you cannot read the numbers in the above image, reload the page to generate a new one.)
▲