Scribd
Upload
3 views1 page

OS Assignment For 4 and 5 Units

This document outlines an assignment for the B. Tech program in Computer Science and Engineering at GITAM University, focusing on Operating Systems. It includes various questions related to memory allocation, page replacement algorithms, disk scheduling, and directory structures, with a maximum mark of 10 and a submission deadline of March 26, 2025. The assignment is intended for the fourth semester of the academic term 2024-25.

Uploaded by

nagavaishnavi51
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
3 views1 page

OS Assignment For 4 and 5 Units

This document outlines an assignment for the B. Tech program in Computer Science and Engineering at GITAM University, focusing on Operating Systems. It includes various questions related to memory allocation, page replacement algorithms, disk scheduling, and directory structures, with a maximum mark of 10 and a submission deadline of March 26, 2025. The assignment is intended for the fourth semester of the academic term 2024-25.

Uploaded by

nagavaishnavi51
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

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

GITAM SCHOOL OF TECHNOLOGY


GITAM (Deemed to be University, VISAKHAPATNAM-530045

Program B. Tech Category of Course PC Semester IV


CSE-AIML-C Course Code CSEN1101
Branch Term 2024-25
CS-A Course Title OS
Start
10-3-25
Continuous ASSIGNMENT on Date
Max Marks 10 M
Evaluation UNIT 4 & 5 Cut of
26-3-25
Date

Answer all the questions COs LL


Consider a system with 16 bit virtual addresses, 256 byte pages, and 4 byte page table
1 entries. The OS builds a multi-level page table for each process. Calculate the CO4 L4
maximum number of pages
What is Belady’s Anomaly? With the help of the Optimal Page replacement
2 algorithm find the page fault ratio for the reference string 1,2,3,4,1,2,5,1,2,3,4,5 CO4 L4
with 4 frames.
3 Define contiguous memory allocation. Discuss different contiguous memory CO4 L2
allocation techniques
Consider a system with a list of unallocated blocks(free-space) of 6KB,
4 14KB,19KB,11KB and 13KB blocks and a process requested a free space of 12KB CO4 L4
block to store its data.How would the free-space list be organized for that process
using first-fit, best-fit and worst-fit policy?
5 What are the causes of thrashing? How does the system detect thrashing? How to CO4 L3
eliminate this problem?
6 Analyze different directory and disk structures CO5 L2

7 With a neat diagram explaining about moving head disk mechanism and write a note CO5 L3
on the Mass storage disk mechanism
8 Why disk scheduling is required, analyze and compare any three disk scheduling CO5 L4
algorithms
What id disk bandwidth? Analyse the SSFT disk scheduling algorithm for the given
9 queue and find the total head movement. Queue: 98,183,37,122,14,124,65,67. The CO5 L4
head starts at 53.
Discuss the role of MBR in OS. Analyze the SCAN disk scheduling algorithm for the
10 given queue and find the total head movement. Queue: 98,183,37,122,14,124,65,67. CO5 L4
The head starts at 53.

*Submit the assignment on A4 pages only*

Page |1 [PTO]

You might also like