Mr. Bipin S. Rupadiya

#

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.

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

#

Question

Marks

Year

1

Give the difference between consumable and reusable resources.

1

Jan,2004

2

Explain Deadlock

OR

What is Deadlock?

OR

Write short note on Deadlock.

OR

Single process Deadlock.

1

1

4

2

Jan,2000

Jan,2004

Jan,2005

Jan,2006

3

Describe the necessary conditions for deadlock occurrence.

OR

List the four conditions that create deadlock

OR

List the conditions that lead to deadlock. How can we solve the deadlock problem?

OR

How no preemption condition far deadlock is prevented?

OR

Explain strategies to prevent deadlock

OR

Discuss the various conditions that lead to deadlock.

OR

Explain the conditions for deadlock. What is deadlock prevention?

1

1

4

2

3

2

3

Jan,2000

Jan,2003

Jan,2004

Aug,2004

Aug,2004

Jan,2006

Dec,2006

4

Discuss the deadlock avoidance using banker’s algorithm. Also discuss data structures for implementing this algorithm.

OR

Explain the method of Deadlock Avoidance in particular explains Banker’s Algorithm with suitable example.

OR

Explain Deadlock avoidance strategy with example.

3

5

4

Jan,2000

Jan,2006

Dec,2006

5

Explain deadlock detection and recovery with appropriate algorithm.

OR

List the steps that are performed in a Deadlock detection Algorithm.

2

2

Jan,2006

Jan,2008

6

Explain Starvation

OR

Explain Starvation with appropriate example.

1

2

Jan,2000

Jan,2005

7

Give the difference between Deadlock and Starvation.

2

Dec,2006

8

Explain the difference between deadlock avoidance , detection and prevention 

2

Jan,2003

9

Consider the following snapshot of a system. There are no current outstanding queued unsatisfied and p indicates the process)

Currently available

a)      Compute what each process still might request and display in the columns labeled “still needs”.      

b)      Applying banker’s algorithm whether this system currently in a safe or unsafe state? Why?                

c)      What is the possible order in which processes can finish without any deadlock?

8

Jan,2002

10

Apply the dead lock detection algorithm to the following data and show the result

Available = (2 1 0 0)

Request = | 2 0 0 1 |

                 | 1 0 1 0 |

                 | 2 1 0 0 |

Allocation = | 0 0 1 0 |    

                     | 2 0 0 1 |

                     | 0 1 2 0 |

5

Aug,2004

11

Consider the following snapshot of a system. There are no current outstanding queued unsatisfied requests.

Currently Available

a)      Compute what each process still might request and display in the columns labeled “Still needs”

b)      Applying Banker’s algorithm check whether this system is currently in a safe or unsafe state? Why?

c)      Is this system currently deadlocked? Why or why not

d)     What is the possible order in which processes can finish without any deadlock? Which processes, if any or many become deadlocked?

If a request from p3 arrives for (0, 1, 0, 0) can that request be safely granted immediately granting that whole request leave the system? Which process if any, are or may become deadlocked if this whole request is granted immediately?

6

Jan,2006

12

State whether the following statements are true or false.

Starvation always results in deadlock.

1

Jan,2002