Define computer system environment, Operating System

Q. List three instances of deadlocks that aren't related to a computer system environment.

Answer:

  • Two cars passage a single-lane bridge from opposite directions.
  • A person going down a ladder even as another person is climbing up the ladder.
  • Two trains travelling toward each other on the same track.
  • Two carpenters who should pound nails. There is a single hammer as well as a single bucket of nails. Deadlock takes places if one carpenter has the hammer and the other carpenter has the nails.
Posted Date: 7/27/2013 3:56:17 AM | Location : United States







Related Discussions:- Define computer system environment, Assignment Help, Ask Question on Define computer system environment, Get Answer, Expert's Help, Define computer system environment Discussions

Write discussion on Define computer system environment
Your posts are moderated
Related Questions
Using pages makes it easier to manage the whole memory, avoiding excessive fragmentation and waste. As an analogy, think of Tetris, but with only square blocks: it is relatively ea

Q. Describes responsibilities of the I/O manager? Answer: The I/O manager is responsible for file systems and device drivers and network drivers. The I/O manager keeps follow

Define deadlock prevention. Deadlock prevention is a set of process for ensuring that at least one of the four essential conditions like mutual exclusion, hold and wait, no pr

What are the different accessing methods of a file? The different types of accessing a file are: Sequential access: Information in the file is accessed sequentially

Q. Show that a few schedules are possible under the two-phase locking protocol however not possible under the timestamp protocol and vice versa. Answer: A schedule that is auth

Scalability : Scalability is the competence of the system to adapt to increased service load. A scalable system will respond more gracefully to increased load than a non-sc

Can you please explain in easy words how input output protection works

Q. Explain the actions taken by a kernel to context switch between kernel level threads. Answer: Context switching among kernel threads classically requires saving the value

FIFO page replacement This is the easiest page replacement algorithm. Here the 1 st page toward the inside is the 1 st to leave that is the oldest page leaves. To execute th

As mentioned above, page tables, are lookup tables mapping a process' virtual pages to physical pages in RAM. How would one implement these page tables? The most straightforward