Thanks to visit codestin.com
Credit goes to www.scribd.com

Scribd
Upload
32 views3 pages

CSC312 Assignment 1

This document outlines the assignment for CSC 312 Operating Systems, detailing the questions to be answered for a total of 70 marks. The assignment covers various topics including multiprocessing, kernel functions, memory management, and page replacement algorithms. The due date for submission is set for 13 May 2022 at 23:59HRS.

Uploaded by

Jimmy Cab
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
32 views3 pages

CSC312 Assignment 1

This document outlines the assignment for CSC 312 Operating Systems, detailing the questions to be answered for a total of 70 marks. The assignment covers various topics including multiprocessing, kernel functions, memory management, and page replacement algorithms. The due date for submission is set for 13 May 2022 at 23:59HRS.

Uploaded by

Jimmy Cab
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

Department of Computer Science

CSC 312

OPERATING SYSTEMS

ASSIGNMENT 1

Answer all Questions in detail.

Total of 70 marks!

Due Date: 13 May 2022 at 23:59HRS


CSC 312 Assignment 1 Questions

1. Describe multiprocessing and its impact on the evolution of OS software. [6]

2. In your personal opinion, what generation of OS exists currently? Justify your response.

[4]

3. Describe the kernel. Detail its functions, modes and types. [8]

4. What are the differences between user-level and kernel-level threads? Under what

circumstances is one type better than the other? [8]

5. Consider a memory system with a cache access time of 15ns and a memory access time of

210ns. If the effective access time is 20% greater than the cache access time, what is the

hit ratio H? [6]

6. Illustrate the different states that a typical job/process goes through as it moves through the

system from HOLD to FINISHED. [4]

7. Suppose a process (P1) has referenced a memory address not resident in physical memory

due to demand paging. Give a detailed breakdown of the steps that the operating system

will perform in order to handle the page fault. Note: Focus on operations that the OS

performs and the data structures modified by the OS. [10]

8. With the use of an example, discuss the differences between physical address and logical

address in memory management. [8]

9. Given the following stream of page references by an application, calculate the number of

page faults the application would incur with the following page replacement algorithms.

Assume that all pages are initially free.

Reference Stream: A B C D A B E A B C D E B A B
a. First-In First-Out (FIFO) page replacement with 3 physical pages available. [4]

b. Least Recently Used (LRU) page replacement with 3 physical pages available. [4]

c. Optimal page replacement with 3 physical pages available. [4]

d. True or False. If we increase the number of physical pages from 3 to 4, the number of

page faults always decreases using FIFO page replacement. Briefly explain. [4]

PS: Plagiarism of any kind will not be tolerated!!!

You might also like