Scribd Logo
Upload

Welcome to Scribd!

  • 12 views

    CSE B.SC Operating System 12th Batch

    Uploaded by

    অাল ইমরান
    This document contains assignments for students taking the Operating Systems course at Pundra University of Science and Technology. It lists 18 students and assigns each student 1-3 questions related to operating system scheduling algorithms like FCFS, SJF, and round robin. The questions involve drawing Gantt charts, calculating waiting times, and identifying the scheduling algorithm that results in the lowest average waiting time for different processes with varying execution times.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    CSE B.SC Operating System 12th Batch

    Uploaded by

    অাল ইমরান
    12 views2 pages
    This document contains assignments for students taking the Operating Systems course at Pundra University of Science and Technology. It lists 18 students and assigns each student 1-3 questions related to operating system scheduling algorithms like FCFS, SJF, and round robin. The questions involve drawing Gantt charts, calculating waiting times, and identifying the scheduling algorithm that results in the lowest average waiting time for different processes with varying execution times.

    Original Title

    CSE_B.SC_Operating_System_12th_Batch

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document contains assignments for students taking the Operating Systems course at Pundra University of Science and Technology. It lists 18 students and assigns each student 1-3 questions related to operating system scheduling algorithms like FCFS, SJF, and round robin. The questions involve drawing Gantt charts, calculating waiting times, and identifying the scheduling algorithm that results in the lowest average waiting time for different processes with varying execution times.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    12 views2 pages

    CSE B.SC Operating System 12th Batch

    Uploaded by

    অাল ইমরান
    This document contains assignments for students taking the Operating Systems course at Pundra University of Science and Technology. It lists 18 students and assigns each student 1-3 questions related to operating system scheduling algorithms like FCFS, SJF, and round robin. The questions involve drawing Gantt charts, calculating waiting times, and identifying the scheduling algorithm that results in the lowest average waiting time for different processes with varying execution times.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    of 2

    Pundra University of Science and Technology

    Program: B.Sc. in CSE (HSC)


    Batch: 12th, Semester: 5th
    Assignment for Mid-Term Examination Fall-2020
    Course Code: CSE 313
    Course Title: Operating System

    Sl. No. Roll Assignment topics


    C-01218306002 1. Consider five process P1, P2, P3, P4, and P5, with total execution time of 10, 2, 3,
    01 15, and 25 units respectively. The processes are assumed to have arrived in the order
    P1, P2, P3, P4, P5 all at time 0.
    C-01218306003 a. Draw Grantt charts illustrating the execution of these processes using FCFS, SJF
    and Round Robin (quantum=1) Scheduling
    02 b. What is the waiting time of each process for each of the scheduling algorithms?
    c. Which of the schedules in part a result in the minimal average waiting time (over
    all process).
    C-01218306004
    2. Under what circumstances would a user be better off using a multiprogramming
    03 operating system?
    3. What are the difference between multiprogramming and multiprocessing OS?
    C-01218306005 1. Consider five process P1, P2, P3, P4, and P5, with total execution time of 15, 7, 8,
    04 20, and 30 units respectively. The processes are assumed to have arrived in the order
    P1, P2, P3, P4, P5 all at time 0.
    a. Draw Grantt charts illustrating the execution of these processes using FCFS, SJF
    C-01018106037 and Round Robin (quantum=6) Scheduling
    05 b. What is the waiting time of each process for each of the scheduling algorithms?
    c. Which of the schedules in part a result in the minimal average waiting time (over
    all process).
    C-01218306006
    2. Why does FCFS performance poor?
    06 3. Why it is important to the scheduler to distinguish I/O bound program from CPU
    bound program?
    C-01218306007 1. Consider five process P1, P2, P3, P4, and P5, with total execution time of 13, 5, 6,
    07 18, and 28 units respectively. The processes are assumed to have arrived in the order
    P1, P2, P3, P4, P5 all at time 0.
    C-01218306009 a. Draw Grantt charts illustrating the execution of these processes using FCFS, SJF
    and Round Robin (quantum=4) Scheduling
    08 b. What is the waiting time of each process for each of the scheduling algorithms?
    c. Which of the schedules in part a result in the minimal average waiting time (over
    all process).
    C-01218306010 2. Define the essential properties of the following types of operating system:
    a. Multiprogramming
    b. Multiprocessing
    09 c. Multitasking
    C-00817206024 1. Consider five process P1, P2, P3, P4, and P5, with total execution time of 12, 4, 5, 17,
    10
    and 27 units respectively. The processes are assumed to have arrived in the order P1,
    C-01218306011 P2, P3, P4, P5 all at time 0.
    11
    a. Draw Grantt charts illustrating the execution of these processes using FCFS, SJF
    12 C-01218306012 and Round Robin (quantum=3) Scheduling
    b. What is the waiting time of each process for each of the scheduling algorithms?
    13 C-0121830623 c. Which of the schedules in part a result in the minimal average waiting time (over
    all process).
    C-01118206021 2. Describe the actions taken by a kernel to context-switch between processes.
    14
    3. Which scheduler selects which process should be brought into the ready queue?
    15 C-01218306015 1. Consider five process P1, P2, P3, P4, and P5, with total execution time of 18, 10, 6, 12,
    C-01218306017 and 20 units respectively. The processes are assumed to have arrived in the order P1,
    16 P2, P3, P4, P5 all at time 0.
    a. Draw Grantt charts illustrating the execution of these processes using FCFS, SJF
    and Round Robin (quantum=5) Scheduling
    17 C-01218306018 b. What is the waiting time of each process for each of the scheduling algorithms?
    c. Which of the schedules in part a result in the minimal average waiting time (over
    all process).
    2. How context switching helps in multiprogramming?
    3. Describe the differences among short-term, medium-term, and long term
    18 C-01218306019
    Scheduling.

    ----------------------------------

    Signature of the Course Instructor

    You might also like