Scribd
Upload
6 views

OS LAB

The document is an assignment for the Operating System course (CSE3003) for the interim semester 2024-25, with a submission deadline of December 24, 2024. It includes a list of 25 questions covering various topics such as memory management, paging, virtual memory, disk scheduling, RAID, and security in operating systems. Students are required to answer these questions based on their understanding of the subject matter.

Uploaded by

mp796526
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
6 views

OS LAB

The document is an assignment for the Operating System course (CSE3003) for the interim semester 2024-25, with a submission deadline of December 24, 2024. It includes a list of 25 questions covering various topics such as memory management, paging, virtual memory, disk scheduling, RAID, and security in operating systems. Students are required to answer these questions based on their understanding of the subject matter.

Uploaded by

mp796526
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

THEORY ASSIGNMENT

INTERIM SEMESTER 2024-25


SUBJECT: Operating System
COURSE CODE: CSE3003
SLOT : C14+E11+E12
Last date of Submission: on or before: 24th December 2024
(on Google classroom).Please do not e-mail me
List of Questions
Q.1) What do you mean by memory management? Give classification of Memory
Management Techniques.
Q.2) What is Paging and Segmentation ?
Q.3) What do you mean by Physical and Logical Address Space? Explain with
suitable example.

Q.4) Consider the following segment table:

Segment Base Length


0 219 600
1 2300 14
2 90 100
3 1327 580
4 1952 96

What are the physical addresses for the following logical addresses?
a. 0, 430
b. 1, 10
c. 2, 500
d. 3, 400
e. 4, 112

Q.5) How Virtual Memory works? What are its advantages and disadvantages?

Q.6) Consider a paging hardware with a TLB. Assume that the entire page table and
all the pages are in the physical memory. It takes 10 milliseconds to search the TLB
and 80 milliseconds to access the physical memory. If the TLB hit ratio is 0.6, the
effective memory access time (in milliseconds) is _________.

A. 120
B. 122
C. 124
D. 118

Q.7) What is Demand Paging, Page Fault and Thrashing?

Q.8) Describe following Page Replacement algorithms:


a.) Optimal Page Replacement Algorithm
b.) First In First Out Page Replacement Algorithm
c.) Least Recently Used (LRU) Page Replacement Algorithm

Q.9) Consider the following page reference string:


7,2,3,1,2,5,3,4,6,7,7,1,0,5,4,6,2,3,0,1
Assuming the demand paging with three frames, how many page faults would
occur for the following replacements algorithms?
a. LRU b. FIFO c. Optimal

Q.10) Describe Belady’s anomaly with example.

Q.11) What is segmentation? Why it is required? What are its advantages and
disadvantages? Differentiate between Paging and Segmentation?

Q.12) What is Segmented Paging? What are its advantages and disadvantages?

Q.13) Describe in detail Contiguous Memory Allocation.

Q.14) What is Fragmentation? What are the two types of Fragmentation?

Q.15) Describe the following in the context of Disk Scheduling:

a.) Seek Time


b.) Rotational Latency
c.) Transfer Time
d.) Disk Access Time
e.) Disk Response Time

Q.16) Describe following Disk Scheduling Algorithms with example:

a.)FCFS scheduling algorithm


b.) SSTF (shortest seek time first) algorithm
c.)SCAN scheduling
d.) C-SCAN scheduling
e.) LOOK Scheduling
f.) C-LOOK scheduling
Q.17) Consider the following disk request sequence for a disk with 100 tracks:

45, 21, 67, 90, 4, 50, 89, 52, 61, 87, 25


Head pointer starting at 50 and moving in left direction. Find the number of head
movements in cylinders using FCFS scheduling.

Q.18) What is RAID? How RAID works? What are various levels of RAID ? What are
the advantages and disadvantages of RAID.

Q.19 Explain File System Structure. What happens when you turn on your computer?

Q.20) How Disk space is allocated to files? Describe the following methods which can
be used for allocation.

1. Contiguous Allocation.
2. Extents
3. Linked Allocation
4. Clustering
5. FAT
6. Indexed Allocation
7. Linked Indexed Allocation
8. Multilevel Indexed Allocation
9. Inode

Q.21) Describe the following things about I/O systems in Operating System:

1. I/O devices
2.I/O System calls
3. DMA controllers
4. Memory-Mapped I/O
5. Direct Virtual Memory Address

Q.22) Differentiate between Security and Protection in Operating System? What is


Access Matrix in Operating System? Describe the following methods of
implementing the access matrix in the operating system.
1.Global Table
2.Access Lists for Objects
3.Capability Lists for Domains
4. Lock-Key Mechanism

Q.23) Describe about Multithread Programming Model.

Q.24) Describe the way to apply the monitors to solve the dinning philosopher’s
problem with example.
Q.25) Consider the following snapshot of a system:

Allocation Max
A B C D A B C D
P0 3 0 1 4 5 1 1 7
P1 2 2 1 0 3 2 1 1
P2 3 1 2 1 3 3 2 1
P3 0 5 1 0 4 6 1 2
P4 4 2 1 2 6 3 2 5

Using the banker’s algorithm, determine whether or not each of the following
states is unsafe. If the state is safe, illustrate the order in which the processes
may complete. Otherwise, illustrate why the state is unsafe.
a) Available = (0,3,0,1)
b) Available = (1,0,0,2)

______________________________

You might also like