Scribd
Upload
23 views2 pages

Maulana Azad Polytechnic, Solapur: Unit Test-02

This document is a unit test for the Computer Engineering program at Maulana Azad Polytechnic, Solapur, covering Operating Systems. It consists of two main questions, with the first requiring students to attempt five short-answer questions and the second requiring detailed explanations and calculations related to process scheduling algorithms. The test is scheduled for October 14, 2024, and is worth a total of 30 marks.

Uploaded by

nayanafalmari
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
23 views2 pages

Maulana Azad Polytechnic, Solapur: Unit Test-02

This document is a unit test for the Computer Engineering program at Maulana Azad Polytechnic, Solapur, covering Operating Systems. It consists of two main questions, with the first requiring students to attempt five short-answer questions and the second requiring detailed explanations and calculations related to process scheduling algorithms. The test is scheduled for October 14, 2024, and is worth a total of 30 marks.

Uploaded by

nayanafalmari
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd

MAULANA AZAD POLYTECHNIC, SOLAPUR

Unit Test-02

Program Name: Computer Engineering (CO5k) Scheme: K


Program Code: CO Semester: FIFTH
Course Title: OSY Time: 11.30am to 1.00pm
Marks: 30 Date: 14/10/2024

Q1. Attempt Five. (2X5) = 10Marks


a. List different multithreading models.
b. State difference between preemptive scheduling and non-preemptive scheduling.
c. List different type of Scheduling algorithms.
d. Define Deadlock.
e. Define Preemptive and non-Preemptive Scheduling.
f. Draw the diagram of execution process.

Q2. Attempt any Five (5x4) = 20 Marks


a. Draw and Explain process state diagram.
b. With neat diagram Describe use of process control block (PCB).
c. The jobs are scheduled for execution as follows:
Process Arrival time Burst time
P1 0 7
P2 1 4
P3 2 10
P4 3 6
P5 4 8

Solve the problem using: (i) SJF (ii) FCFS also find average waiting time using
Gantt chart.

d. Explain First Come First Served (FCFS) scheduling algorithm with example.
e. Calculate average waiting time for following data using First Come First Served
(FCFS) and Shortest Job First (SJF) algorithms.
Process Arrival Time Burst Time
P0 0 8
P1 1 4
P2 2 5
P3 3 3
MAULANA AZAD POLYTECHNIC, SOLAPUR

Unit Test-02

Program Name: Computer Engineering (CO5k) Scheme: K


Program Code: CO Semester: FIFTH
Course Title: OSY Time: 11.30am to 1.00pm
Marks: 30 Date: 14/10/2024

Q1. Attempt Five. (2X5) = 10Marks


a. List different multithreading models.
b. State difference between preemptive scheduling and non-preemptive scheduling.
c. List different type of Scheduling algorithms.
d. Define Deadlock.
e. Define Preemptive and non-Preemptive Scheduling.
f. Draw the diagram of execution process.

Q2. Attempt any Five (5x4) = 20 Marks


a. Draw and Explain process state diagram.
b. With neat diagram Describe use of process control block (PCB).
c. The jobs are scheduled for execution as follows:
Process Arrival time Burst time
P1 0 7
P2 1 4
P3 2 10
P4 3 6
P5 4 8

Solve the problem using: (i) SJF (ii) FCFS also find average waiting time using
Gantt chart.

d. Explain First Come First Served (FCFS) scheduling algorithm with example.
e. Calculate average waiting time for following data using First Come First Served
(FCFS) and Shortest Job First (SJF) algorithms.
Process Arrival Time Burst Time
P0 0 8
P1 1 4
P2 2 5
P3 3 3

You might also like