KEMBAR78
OS Assignment 1 | PDF
Scribd
Upload
41 views1 page

OS Assignment 1

This document contains assignment questions for the course 22CAPC402 Operating Systems for Class II CSE A. It includes detailed questions on system calls, basic functions of operating systems, services provided by operating systems, and a practical problem involving process scheduling with various algorithms. Each question is mapped to specific course outcomes (CO), program outcomes (PO), and program specific outcomes (PSO).

Uploaded by

vishnupriyapacet
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
41 views1 page

OS Assignment 1

This document contains assignment questions for the course 22CAPC402 Operating Systems for Class II CSE A. It includes detailed questions on system calls, basic functions of operating systems, services provided by operating systems, and a practical problem involving process scheduling with various algorithms. Each question is mapped to specific course outcomes (CO), program outcomes (PO), and program specific outcomes (PSO).

Uploaded by

vishnupriyapacet
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
You are on page 1/ 1

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

Even Semester

22CAPC402 Operating systems

ASSIGNMENT-I QUESTIONS
CLASS-II CSE A

S.NO Questions Mapping Mapping with PO


with CO and PSO
1 Explain in detail the types of systems calls provided by a typical CO1 PO-1,2,3,4,7,12
operating system. PSO-1,2,3
2 What are the basic functions of OS and DMA CO1 PO-1,2,3,4,7,12
PSO-1,2,3
3 List the various services provided by operating systems CO1 PO-1,2,3,4,7,12
PSO-1,2,3
4 Consider the following set of processes with the length of the CO2 PO-1,2,3,4,7,12
CPU – burst time in given ms : PSO-1,2,3
Process Burst Time Arrival Time Priority
P1 8 0 3
P2 4 1 2
P3 9 2 1
P4 5 3 5
P5 3 4 4
Draw four Gantt charts illustrating the execution of these processes
using FCFS, SJF, priority and RR (quantum = 2ms) scheduling.
Also calculate waiting time and turnaround time for each
scheduling algorithms.

Faculty In-Charge HOD

You might also like