Scribd
Upload
8 views1 page

Wa0000.

The document contains sample questions from three chapters - CPU Scheduling and Algorithms, Memory Management, and File Management - of an Operating System exam. Some key questions ask students to define terms like scheduler, preemptive and non-preemptive scheduling, paging, and virtual memory. Students are also asked to explain concepts like deadlock avoidance, bitmap free space management, and different file allocation methods in detail. Sample problems include calculating average waiting times for jobs under FCFS and SJF scheduling algorithms.

Uploaded by

mayjunejuly282
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

Wa0000.

The document contains sample questions from three chapters - CPU Scheduling and Algorithms, Memory Management, and File Management - of an Operating System exam. Some key questions ask students to define terms like scheduler, preemptive and non-preemptive scheduling, paging, and virtual memory. Students are also asked to explain concepts like deadlock avoidance, bitmap free space management, and different file allocation methods in detail. Sample problems include calculating average waiting times for jobs under FCFS and SJF scheduling algorithms.

Uploaded by

mayjunejuly282
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

Date :- 16/10/2023

2nd Class Test Question Bank


Subject :- Operating System ( OSY ) Subject Code : 22516

Chapter 4: CPU Scheduling and Algorithms


1. Define Scheduler. 2M
2. State any four criteria in CPU scheduling. 2M
3. Describe CPU and I/O burst cycle with suitable diagram. 2M
4. Define the following term. 4M
a. Pre-emptive scheduling.
b. Non Pre-emptive scheduling.
5. Explain deadlock avoidance with example. 4M
6. Consider the following four jobs. Find the average waiting time. 4M
i. FCFS
ii. SJF
Process Burst Time
J1 8
J2 5
J3 5
J4 13

Chapter 5: Memory Management

1) What is the concept of paging? 2M


2) Explain “Bitmap” method in free space management technique. 4M
3) Explain memory management in detail. 4M
4) Explain concept of virtual memory with diagram . 4M
5) Differentiate between segmentation and paging (any 4 points) 4M.

Chapter 6: File Management


1. What is file? 2M
2. List any four attributes of file. 2M.
3. What is RAID?. 2M
4. List different directory structure and explain any one in detail. 4M
5. List different file allocation methods. Explain any one in detail. 4M

Regards,
Mr. Pratik H. Gurav
CO Department

You might also like