postheadericon Chapter 7, Memory Management

#
Question
Book Ref.
Marks
Year
1
Explain the overall performance of static partitioned memory allocation with respect to principles of allocation, relocation, protection and sharing.
OR
Discuss the requirements to be satisfied by the good memory management scheme.
OR
Write short notes on memory management requirements
7.1
4


3

4
Jan,2000


Jan,2004

Jan,2005
2
Need for relocation capability of process
7.1
2
Jan,2005
3
Define Dynamic Relocation
7.1
2
Jan,2000
4
Describe with the help of diagrams the primitive contiguous memory allocation methods.
1 Static (fixed partitioning)
2 Dynamic partitioning and first-fit. Best fit and next fit algorithms being applied for placement of incoming processes. Mention the resultant pros and cons of these allocation methods and placement algorithms.
OR
Compare fixed size and variable size partitioning and discuss the problem of fragmentation associated with both.
OR
In a fixed partition scheme what are the advantages of using unequal size partition?
OR
Dynamic partitioning
7.2
8






4


2

2
Jan,2002






Jan,2004


Aug,2004

Jan,2008
5
Explain in brief various types of fragmentation occurring in memory.
OR
Write difference for internal and external fragmentation
7.2
1

2
Jan,2000

Jan,2003
6
Define Buddy System
OR
Write short notes on buddy system.
OR
Explain the buddy system with proper example.
7.2
2

3

5
Jan,2000

Jan,2004

Jan,2005
7
Explain the concept of paging.
7.3
1
Jan,2008
8
Explain Segmentation in brief
7.4
3
Jan,2003
9
Differentiate between page and frame
OR
What is the difference between a page and frame?

1

1
Jan,2005

Jan,2008

What is the distinction between logical, relative and physical address?
OR
Differentiate between Logical and physical addresses

2

1
Aug,2004

Jan,2005
10
Differentiate between page and segment

1
Jan,2005
11
Write short notes on memory management in Windows NT.

2
Jan,2000
12
Describe the different approaches for selection of free areas of memory for creation of dynamic memory partition. Illustrate these approaches showing respective memory for the following incoming processes: Arrival of process P and 14K followed by process Q of 20K.
The initial partition are:
Used, 18K free, Used , 16K free, Used, 32K free, Used 28K free, Used

4
Jan,2000
13
State whether the following statements are true or false.
Dynamic relocation means relocation of pages of the image while loading of the program.

1
Jan,2002

0 comments:

Follow by Email

Total Pageviews

© BipinRupadiya.com. Powered by Blogger.