Steps to run a program on a completely dedicated machine, Operating System

Q. List the four steps that are essential to run a program on a completely dedicated machine.

Answer:

a) Reserve machine time

b) Manually load program into memory

c) Load starting address and begin execution

d) Monitor as well as control execution of program from console

Posted Date: 7/27/2013 1:43:26 AM | Location : United States







Related Discussions:- Steps to run a program on a completely dedicated machine, Assignment Help, Ask Question on Steps to run a program on a completely dedicated machine, Get Answer, Expert's Help, Steps to run a program on a completely dedicated machine Discussions

Write discussion on Steps to run a program on a completely dedicated machine
Your posts are moderated
Related Questions
Can a direct access file be read sequentially? Explain. Yes. Keep a counter, cp, initially set to 0. After reading record cp, increment cp.

Banker's Algorithm In this analogy Customers ≡ processes Units ≡ resources, say, tape drive Ba

What is parsing Parsing is the procedure of analyzing a text, made of a sequence of tokens, to define its grammatical structure regarding to a given formal grammar. Parsing is

To explore the UNIX file system, use basic UNIX commands and use a text editor. Task:   1.      Logon to Linux. 2.      Create a directory "Unix" under your home d

Write a brief note on demand paging. A demand paging is alike to a paging system with swapping. The Processes reside on the secondary memory while we want to implement a proces

Define thread cancellation & target thread. The thread cancellation is the task of terminating a thread before it has completed. A thread that is to be cancelled is often refer

DESIGN GOALS OF WINDOWS XP.DESCRIBE IN DETAIL.

Define Name of some language processors?   Name of some language processors are as follow: Assembler, Compiler and Interpreter

Q. How would utilize of a RAM disk affect your selection of a disk-scheduling algorithm? What factors would you require to consider? Do the similar considerations apply to hard-di

Since most of the programs require a lot of memory allocation/deallocation, we expect the memory management to be fast, to have low fragmentation, make good use of locality, and be