0% found this document useful (0 votes)
8 views2 pages

Unit 1

The document outlines key topics in operating systems, including the process life cycle, multithreading models, and various services provided by operating systems. It also covers scheduling algorithms, interprocess communication, and synchronization issues, with specific examples and problems to solve. Additionally, it discusses the structure of operating systems and the importance of process control blocks.
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
0% found this document useful (0 votes)
8 views2 pages

Unit 1

The document outlines key topics in operating systems, including the process life cycle, multithreading models, and various services provided by operating systems. It also covers scheduling algorithms, interprocess communication, and synchronization issues, with specific examples and problems to solve. Additionally, it discusses the structure of operating systems and the importance of process control blocks.
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

Unit 1

1. Explain the Process Life Cycle with a neat state transition diagram. Discuss each state in detail.

2. Explain different multithreading models with neat diagrams.

3. Explain the various services provided by an Operating System.


4. Compare and Contrast User Mode and Kernel Mode?

5. Illustrate the importance of Interprocess Communication in modern operating systems.

6. Differentiate between Process and Thread.

7. Discuss the structure of an Operating System with neat classification.

8. Define Process and Explain Process Control Block (PCB).

9. Explain the steps involved in building and booting an Operating System

10. Discuss the issues in threading.

11. Types of System Calls


12. Write about Operations on processes

Unit-2

1. Differentiate preemptive and non-preemptive scheduling algorithms.


2. Consider the following processes:

Process Arrival Time Burst Time

P1 0 5

P2 1 3

P3 2 8

P4 3 6

3. Apply Round Robin scheduling with time quantum = 2ms. Draw the Gantt chart and calculate
average waiting time.
4. Explain the Critical Section Problem.
5. Apply semaphore operations to solve synchronization problems.
6. Illustrate the Producer-Consumer problem using semaphores.
7. Describe Busy Waiting in synchronization.
8. Describe the objectives of CPU Scheduling.
9. Consider the following processes:
Process Arrival Time Burst Time

P1 0 5

P2 1 3

P3 2 8

P4 3 6

10. Apply SJF Preemptive scheduling. Draw the Gantt chart and compute average turnaround time
and waiting time for each process.
11. Illustrate binary semaphore using suitable example.
12. Demonstrate Mutex Lock mechanism using suitable example.
13. Explain Monitors in Operating Systems.
14. Describe the requirements for a solution to the Critical Section Problem.

You might also like