Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
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.
Q. What are the tradeoffs concerned in rereading code pages from the file system versus using swap space to store them? Answer: If codes pages are accumulate in swap space th
Q. Catalogue the design goals of Windows XP. Answer: Design goals comprise security and reliability and Windows and POSIX application compatibility with high performance and ex
How is it different from the unbounded buffer algorithm ? Explain.
UNIX Shell and History feature. 1.Creating a child process. 2.Creating a history feature. Its exactly "programming project 1 - Unix Shell and History Feature (p.157-159)" in the Si
What are Tree-structured directories We can generalize the directory structure to a tree of arbitrary height. This permits the user to create their own sub directories and to c
Q. Presume that a scheduling algorithm at the level of short-term CPU scheduling favours those processes that have used the least processor time in the recent past. Why this algori
Explain with an example the need of Shift Alteration in critical section problem? Consider processes P i and P j and consider the algorithm for P i and P j .
Mention some attractive properties of semaphore? The Semaphores aren't provided by hardware. However they have numerous attractive properties: Machine indep
The optimal replacement policy, called OPT, is to evict the page which will be accessed farthest into the future. Since we can't predict the future precisely, we can't implement OP
NEXT FIT ALGORITHM Here scanning starts from the first fit position and then it finds the next position which is large sufficient to hold the process. Thus the name next fit.
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!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd