Scribd Logo
Upload

Welcome to Scribd!

  • 3 views

    Operating System and Assignment

    Uploaded by

    Saad Shibli
    os and assignment

    Copyright:

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

    Operating System and Assignment

    Uploaded by

    Saad Shibli
    3 views2 pages
    os and assignment

    Original Title

    operating system and assignment

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    os and assignment

    Copyright:

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

    Operating System and Assignment

    Uploaded by

    Saad Shibli
    os and assignment

    Copyright:

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

    Home Assignment

    Principle of Operating System (CAP213)

    Q.1: What is the goal of an operating system?


    Q.2: What is a bootstrap program, and where is it stored?
    Q.3: What is the purpose of system calls?
    Q.4: What is the purpose of system programs?
    Q.5: What is a Process? What are the differences between I/O bound and CPU bound
    processes?
    Q.6: What are the three major activities of an operating system in regard to memory
    management?
    Q.7: What are the main advantages of the microkernel approach to design a system?
    Q.8: Describe the differences between short-term and long-term scheduling.
    Q.9: Give the difference between multiprogramming and multiprocessing.
    Q.10: Draw the state diagram of a process from its creation to termination, including all
    transitions, and briefly elaborate every state and every transition.
    Q.11 Briefly describe the main functions of operating system?
    Q.12 Briefly describe the following type of Operating system?
    1. Batch Operating System
    2. Time-Sharing OS
    3. Distributed OS
    4. Network OS
    5. Real Time OS
    6. Embedded OS

    Q.13: Explain the concept of a context switching?


    Q.14: What are the information stored in process control block (PCB)?
    Q.15: What do you understand by the terms “starvation” and “aging” used in process
    scheduling?
    Q.16: Consider the following set of processes, with the length of CPU burst time given in
    milliseconds:
    Process Arrival Time Burst Time
    P1 0 5
    P2 2 5
    P3 5 4
    P4 9 4

    a- Draw the Gant charts illustrating the execution of these processes using FCFS,
    Non-preemptive SJF and Preemptive SJF?
    b- What is the response time, waiting time and turnaround time of each process for
    each of the scheduling algorithms in part a?

    Q.17: Consider the following set of processes, with the length of CPU burst time given in
    milliseconds:
    Process Arrival Time Burst Time
    P1 0 7
    P2 2 5
    P3 4 1
    P4 5 4
    a- Draw the Gant charts illustrating the execution of these processes using FCFS,
    Non-preemptive SJF and Preemptive SJF?
    b- What is the response time, waiting time and turnaround time of each process for
    each of the scheduling algorithms in part a?

    Q. 18: Consider the following set of processes, with the length of CPU burst time given in
    milliseconds:
    Process Burst Time
    P1 53
    P2 17
    P3 68
    P4 24

    The processes are assumed to have arrived in the order of p1, p2, p3 and p4, all at time 0.

    a- Draw the Gant charts illustrating the execution of these processes using Round Robin
    algorithm (time quantum=20)?

    b- What is the waiting time of each process for the scheduling algorithms in part a?

    Q.19: Given in the following table are five processes: P0, P1, P2, P3 and P4 with their arrival
    time and CPU burst times shown. Draw the Gantt chart and find the waiting time and
    turnaround time for each process. CPU scheduling strategy is Round Robin (RR) with
    time quantum equal to 15.

    Process Arrival Time Burst Time


    P0 0 80
    P1 10 20
    P2 10 10
    P3 80 20
    P4 85 50

    Q.20: Given in the following table are five processes: P0, P1, P2, and P3 with their arrival
    time and CPU burst times shown. Draw the Gantt chart and find the waiting time and
    turnaround time for each process. CPU scheduling strategy is Round Robin (RR) with
    time quantum equal to 2.

    Process Arrival Time Burst Time


    P0 0 5
    P1 1 4
    P2 2 2
    P3 4 1

    Q.21 Consider the set of processes with arrival time (in milliseconds), CPU burst time (in
    milliseconds), and priority (0 is the highest priority) shown below. None of the processes
    have I/O burst time. CPU scheduling policy is preemptive priority.

    Process Arrival Time Burst Time Priority


    P0 0 11 2
    P1 5 28 0
    P2 12 2 3
    P3 2 10 1
    P4 9 16 4
    Draw the Gantt chart and calculate the waiting time and turnaround time for each process.

    You might also like