0
Want this question answered?
Be notified when an answer is posted
Add your answer:
Earn +20 pts
Which OS is used only on apple macintoch computers?
Mac OS X is the OS used on Apple's Macintosh computers.
Which OS is only used on apple Macintosh computers?
Mac OS X (ten)
Which OS is only used on apple Macintosh?
Apple's Mac OS X is legally only used on Apple Macintosh computers.
Can Mac os be used on window pcs?
Apple's Mac OS X can legally only be used on a computer made by Apple.
What os is used for droidx 1?
Originally the "Droid X" used Android OS 2.1 (Eclair) however now it's been upgraded to use Android 2.3 (Gingerbread) OS.
Does Mac OS X have a Registry?
No, the Registry is a feature of Microsoft Windows only. Neither the original Mac OS or the newer Mac OS X have ever used a Registry, Mac OS X is based on Unix which has never used a Registry.
What does a os do?
Computer Os = "Computer Operating System" It contains files that are used to run a computer......
What is a iphone1?
iphone is one of the product of the apple company. its brifly defined as os used in this are i os .
What is a single-user OS used for?
It's used for stuff.
Technology used for Cosmetologist?
how OS technology used in cosmetologist
Briefly define FCFS scheduling?
First-Come, First-Serve (FCFS) scheduling is one of the simplest scheduling algorithms in the realm of operating systems, and its implementation offers a straightforward approach to process management. In FCFS scheduling, processes are executed in the order they arrive in the ready queue, essentially adhering to a first-in, first-out (FIFO) strategy. The fundamental principle behind FCFS is straightforward: the first process to request the CPU gets executed first, and subsequent processes have to wait until the CPU is available again. The mechanism of FCFS scheduling is simple to understand and implement. When a process enters the system, it gets placed in the ready queue. The CPU scheduler picks the process at the head of the queue for execution and allocates the CPU to this process. The process continues to execute until it either finishes or gets blocked for I/O or some other reason, at which point the CPU is allocated to the next process in the ready queue. This cycle continues until all processes are executed. FCFS is non-preemptive, meaning once the CPU is allocated to a process, it retains control of the CPU until it completes its execution or gets blocked for some reason. This characteristic simplifies the scheduler design, making FCFS an attractive choice for simple systems or batch processing environments where jobs are more or less independent of each other. However, FCFS scheduling has its set of drawbacks. It can lead to the "convoy effect," where short processes have to wait for a long process to complete, leading to suboptimal CPU utilization. The average waiting time under FCFS scheduling can be high if long processes arrive at the queue early. Moreover, FCFS does not prioritize processes based on their importance or urgency, which can be a significant limitation in scenarios where certain processes require immediate attention. Despite its limitations, the simplicity and ease of implementation of FCFS scheduling make it a viable choice in specific scenarios, especially in systems with minimal process management requirements or in batch processing environments. It serves as a foundation for understanding more complex scheduling algorithms and provides a clear illustration of how process scheduling works at a basic level. In a nutshell, FCFS scheduling is a fundamental, easy-to-implement scheduling algorithm that executes processes based on their arrival order, adhering to a non-preemptive, first-in, first-out strategy. While it may not be the most efficient or versatile scheduling algorithm, its simplicity makes it a useful stepping stone in the study of operating system scheduling algorithms, paving the way for understanding more advanced scheduling strategies.
Which OS is used in g-phone?
Andriod
