Explain time sharing operating system, Computer Engineering

Assignment Help:

Explain Time sharing operating system.

Time sharing: It is also called as multi tasking, is a logical execution of multiprogramming. Multiple jobs are executed through the CPU switching among them. Now there the computer system gives on line communication in between the user and the system.

Now there the CPU is never idle. Time shared operating system permits many users to share the computer concurrently.

Time sharing systems needs some sort of memory protection and management.

Related Discussions:- Explain time sharing operating system

Way to interconnect multiple computer across short distance, A computer com...

A computer communication technology that gives a way to interconnect multiple computer across short distance is LAN

Write a verilog code to swap contents of two registers, Write a verilog ...

Write a verilog code to swap contents of two registers with and without a temporary register? With temp reg : always @ (posedge clock) begin temp=b; b

Explain branch instruction with control signals, Explain BRANCH instruction...

Explain BRANCH instruction with Control Signals. and explain SHIFT instruction with Control Signals. Explain Register Transfer Language. What do you mean by Addressing Techn

Finest way to get a reference to the viewport, What is finest way to get a ...

What is finest way to get a reference to the viewport from anywhere in the code? Ans) You can use refs config to set a reference on the Application/Controllers

Explain the methods of implementing interacting processes, Explain any two ...

Explain any two methods of implementing interacting processes. Two methods of implementing interacting process are given below: (i) Shared memory solution: In this scheme

What is the disadvantage of strobe method, What is the disadvantage of st...

What is the disadvantage of strobe method. The drawbacks of strobe method are that the source unit that show the transfer has no way of knowing whether the destination unit h

Dynamic hashing, how can i explain dynamic hashing

how can i explain dynamic hashing

Queue, A Queue is a FIFO (rst in, rst out) data structure. Given the foll...

A Queue is a FIFO (rst in, rst out) data structure. Given the following queue interface: public interface Queue { int size(); // current queue size boolean isEmpty(); //

Meaning of all variable, A project having of a set of jobs and a set of pre...

A project having of a set of jobs and a set of precedences, where precedence (i; j) show that job j cannot begin before job i is completed. Let c i be the duration of job i. We wi

#software engineering, Explain software process model in brief.

Explain software process model in brief.

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages