CS604 Assignment 2 Solution and Discussion


  • Cyberian's Gold

    Operating Systems (CS604)
    Assignment # 02
    FALL 2019
    Total marks = 20

    Deadline Date
    02.12.2019

    Please carefully read the following instructions before attempting assignment.

    RULES FOR MARKING
    It should be clear that your assignment would not get any credit if:
     The assignment is submitted after the due date.
     The submitted assignment file does not open or it is corrupt.
     The submitted assignment solution is copied from any other student or from the internet.

    You should consult the recommended books to clarify your concepts as handouts are not sufficient.

    You are supposed to submit your assignment in .doc or docx format.
    Any other formats like scan images, PDF, zip, rar, ppt and bmp etc will not be accepted.

    Objective:
    • The objective of this assignment is to provide hands on experience of:
    Different Process Scheduling Algorithms in Operating System

    NOTE

    No assignment will be accepted after the due date via email in any case (whether it is the case of load shedding or internet malfunctioning etc.). Hence refrain from uploading assignment in the last hour of deadline. It is recommended to upload solution file at least two days before its closing date.

    If you find any mistake or confusion in assignment (Question statement), please consult with your instructor before the deadline. After the deadline no queries will be entertained in this regard.

    For any query, feel free to email at:
    [email protected]

    Question No 01 4+3+3=10 marks
    Assume you have to apply Shortest Job First (SJF) scheduling algorithms on the set of different processes given in the table below. The CPU burst time is also given for each process. Consider that all the processes arrive in the ready queue within time 0 seconds except P2 that arrive in ready queue within time 8 seconds. You are required to show the Gantt Chart to illustrate the execution sequence of these processes and calculate the Total Waiting Time and Average Waiting Time for the given processes by using SJF algorithm.

    Process CPU Burst Time (seconds)
    P0 2
    P1 6
    P2 1
    P3 4
    P4 3
    P5 8

    Question No 02 4+3+3=10 marks
    Consider a scenario where you have to apply Round Robin scheduling algorithm on the below given set of processes with each having a quantum size=8 milliseconds. The CPU burst time and arrival time for each process is also provided in the given table. You are required to show the Gantt Chart to illustrate the execution sequence of these processes. Moreover, calculate the Average Turnaround Time and Average Waiting Time for given processes by using round robin algorithm.

    Process CPU Burst Time (Milliseconds) Arrival Time(Milliseconds)
    P0 15 0
    P1 8 4
    P2 25 18
    P3 18 5

    Wish you very Best of Luck!


  • Cyberian's Gold

    0429f234-04e3-4c2d-b2a3-b5f590720cf9-image.png fdaaf11a-d7a3-483c-b74f-9d4a2687728f-image.png 68a890ce-9849-4b2c-a0fc-3e9122331e66-image.png 56e21ff7-ed12-4b61-84cd-95d559e11d8e-image.png dcb7df31-c25a-4afd-9c6a-88e3768de039-image.png


  • Cyberian's Gold


  • Cyberian's Gold


  • Cyberian's Gold


  • Cyberian's Gold

    @zareen said in CS604 Assignment 2 Solution and Discussion:

    Assume you have to apply Shortest Job First (SJF) scheduling algorithms on the set of different processes given in the table below. The CPU burst time is also given for each process. Consider that all the processes arrive in the ready queue within time 0 seconds except P2 that arrive in ready queue within time 8 seconds. You are required to show the Gantt Chart to illustrate the execution sequence of these processes and calculate the Total Waiting Time and Average Waiting Time for the given processes by using SJF algorithm.

    21575eba-4d3f-4d83-af20-c7706510fd8d-image.png


  • Cyberian's Gold

    This post is deleted!


    Recent Topics


|