Scribd Logo
Upload

Welcome to Scribd!

  • 3 views

    OS Assignment

    Uploaded by

    ansh parashar

    Copyright:

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

    OS Assignment

    Uploaded by

    ansh parashar
    3 views2 pages

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Copyright:

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

    OS Assignment

    Uploaded by

    ansh parashar

    Copyright:

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

    Assignment

    CS:1501 Operating System Basics & PC Packages

    Laboratory Assignments

    1. Explore different functions of Word, Excel and Power point.


    2. Write a C program to implement the first come first serve CPU scheduling
    algorithm.
    3. Write a C program to implement the shortest job first CPU scheduling algorithm.
    4. Write a C program to implement the round robin CPU scheduling algorithm.
    5. Write a C program to implement the Priority CPU scheduling algorithm.
    6. Write a C program to implement the first fit, best fit and worst fit memory
    management policies.

    Theory Assignment

    1. What is an operating system? List five services provided by an operating system.


    2. What is the main advantage of multiprogramming?
    3. Describe the difference between multiprogramming, multitasking.
    4. Draw process state diagram and define each state.
    5. Describe the difference among short-term, medium-term, and long-term scheduling.
    6. Describe the difference between preemptive and non preemptive scheduling.
    7. Consider the following set of processes, with the length of the CPU-burst time given
    in milliseconds:
    Process Burst Time
    P1 10
    P2 1
    P3 2
    P4 1
    P5 5
    The processes are assumed to have arrived in the order P1, P2, P3, P4, and P5 all at time
    0.
    a. Draw four Gantt charts illustrating the execution of these processes using FCFS,
    SJF, and RR (quantum=1) scheduling.
    b. What is the turnaround time of each processes for each of the scheduling
    algorithms in part a?
    c. What is the waiting time of each processes for each of the scheduling algorithms
    in part a?
    8. Consider the following set of processes, with the length of the CPU-burst time and
    arrival time given in milliseconds:
    Process Burst Time Arrival Time
    P1 8 0.0
    P2 4 0.4
    P3 1 1.0
    a. What is the average turnaround time for these processes with the FCFS and SJF
    scheduling algorithm?
    b. What is the average waiting time for these processes with the FCFS and SJF
    scheduling algorithm?
    9. What is the main advantage and disadvantage of the FCFS and Round Robin
    scheduling?
    10. Write short note on following:
    a. Context Switching
    b. Dispatcher
    c. Convoy effect
    d. Process control block
    e. Types of CPU scheduling

    11. Explain the difference between internal and external fragmentation.


    12. Describe the following allocation algorithms:
    a. First fit
    b. Best fit
    c. Worst fit
    13. Given memory partitions of 100 KB, 500 KB, 200 KB, 300 KB, and 600 KB ( in
    order), how would each of the first-fit, best-fit, and worst-fit algorithms place
    processes of 212 KB, 417 KB, 112 KB, and 426 KB (in order)? Which algorithm
    makes the most efficient use of memory?

    ******************

    You might also like