Σχόλια 0

Το κείμενο του εγγράφου

KRISHNA INSTITUTE OF ENGINEERING & TECHNOLOGY

Department of Computer Application

MCA-311 Operating System

Unit–

Four : Storage Management (Question Bank)

1.

Discuss in detail implementation of paging technique with respect to addressmapping, page table, page size and hardware support for paging. [Describe thepaging scheme of memory management with reference to the hardware required tosupport the system. ]

2.

Explain the difference between internal fragmentation the external fragmentation.Which one occurs in

paging system? OR [Explain the difference between internal andexternal fragmentation.]

3.

Differentiate between Page and Segment.

4.

ExplainSwapping

5.

What is the cause of thrashing? What steps are taken by the system to eliminatethis problem?

OR [Describe thrashing] OR [What do you understand by Thrashing?What are measures taken to avoidthrashing?] [When do page faults occur? Describe theactions taken by the operating system when a page fault occurs.]

6.

What do you understand by Belady’s anomaly. Which popular page replacementalgorithm suffers from the Belady’s anomaly? Also give the name of the class ofalgorithms, which can never suffer from Belady’s anomaly and why?[ExplainBelady’s anomaly with the help of an example.]

7.

Describe the First Fit, Best Fit and Worst Fit memoryallocationAlgorithms.

Describe a mechanism by which one segment could belong to the address space oftwo different processes. [UPTU, 2008]

10.

What do you mean by demand paging?–

Explain.

11.

Describe

overlay

12.

Differentiate between:

(i)

Block and character devices.

(ii)

Blocking and non-blocking I/O.

(iii)

Link list and bit map approach for free space memory management.

(iv)

Double buffering and single buffering.

(v)

Deadlock Prevention and Avoidance

[What are block and character devices? Differentiate between blocking and non-blocking I/O devices.]

13.

Why must the bit map for file allocation be kept on mass storage, rather

than in mainmemory?

14.

Consider a system where free space is kept in a free-space list.

(a)

Suppose that the pointerto the free-space list is lost. Can the system

reconstruct the free-space list? Explain youranswer.

(b)

Suggest a scheme to ensure that the pointer is never lost as a result

of memoryfailure.

15.

Double buffering and single buffering.

16.

Differentiate between pre-paging and demand paging.

17.

Write short notes on the following:

(a)Temporal and spatial locality of reference

(b)Memory protection mechanism

(c)Memory allocation algorithms

18.None of the disk scheduling discipline, except FCFS, are truly fair (starvation mayoccur) Explain why this assertion is true. (i)Describe a way to modify algorithms suchas SCAN to ensure fairness. (ii) Explain why fairness is an important goal in

a time-sharing system.

(iii)Give two examples of circumstances in which it is importantthat the operating system be unfair in serving I/O requests.

19.

Discuss any two disk scheduling algorithm in brief.

OR [Discuss ElevatorAlgorithm for disk scheduling with examples.]

20.

Discuss various file allocation strategies for disk space management. OR [Consider asystem that supports the strategies of continuous, linked and indexed allocation.What criteria should be used in deciding which strategy is best utilized for aparticular file?] OR [Discuss the Contiguous, Linked, Index and Multilevel Indexing fileallocation schemes.]

21.

Latency optimization usually has little effect on system performance except under heavyloads. Why?