by Dinesh Thakur Category: Operating System

Definition: A Multi-user operating system is a computer operating system which allows multiple users to access the single system with one operating system on it. It is generally used on large mainframe computers.
Example: Linux, Unix, Windows 2000, Ubuntu, Mac OS etc.,
In the multi-user operating system, different users connected at different terminals and we can access, these users through the network as shown in the diagram.



 
by Dinesh Thakur Category: Operating System

Definition: System Software can be designed as the software in such a way so that it can control and work with computer hardware. It acts as an interface between the device and the end user.



 
by Dinesh Thakur Category: Operating System

Definition: A Scheduling Algorithm is the algorithm which tells us how much CPU time we can allocate to the processes.
These scheduling algorithms are either preemptive or non-preemptive.
Preemptive Scheduling Algorithms are those which are based on the priority of the processes. By preference, when a high priority process enters, it preempts a low priority process in between and executes the high priority process first.
Non-preemptive Scheduling Algorithms are those who can’t be preempted in between, i.e. we can not take control of CPU in between until the current process completes its execution.

 
by Dinesh Thakur Category: Operating System

Definition: Memory segmentation is the process in which we divide the primary memory of the computer into segments. It is a memory management technique. Each segment can be allocated to a process.
The segment table is the table which stores all the details about the segments which are further stored in one of the segments. Segment table contains two information about the segment: one is, the base address of the segment and other is, the length of the segment.



 
by Dinesh Thakur Category: Operating System

Definition: Priority Scheduling is a scheduling process which is based on priority. In priority scheduling, the scheduler himself chooses the task priority, and the process which has the highest priority is processed first as compared to other processes.

Example: Shortest Job First (SJF) scheduling

 
by Dinesh Thakur Category: Operating System

DefinitionPreemptive Scheduling is defined as the scheduling which is done when the process changes from running state to ready state or from waiting for the state to ready state. In this, the resources are allocated to execute the process for a certain period. After this, the process is taken away in the middle and is placed in the ready queue its bursts time is left and this process will stay in ready line until it gets its turn to execute.

 

Page 4 of 4



About Dinesh Thakur

Dinesh ThakurDinesh Thakur holds an B.SC (Computer Science), MCSE, MCDBA, CCNA, CCNP, A+, SCJP certifications. Dinesh authors the hugely popular blog. Where he writes how-to guides around Computer fundamental , computer software, Computer programming, and web apps. For any type of query or something that you think is missing, please feel free to Contact us.



Related Articles