0% found this document useful (0 votes)
7 views3 pages

552.ICE0124 OS-Assmt-Due 20thOCTOBER 2023

Uploaded by

Oliver Nzila
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
7 views3 pages

552.ICE0124 OS-Assmt-Due 20thOCTOBER 2023

Uploaded by

Oliver Nzila
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

ASSIGNMENT JULY-DEC 2023

INFORMATION AND COMMUNICATION UNIVERSITY


ICE124: OPERATING SYSTEMS
Lecturer’s Name: Henry Sinkala
Instructions:
Answer all Questions
1- Use the Assignment cover page provided below
2- Number your answers according to the question
3- Your answers should be typed, 1.5 spacing, Times New Roman size 12.
4 – Deadline: The Assignment is due on 20th October, 2023.Assigment submitted after due date
will NOT be marked from the total marks allocated
5. Bibliography list of the books must be indicated, preferably the Harvard Reference
6. The Assignment must be subjected to Turnitin or any credible anti plagiarism tool.
7- Assignment should be uploaded to the Portal
N.B: Save the Assignment as: surname_firstname _ student #_module name_Assignment #
E.g: Bwalya John_2021212345_Operating Systems_Assignment 1

Notice:
i. Assignment Total Marks: 15 marks
ii. DL students are required to write a TEST (25 marks) during residential classes.
iii.Full-Time students will be writing weekly tests/quizzes total (25 marks)
ASSIGNMENT JULY-DEC 2023

STUDENTS’ COVER PAGE

INFORMATION AND COMMUNICATION UNIVERSITY

School:………………………………………………

Degree Programme:…………………………………….
Course name and Code…….……………..…………….
Assignment No.(1)

Student’s Surname: …………………………………

Student’s First name: ………………………………

Student number: .………….………………………..

Mode of Study: ………………………(FT/DL)..(your mode of study)

E-mail Address: ………………………your email

Phone Number: ………………………your number

Lecturer’s name: …………………………………..

Due Date: 20th OCTOBER, 2023.

ANSWER ALL QUESTIONS:


ASSIGNMENT JULY-DEC 2023

QUESTION 1
Consider the following set of processes with their arrival and burst times as shown
Process Arrival Time Burst Time (ms)
P1 3 3
P2 1 6
P3 6 2
P4 0 7
P5 3 1
Find the Completion Time, Turnaround Time, Waiting Time and Response Time
a) FCFS [6 Marks]
b) Shortest Job First: non- preemptive. [6 Marks]
c) Shortest Job First preemptive. [6 Marks]
d) Round Robin with Quantum Time of 2ms [7 Marks]

QUESTION 2
a) Explain in details how a deadlock differs from starvation? [12 Marks]
b) For single unit resources, we can model resource allocation and requests as a
directed graph connecting processes and resources. Draw/sketch such a graph and
explain what is involved in deadlock detection. [13 Marks]
QUESTION 3
a) Multi-programming (or multi-tasking) enables more than a single process to
apparently execute simultaneously. How is this achieved on a uniprocessor? [12 marks]
b) Explain in details what the banker's algorithm must know prior, in order to prevent
deadlock(s). [13 Marks]
QUESTION 4
a) Explain how the producer-consumer problem is relevant to operating system I/O. [12]
b) Describe the four generations of computing and how operating systems have
developed as a result. [13 Marks]
QUESTION 5
a) Enumerate the advantages and disadvantages of supporting multi-threaded
applications with kernel-level threads. [12 Marks]
b) Describe in details the concept of round robin scheduling. Explain the parameter(s)
associated with the scheduler. [13 Marks]
Prepared by: Sinkala
0978316789
©2023
Use of Chatgpt will attract a penalty of ZERO (0) Mark.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy