0% found this document useful (0 votes)
6 views

Assignments

The document outlines an assignment on operating systems with 15 questions covering topics like synchronization mechanisms, page replacement algorithms, deadlocks, CPU scheduling algorithms, process synchronization, virtual memory, storage media, file system recovery, the dining philosophers problem, and differences between time-sharing and real-time operating systems.

Uploaded by

arti873929
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
6 views

Assignments

The document outlines an assignment on operating systems with 15 questions covering topics like synchronization mechanisms, page replacement algorithms, deadlocks, CPU scheduling algorithms, process synchronization, virtual memory, storage media, file system recovery, the dining philosophers problem, and differences between time-sharing and real-time operating systems.

Uploaded by

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

Do all s and submit with practical file on and before 30/4/2024

Assignment: Operating Systems Comprehensive Examination

1. Explain about Synchronization Mechanisms and its criteria. (5 marks)


2. What are the various Page Replacement Algorithms used for Page Replacement?
(5 marks)
3. Why are segmentation and paging sometimes combined into one scheme? (5
marks)
4. Explain in detail the conditions necessary for deadlocks. (5 marks)
5. Discuss in detail threads, their advantages, and the different types of threads. (5
marks)
6. Apply the FCFS CPU scheduling algorithm to find out the average waiting time
for the given processes:
- Process Id: P1, Arrival time: 3, Burst time: 4
- Process Id: P2, Arrival time: 5, Burst time: 3
- Process Id: P3, Arrival time: 0, Burst time: 2
- Process Id: P4, Arrival time: 5, Burst time: 1
- Process Id: P5, Arrival time: 4, Burst time: 3 (5 marks)

7. Apply the SJF CPU scheduling algorithm to find out the average waiting time for
the given processes:
- Process Id: P1, Arrival time: 3, Burst time: 4
- Process Id: P2, Arrival time: 5, Burst time: 3
- Process Id: P3, Arrival time: 0, Burst time: 2
- Process Id: P4, Arrival time: 5, Burst time: 1
- Process Id: P5, Arrival time: 4, Burst time: 3 (5 marks)

8. Explain the process of system booting and the different types of booting. (5
marks)
9. Describe the differences between user mode and kernel mode in operating
systems. (5 marks)
10. Define and explain the concept of process synchronization. What are the
different types of processes? (5 marks)
11. What is virtual memory? How is it implemented? (5 marks)
12. Discuss the following storage media, detailing their uses and features:
- Magnetic disks, CDs, DVDs (5 marks)
13. Explain how to recover in a file system. What tools and processes are involved?
(5 marks)
14. Define the dining philosophers problem and explain how it can be solved using
semaphores. (5 marks)
15. Differentiate between time-sharing and real-time operating systems. Provide
examples of where each might be used effectively. (5 marks)

You might also like