Scribd
Upload
138 views4 pages

OS Imps

Uploaded by

SAI KRIPA COMPUTERS
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
138 views4 pages

OS Imps

Uploaded by

SAI KRIPA COMPUTERS
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 4

2023 (Jun)

Q1. Define an operating system. What are the goals of an operating system? Explain.
Q2. Describe the differences among short term, medium term and long term scheduling.
Q3. Write short notes:
a) Concurrent Programming b) Virus c) Remote Procedure Call (RPC) d) Time
Sharing
Q4. What is meant by system call? How it can be used. How does an application program use these call
during execution?
Q5. Define Process States. Draw the diagram of PCB.
Q6. Suppose that a disk drive has 200 cylinders, numbered 0 to 199. The work queue is: 23, 89, 132, 42,
187. Determine the total distance for the following disk scheduling algorithms:
i) Scan ii) Look
Q7. List the advantages and disadvantages of Magnetic Tape memory.
Q8. Explain in detail about various ways of free space management.
Q9. What is the difference between threads and process.
Q10. Explain paging and segmentation. How are they helpful in removing fragmentation?
Q11. What do you mean by deadlock prevention? A computer has six tape drive with a processes
competing for them. Each process need two tape drives for which values of n the system is deadlock free.
Q12. Explain mutual exclusion with suitable example.
Q13. Discuss Reader-Writers solution using Monitors.
Q14. Explain file system used in Linux and Windows.
Q15. What is a file? Briefly explain different directory structures. What kind of directory structure is used in
UNIX?
2023 (Nov)
Q1. Explain the evolution of operating system in detail.
Q2. Explain the concept of buffering and spooling.
Q3. What is a File? Write different file attributes and operations?
Q4. Compare the following CPU scheduling algorithms, highlighting the strengths and limitation of each
algorithms.
i) FCFS ii) SRTF
Q5. Explain disk structure. How data read and write form/on disk?
Q6. What is the Difference between SCAN and LOOK Disk scheduling algorithms?
Q7. What is process state? Explain state transition diagram.
Q8. Explain Thread Control Block.
Q9. Describe about how recovery from deadlock?
Q10. What is Segmentation? Explain virtual to physical address mapping in a segmented system with the
help of a diagram.
Q11. Write a semaphore solution for dining philosopher's problem.
Q12. How many page faults does the LRU, FIFO and Optimal page replacement algorithm produce 7 1 2 0 3
0 4 2 3 0 3 2 1 2 0 1 7 0 1 assume frame size is 3?
Q13. Explain virtual memory in operating system. Discuss the advantages and disadvantages of non
contiguous storage allocation.
Q14. Discuss the design issues of distributed operating system.
Q15. Write short notes: a) Worms and Virus b) Demand paging c) Batch processing d)Time-
sharing
2020
Q1. Define Process States. Draw the diagram of PCB?
Q2. What is meant by a System call? How it can be used? How does an application program use these calls
during execution?
Q3. Write a short notes? i) Time sharing ii) Network iii) Batch processing
Q4. Describe various space allocation strategies with their merits/demerits.
Q5. Consider the following set of processes.
Process Burst time Arrival time
P1 3 0
P2 5 1
P3 2 2
P4 5 3
P5 5 4
Develop a Gantt-chart and calculate the waiting
time using:
i) FCFS ii) SJF iii) Round Robin (q = 1)

Q6. Briefly explain the following.


i) Mutual exclusion ii) Critical section problem

Q7. Compare Paging and Segmentation with example.

Q8. What is meant by Thrashing? Explain various causes of thrashing.

Q9. Consider the main memory with capacity of 3 frames.


Assume that pages of a process are referenced in the order as given below:
(7, 0, 1, 2, 0, 3, 0, 4 , 2, 3, 0, 3) Which one is better FIFO or LRU and why?

Q10. Explain the concept of dirty bit for improving the performance during page fault?

Q11. What is Virtual Memory? Explain the concept of demand paging.

Q12. Explain how logical memory address are translated into physical memory address in segmented
memory management system with example.

Q13. What do you mean by Semaphore? Explain it’s uses and its implementation.

Q14. Write short notes.


a) Remote Procedure Call (RPC) b) Worms and Virus c) Define levels of RAIO

Q15. 7. a) Consider following Snapshot of a system:


Allocation Max Available

ABC ABC ABC


P0 101 431 330
P1 112 214
P2 103 133
P3 200 541

Answer the following questions using Bankers Algorithm


i) Is the system in Safe state
ii) What is the content of the Matrix need?
2019
Q1. What are System call? Explain briefly about various types of system call provided by an operating
system.
Q2. What are the various services provided by Operating system?
Q3. What is File? What are the different File attributes and operations?
Q4. What are points to be consider in file system design? Explain linked list allocation in detail.
Q5. What do you mean by PCB? Where is it used? What are its contents? Explain.
Q6. Consider the following page reference string?
1.2.3.4.5, 3, 4, 1, 6, 7, 8, 7, 8.9.7.8.9.5.4, 5.
How many page faults would occur for the following replacement algorithm, assuming four frame:
A) FIFO
B) LRU

Q7. Explain the following term.


a) Real and virtual concurrency b)Critical section c) Mutual exclusion d) I/O Interfaces

Q8. On a simple paging system with 224 bytes of physical memory.


256 pages of logical address space and a page size 210 bytes. How many bits are in logical address.
Q9. What is Binary and Counting semaphores?
Q10. Describe necessary conditions for a deadlocks situation to arise.
Q11. Write a short notes?
a) Multi processor operating system b) Distributed operating system c) Threads d) File protection

You might also like