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!
Essential Properties of Operating System
1. Batch: Jobs with similar needs are batched together and run through the computer as a group by an operator or automatic job sequencer. Performance is increased by trying to keep I/O devices and CPU busy at all times through buffering, off line operation, spooling and multiprogramming. A Batch system is decent for executing large jobs which need little interaction, it can be submitted as well as picked up latter.
2. Time sharing: Uses CPU s scheduling and multiprogramming to provide economical interactive use of a system. CPU switches rapidly from one user to another it implies that CPU is shared between some interactive users. Rather than having a job defined by spooled card images, every program reads its subsequent control instructions from the terminal and output is typically printed immediately on the screen.
3. Interactive: User is on line with computer system and interacts with it by an interface. It is normally composed of many short transactions where result of the subsequent transaction may be unpredictable. Response time needs to be short because the user submits and waits for result.
4. Real time system: Real time systems are generally dedicated, embedded systems. They normally read from and react to sensor data. System should guarantee response to events within fixed periods of time to make sure correct performance.
5. Distributed: Distributes computation among several physical processors. The processors don't share memory or a clock. Instead each processor has its own local memory. They communicate with each other through various communication lines.
Priority Scheduling leads to the risk of starvation: a process is ready, but never is given the processor. Some preemptive priority schedulers therefore reserve a fraction of the p
Perform alpha-beta pruning on the following tree. Put an "X" over each node that is pruned. Put the final value next to all other nodes. Indicate which action MAX should take: to B
Q. Under what conditions do page faults occur? Explain the actions taken by the operating system when a page fault occurs. Answer: A page fault take places when an access to
File allocation using I nodes. This method is used to decrease the size of the table in the above method. Every file will have an I-node list. Allow a file have 15 pointers a
Define race condition. When various process access and manipulate similar data concurrently, then the outcome of the execution depends on certain order in which the access take
BEST FIT ALGORITHM Here scanning is for the finest fit one. Signifies it searches the entire list for the best fit position. For the process therefore in that the process will
Q) a. Given that the first three necessary conditions for a deadlock are in place, comment on the feasibility of the following strategy. All processes are given unique priorities.
Define deadlock. A process requests resources; if the resources are not available at that time, the process enters a wait state. Waiting processes might be never again change s
Question: A set of processes are in a deadlock state when every process in the set is waiting for an event that can be caused by only another process in the set. (a) There
explain simple segmentation
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