Os Question Bank New

Operating System Concepts
4/5 Marks important questions from Each unit appeared in previous year question paper
selected from question bank
UNIT I
1. Explain Batch Processing System.
2. Write a note on multi-programmed systems.
3. Explain Multiprocessor System with diagram
4. Write a note on following. I) Real Time System.
ii) Time Sharing System
5. Explain any three Operating System Resource Management.
i)File system Management?
ii) Process Management
iii)Memory Management
6. Explain any 5 operating system Services
7. Explain Layered Approach operating system structure with a neat diagram.
8. Explain any 5 File operations.
9. Explain various File Attributes.
10.Explain any two directory structures.
i)Tree-Structured Directories ii)Two-Level Directory

11. Explain various Access methods in Files(sequential and direct)
12. Explain any two Allocation Method.
a. Contiguous allocation.
b. Linked allocation
c. Indexed Aallocation.
UNIT II
1. Explain first-fit, best-fit, and worst-fit Memory Allocation with example.
2. Explain paging memory management with an example.
3. Explain external fragmentation.
4. Explain Contiguous Memory Allocation
5. Write short notes on fragmentation.
6. Explain swapping with diagram
7. Explain segmentation with a neat diagram.
8. Write short notes on demand paging.
9. Explain FIFO page replacement policy.
10.Explain LRU page replacement algorithm with an example.
11.Consider the following page reference string: 7,0,1,2,0,3,0,4,2,3,0,3,2,1,2,0,1,7,0,1
How many page faults would occur for the following replacement algorithm
assuming three frames?
i) LRU algorithm ii) Optimal replacement algorithm.
12.Explain optimal page replacement algorithm
13.Write a note on Thrashing.
14.Given the following reference string 7,0,1,2,0,3,0,4,2,3,0,3,2,1,2,0,1,7,0,1 with 3 frames
of memory. Write the steps of FIFO algorithm which shows the occurrence of page fault.
15.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 demand paging with three frames, how many page faults would occur for
the following replacement algorithms?
a) LRU replacement b ) FIFO replacement c) Optimal replacement
16.Explain First Come First Serve (FCFS) disk scheduling with example
17.Explain Shortest Seek Time First (SSTF) disk scheduling with example.
18.SSTF (Shortest Seek Time First) algorithm
19.Explain SCAN disk scheduling with example.
20.Explain CSCAN disk scheduling with example
21.Explain LOOK disk scheduling with example.
22.Explain CLOOK disk scheduling with example
23.Consider a disk with 200 tracks and the queue has random requests from different
processes in the order:55, 58, 39, 18, 90, 160, 150, 38, 184 Initially arm is at 100. Find
the Average Seek length using FIFO, SSTF, SCAN and C-SCAN algorithm.
24.Consider a disk with 200 tracks and the queue has random requests from different
processes in the order: 98, 183, 37, 122, 14, 124, 65, 67
Initially arm is at 55. Find the Average Seek length using FIFO, SSTF,
LOOK and C-LOOK algorithm.
25. Consider the following page reference string: 1, 2, 3, 4, 2, 1, 5, 6, 2, 1,
2, 3, 7, 6, 3, 2, 1, 2, 3, 6. How many page faults would occur for the
following replacement algorithms, assuming four frames?
Remember that all frames are initially empty, so your first unique pages
will cost one fault each.
i) LRU replacement ii) FIFO replacement iii) Optimal replacement
UNIT III
1. Explain process state transition neat diagram.
2. What is PCB? Explain with diagram
3. With diagram explain queuing diagram representation of
process scheduling.
4. Write a note on schedulers.
5. Explain Context switch with diagram
6. Write a note on Inter Process Communication (IPC).
7. Explain IPC in Message-Passing System.
8. Explain Preemptive and Non preemptive Scheduling.
9. List and explain various Scheduling Criteria.
10.Explain FCFS scheduling with an example.
11.Explain Shortest-Job-First Scheduling with an example.
12.Explain round robin scheduling algorithm with an example.
13.Explain Priority Scheduling with an example.
14. Consider the following set of processes, with length of the CPU-
burst time given in milliseconds.
Process Burst time
P1 15
P2 4
P3 10
P4 8
P5 5
Draw Gantt chart using round robin with time quantum of 5
milliseconds and find average waiting time
15.Consider the following set of processes, with length of the

CPU- burst time given in milliseconds.
Process Burst time
P1 6
P2 8
P3 7
P4 3
Find the average turnaround and waiting time. And Also Draw
the gantt chart Using SJF.
16.Consider the following set of processes, with length of the
CPU- burst time given in milliseconds.
Process Arrival Time Burst Time
P1 0.0 8
P2 0.4 4
P3 1.0 1
a) What is the average turnaround time for these
processes with the FCFS scheduling algorithm?
b) What is the average turnaround time for these
processes with the Preemptive SJF scheduling
algorithm?
17.Consider the following set of processes, with the length of the
CPU burst time given in milliseconds:
Process Burst Time Priority
P1 2 2
P2 1 1
P3 8 4
P4 4 2
P5 5 3
The processes are assumed to have arrived in the order P1,
P2, P3, P4, P5, all at time 0.
a) Draw four Gantt charts that illustrate the execution of
these processes using the following scheduling
algorithms: FCFS, SJF, non preemptive priority (a
larger priority number implies a higher priority), and
RR (quantum = 2).
b) What is the turnaround time of each process for
each of the scheduling algorithms in part a?
c) What is the waiting time of each process for each of these
scheduling algorithms?
18.The following processes are being scheduled using a Preemptive,
round robin scheduling algorithm.
Each process is assigned a numerical priority, with a higher number

indicating a higher relative priority. The length of a time quantum is
10 units. If a process is preempted by a higher-priority process, the
preempted process is placed at the end of the queue.
a) Show the scheduling order of the processes using a Gantt chart.
b) What is the turnaround time for each process?
c) What is the waiting time for each process?
d) What is the CPU utilization rate
UNIT IV
1. What is critical section? What are the requirement for a solution to
critical section problem?
2. Explain Peterson’s Solutions for critical section problem
3. Explain the concept of semaphores in process synchronization
4. Explain Bounded-Buffer Problem.
5. What is readers-writers problem? Explain.
6. Explain Dining-Philosophers Problem.
7. Explain any one classic problem of synchronization
8. What are the necessary conditions for deadlock situation to occur?
9. Explain deadlock prevention
10.Explain Resource-Allocation graph.
11.Explain Deadlock Avoidance using safe state algorithm
12.Explain Deadlock Avoidance using Resource-Allocation- Graph
Algorithm
13.Write the answer of Resource – Allocation Graph
14.Explain Banker’s Algorithm.
15.Explain briefly how we can recover from deadlocks
16.Explain the deadlock detection algorithm for single instance of each
resource type.
17.Consider a system with 12 magnetic tape drives and three processes,
P0, P1, and P2. Let the maximum needs and allocation at a certain
time be as follows.
Max needs currently allocated
P0 10 5
P1 4 2
P2 9 2
Find a safe sequence.
18.Explain the resource allocation algorithm in Banker’s
algorithm. Refer the answer of banker’s algorithm
19.Explain banker’s safety algorithm.
Refer the answer of 16 question
20.Given processes P0,P1…P4, resource type A,B,C matrices Allocation.
MAX, Need and array Available as given below. Find a safe
sequence.
Answer the following question using the Banker’s Algorithm.

1) What is the content of matrix Need?
2) Is the system in a safe state?
3) If request (0, 4, 2, 0) from process P1 arrives, can the request be
granted immediately?
21.Consider the following snapshot of a system:

Answer the following question using the
Banker’s Algorithm.
c) What is the content of matrix Need?
d) Is the system in a safe state?
e) If request (1,0,2) from process P1
arrives, can the request be granted
immediately?
22.Write a note on Scheduler Activation.

Os Question Bank New

Uploaded by

Copyright:

Available Formats

Os Question Bank New

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Os Question Bank New

Uploaded by

Copyright:

Available Formats

Operating System Concepts

i)Tree-Structured Directories ii)Two-Level Directory

15.Consider the following set of processes, with length of the

Each process is assigned a numerical priority, with a higher number

Answer the following question using the Banker’s Algorithm.

21.Consider the following snapshot of a system:

You might also like