Scribd
Upload
8 views1 page

OSY_QB

The document is a question bank for an Operating Systems course, containing a variety of questions categorized into 2 marks and 4 marks. It covers topics such as scheduling criteria, CPU and I/O burst cycles, process control blocks, deadlock, memory management, and IPC methods. The questions require explanations, definitions, and diagrams to illustrate key concepts in operating systems.

Uploaded by

nikhilwankhede0707
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
8 views1 page

OSY_QB

The document is a question bank for an Operating Systems course, containing a variety of questions categorized into 2 marks and 4 marks. It covers topics such as scheduling criteria, CPU and I/O burst cycles, process control blocks, deadlock, memory management, and IPC methods. The questions require explanations, definitions, and diagrams to illustrate key concepts in operating systems.

Uploaded by

nikhilwankhede0707
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

OSY

Question Bank
2 Marks Questions

1. Explain any four scheduling criteria.


2. Describe CPU burst cycle and I/O burst cycle.
3. State difference between preemptive scheduling and non-preemptive scheduling.
4. Draw process state diagram
5. Define following terms i) Page fault ii) Segmentation
6. Define the term swapping.
7. Define Deadlock
8. Describe multilevel queue scheduling with labeled diagram.
9. Explain process Control block
10. Define following terms : i) Virtual Memory ii) Paging

4 Marks Questions

1. Explain shared memory method of IPC using neat labeled diagram.


2. Describe process control block with the help of suitable diagram.
3. Explain following terms with respect to scheduling i) CPU utilization ii) iii) iv) Throughput Turnaround
time Waiting time
4. Differentiate between Long term scheduler and Short term scheduler w.r.t. following points: i) Selection
of job ii) Frequency of execution iii) Speed iv) Accessing which part of system
5. With suitable example describe how to use bit map method for free space management.
6. Explain fixed and variable memory management.
7. With neat diagram explain multilevel queue scheduling.
8. Define deadlock and state the necessary conditions for deadlock.
9. State and describe types of scheduler.
10. Explain Round Robin algorithm with suitable example
11. Compare between bitmap and linked list free space management techniques.
12. With suitable diagram, describe the concept of variable partitioning of memory.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy