Differences between foreground and background, Operating System

Assignment Help:

Describe the differences between foreground and background processing. What advantage does background processing provide?

1. Background processes typically run with little or no user interaction, they interact with the system instead. Foreground processes are what the user interacts with.

2. Background processes, unless explicitly ran so, run with non-admin permissions.

This is also called batch processing.

3. A foreground process has access to the terminal (standard input and output), while the background process does not.

4. A background process runs without being connected to your keyboard. If the background process requires any keyboard input, it waits.

The basic advantage of background processing is that it allows the system to run other commands; the processor does not have to wait until it completes one task to start another. This provides the ability to have multiple applications executing at the same time. For example, a user can play a game with one application while another application is playing a song. To the developer, the advantage of multitasking gives the ability to create tools and applications which use more than one process and to create processes that use multiple threads of execution.


Related Discussions:- Differences between foreground and background

Determine a parser which is a variant of top-down parsing, Determine a pars...

Determine a parser which is a variant of top-down parsing without backtracking Recursive Descend parser is a variant of top-down parsing without backtracking.

DOS, Ask question #Minimum 500 words accepted#

Ask question #Minimum 500 words accepted#

Explain the concept of mutual exclusion, Question 1: (a) Discuss about...

Question 1: (a) Discuss about the evolution of operating systems from mainframe batch systems to mainframe time sharing systems. (b) Explain your understanding of the "sus

How can deadlocks be represented?, How can deadlocks be represented? D...

How can deadlocks be represented? Deadlocks are able to be described in terms of a directed graph called as a system resource-allocation graph. This graph contains of the foll

Operating system.., What is the use of FIFOs in client-server applications

What is the use of FIFOs in client-server applications

Prolog application, 1. Problem Domain You will be considering the Wumpus ...

1. Problem Domain You will be considering the Wumpus world introduced in Russell and Norvig (2009) Chapter 7. For this programming assignment you'll use Prolog's ability to do in

Why we need to use a while statement when using wait method, Q. The wait()...

Q. The wait() statement in every Java program examples was part of a while loop. Describe why you would always need to use a while statement when using wait() and why you would ne

Obelia, what do obelia eat and how do they feed

what do obelia eat and how do they feed

How can the index blocks be implemented, How can the index blocks be implem...

How can the index blocks be implemented in the indexed allocation scheme? The index block can be implemented as follows a. Multilevel scheme b. Linked scheme c. Combin

What inference does recovery in distributed systems, Q. Consider a distrib...

Q. Consider a distributed system with two sites A and B. Consider whether site A can distinguish among the following: a. B goes down. b. The link between A and B goes down.

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd