Scribd
Upload
40 views4 pages

Imp Ques of Os

Uploaded by

suyashk752
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
40 views4 pages

Imp Ques of Os

Uploaded by

suyashk752
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/ 4

IMPORTANT QUESTIONS OF OPERATING SYSTEM

UNIT-1

a.Define two main functions of an operating system.

b. Explain the principal advantages of multiprogramming.

c. Explain the following terms in detail: (i) Multiprocessor operating system (ii) Real time system (iii)
Time sharing system

d. Explain in detail about the Multiuser Systems and Multithreaded Systems.

e. Explain in detail about the Operating System services.

f.Explain Microkernel and Monolithic kernel in detail.

g.Briefly Explain the Layered Operating System with neat sketch.Also Explain Protection and Security.

h. What is Kernel? Describe various operations performed by Kernel.

UNIT-2

a. Explain starvation problem and its solution.

b. Define the term busy waiting.

c. Define semaphore and its types.

d. Define process and process control block. Also, describe process state transition diagram in detail.

e. Explain producer consumer problem and its solution using semaphore.

f. Explain dinning philosopher problem and its solution using semaphore.

g.What do you mean by Concurrent Processes?

h. Explain in detail about the Mutual Exclusion and Critical Section Problem.

i. Explain in detail about the Threads and their management.

j. Explain in detail about the Inter Process Communication models and Schemes.

k.Explain Dekkers Problem and its solution.

l.Explain Critical Section with the help of example.


UNIT-3

a. For the following processes, draw Gantt chart to illustrate the execution using,

(i) Preemptive priority scheduling (ii) Non-Preemptive priority scheduling. Also, Calculate average
waiting time and average turnaround time. (Assumption: A larger priority number has higher
priority.

b. Consider the given snapshot of a system with five processes (P0,P1,P2,P3,P4) and three resources
(A,B,C).

c. What do we need Scheduling?

d. What are the Performance Criteria in CPU Scheduling?

e. What do you mean by the safe state and an unsafe state?

f.Explain all the Scheduling Algorithms in detail.


g.Describe Bankers Algorithm for Safe Allocation.

h.What do you mean by Caching,Spooling and Error Handling.

i.What is Deadlock?Describe the necessary Condition for deadlock with example.

UNIT-4

a.What is the main function of Memory Management Unit?

b.Explain Logical Address and Physical Address Diagramatically?

c.Explain Paging and also write the difference between Paging and Segmentation.

d.Explain the difference between Internal Fragmentation and External Fragmentation.How to Solve
Fragmentation problem suing paging.

e. Explain thrashing and locality of reference.

f. Distinguish between physical and logical address space of a process.

g. Explain the concept of paging. Also, explain paging hardware support using TLB with suitable
diagram

h. Explain the concept of demand paging.

Consider the given references to the following pages by a program:


0,9,0,1,8,1,8,7,8,7,1,2,8,2,7,8,2,3,8,3

How many pages faults will occur if the program has three-page frames available to it and uses:

(i) FIFO replacement (ii) LRU replacement (iii) Optimal replacement.

i.What are the disadvantage of Single Contigous memory allocation.

j.What is Thrashing?What is the cause of Thrashing?How does the System detect Thrashing?What
can the system to eliminate this problem?

k. Explain Concept of Virtual Memory.

l. Explain the concept of paging. Also, explain paging hardware support using TLB with suitable
diagram.

UNIT-5

a. Explain tree level directory structure.

b. Explain the term RAID and its characteristics. Also, explain various RAID levels with their
advantages and disadvantages.
c. Explain the concept of file system management. Also, explain various file allocation and file access
mechanisms in details.

d. Suppose the following disk request sequence (track numbers) for a disk with 100 tracks is given:
45, 20, 90, 10, 50, 60, 80, 25, 70. Assume that the initial position of the R/W head is on track 49.
Calculate the net head movement using: (i) SSTF (ii) SCAN (iii) CSCAN (iv) LOOK

e. Explain the followings: (i) Buffering (ii) Polling (iii) Direct Memory Access (DMA).

f. Write short notes on following.

g. File system protection and security and ii) Linked File allocation methods

h. A hard disk having 2000 cylinders, numbered from 0 to 1999. the drive is currently serving the
request at cylinder 143,and the previous request was at cylinder 125.The status of the queue is as
follows 86, 1470, 913, 1774,948,1509,1022,1750,130 What is the total distance (in cylinders) that
the disk arm moves to satisfy the entire pending request for each of the following diskscheduling
algorithms? (i) SSTF (ii) FCFS

i.Define latency and Seek Time?

j.Discuss the linked,Contigous and Index and Multilevel Indexing File allocation schemes.Which
allocation scheme will minimize the amount of space required in directory structures and why?

k.Write a Short Note on

a.I/O Buffering

b.Disk Storage and Scheduling.

l.Difference between Directory and File.

You might also like