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.
What is the sequence in which resources may be utilized? Under normal mode of operation, a process may utilize a resource in the following sequence: Request: If the requ
Briefly discuss on page replacement? Page replacement approach is fixed as follows. If no frame is free, we search one that is not presently being used and free it. We can fre
What is a thread? A thread or else called a lightweight process (LWP) is a basic unit of CPU utilization, it comprises of a thread id, a program counter, a register set and a s
What are two differences among user-level threads and kernel-level threads? Under what circumstances is one type better than the other? (1) User-level threads are unknown by th
what is deadlock
Applications allocate memory in terms of the number of bytes that they need, but this level of granularity is too ?ne-grained for the operating system to manage the system memory i
Linked list allocation using index The blocks don't have a fixed size. Pointers are utilized to point to the next block in a file. The pointers are set aside as a separate tabl
The producer-consumermodel above has a standard human analogy of an assembly line. Humans have specialized skills, however, whereas threads running the same program do not need to
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
Optimal page replacement An optimal page replacement algorithm has the least page fault rate of all algorithms. The algorithm states that put back the page that will not be us
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