Assignment FOS 2

Download as pdf or txt
Download as pdf or txt
You are on page 1of 2

GLS UNIVERSITY

FACULTY OF COMPUTER APPLICATIONS & INFORMATION


TECHNOLOGY
IMSc(IT) (SEM – 3)
SUBJECT: 221601304 Fundamental of Operating System
ASSIGNMENT – 2

Q-1 Do as directed -
1. A process control block is also known as a _________.
2. Process _________ is a numeric value that represents the priority of each process.
3. ________ region stores variables and dynamically allocated memory.
4. Concurrent process executing in the operating system may be either ____ or ______
process.
5. The ________ is the activity of the process manager that handles the removal of the running
process from the CPU and the selection of another process on the basis of a particular
strategy.
6. _______ is also called as CPU scheduler.
7. Process starting is an essential part of a Multi programming operating systems. (True/False)
8. Preemptive scheduling is used when a process switches from running state to ready state or
from the waiting state to the ready state. (True/False)
9. FCFS supports non-preemptive and preemptive CPU scheduling algorithms both.
(True/False)
10. Shortest remaining time (SRT) is the preemptive version of the FCFS algorithm.
(True/False)
11. A process control block is a data structure used by computer operating systems to store all
the information about a process. (True/False)
12. Text Region stores the code that the processor executes. (True/False)
13. A process is cooperative if it can not be affect by the other process running in the system.
(True/False)

Q-2 Answer the following-


1. Explain various schedulers in detail.
2. Explain FCFS scheduling algorithm.
3. Explain Round Robin scheduling algorithm.
4. What is PCB? Explain working process of PCB.
5. Explain Process State Diagram with State Transitions.
6. Explain Process State Diagram with Suspended State Transitions.
7. Differentiate: Long Term Scheduler, Short Term Scheduler and Medium Term Scheduler.
8. Explain SRT scheduling algorithm.
9. Explain SJN scheduling algorithm.
10. Solve the below process sequence by different algorithms:
Process Arrival Time Execution Time
P1 0 5
P2 3 12
P3 5 7
P4 7 10
Draw a Gantt Chart for the all the execution of the processes and calculate Waiting Time,
Average Waiting Time, Turnaround Time, Average Turnaround time and Normalized
turn around time for above process if they are implementing below algorithm -
1. First Come First Serve Scheduling
2. Shortest Job First Scheduling
3. Shortest Remaining Time Scheduling
4. Round Robin Scheduling for Time Quantum=3
11. Solve the below process sequence by different algorithms:

Process Arrival Time Execution Time


P1 0 6
P2 1 3
P3 2 12
P4 3 9

Draw a Gantt Chart for the all the execution of the processes and calculate Waiting Time,
Average Waiting Time, Turnaround Time, Average Turnaround time.
1. First Come First Serve Scheduling
2. Shortest Job First Scheduling
3. Shortest Remaining Time Scheduling
4. Round Robin Scheduling for Time Quantum=5

NOTE - Q-1 is compulsory for all. You have to attempt Q-2 in following sequence.

Roll Number Questions

A1 to A20, B1 to B20, C1 to C20 1,10,5

A21 to A40, B21 to B40, C21 to C40 2,9,11

A41 to A60, B41 to B60, C41 to C60 3,8,10

A61 to A80, B61 to B80, C61 TO C80 4,7,11

A81 Onwards, B81 Onwards,C81 Onwards 5,6,10

You might also like