Scribd
Upload
27 views1 page

Assignment-1 For All

Uploaded by

kegafok262
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
27 views1 page

Assignment-1 For All

Uploaded by

kegafok262
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/ 1

Indian Institute of Information Technology Bhopal

Department of Computer Science and Engineering (CSE)


Assignment-1 (for all)
Subject Code:- CSE-315 Subject Name:- Operating System

Que.1: Explain how process control block (PCB) information is managed during a fork()
operation and what changes occur in the parent and child processes’ PCBs after fork() is called.

Que.2: Consider the following sequence of page references:


7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 2, 1, 2, 0, 1, 7, 0, 1
Assume a memory with 3 frames available. Simulate the page replacement process using the
following algorithms:
-FIFO (First-In, First-Out)
-LRU (Least Recently Used)
-Optimal Page Replacement.
1.Determine the number of page faults that occur for each algorithm.
2.Also, explain which algorithm performs best in this scenario and why.
3.Explain the concept of Belady’s anomaly and discuss if any of the above algorithms are prone
to this anomaly.

Que.3: A disk has 200 tracks, numbered 0 to 199. The disk head is currently positioned at track
50, and the pending requests for disk access are:
95, 180, 34, 119, 11, 123, 62, 64
Perform disk scheduling simulations using the following algorithms:
-FCFS (First-Come, First-Served)
-SSTF (Shortest Seek Time First)
-SCAN (Elevator Algorithm)
-C-SCAN (Circular SCAN).
1. Calculate and compare the total head movement (number of tracks traversed) for each
algorithm.
2. Determine which algorithm minimizes the total head movement in this scenario and justify
why.
Que.4: Define a thread and explain its key characteristics. How does it differ from a process in
terms of memory usage and execution? Also, Compare and contrast user-level threads and
kernel-level threads. What are the advantages and disadvantages of each?

Que.5: Describe the basic idea behind paging as a memory management scheme and how it
addresses the issues of memory fragmentation. Also, explain the structure of a page table in
the paging system. How does it map virtual addresses to physical addresses?

You might also like