memory management, Operating System

4. Describe priority scheduling algorithm. Consider the following set of processes. Show the order in which the algorithm will schedule these processes. Assume preemptive and non-preemptive scheduling
Process Name Arrival time Processing time Priority assigned
Process Arrival Processing Priority
Name time time assigned
1 0 5 3
2 2 3 5
3 5 8 1
4 9 2 6
5 12 5 4
Posted Date: 7/3/2012 12:15:34 PM | Location : United States







Related Discussions:- memory management, Assignment Help, Ask Question on memory management, Get Answer, Expert's Help, memory management Discussions

Write discussion on memory management
Your posts are moderated
Related Questions
EXAMPLE FOR SEGMENTATION Consider an instance as given in the table and we have five segments numbered from 0 through 4 the segment is stock in the physical memory as shown. Th

Q. If magnetic hard disks eventually have the same cost per gigabyte as do tapes will tapes turn into obsolete or will they still be needed? Describe your answer. Answer: Tap

When do we write a page from physical memory back to the disk? In general, caches have two broad types of writing policies. One approach is a write-through cache. In this case,

linked allocation using i node

Define the WindowsNT WindowsNT provides a two-level approach to resource management: process and thread. The process is the uppermost level and contains most of the application

Write a short note on file organization and access. There are three methods to access files 1Record Access 2Sequential Access 3Random Access The record access

describe main points of multiuser and multi tasking operating systems.

OPERATING SYSTEM 1. Describe the term operating system. Write down the functions of operating system. 2. Explain Thread? Write down the advantages and disadvantages of threa

Problem 1: (a) What are the likely benefits which an organisation may derive from the planning process? (b) Explain the main reasons why an organisation may fail to plan.