Skip to main content

Defination of OS(operating system) and its concepts

  What do you mean by operating system?

   Definition: An operating system is a program that act as an interface between the user of a computer and the            

                         Computer hardware. Operating system is a first program that gets loaded into the memory through a process called booting.

Concepts of operating system:

·                     The purpose of operating system is to provide an environment in which a user can execute program in a convenient and efficient manner.

·                     Operating system is an integrated set of program that manages the various hardware resources such as processor, memory, I/O Devices , communication devices and overall operation of a computer system.

·                     Operating systems also acts as a platform on which various applications programs such as word processor and excel are executed.

·                     The most common operating system are the window family of operating system (windows 98, window 2000, Nt, Vista and window 7), UNIX and Macintosh operating system.

 

*             Operating system as an extended machine.

*             operating system as resource manager .

   Operating system as an extended machine:

§   An operating system is a layer of software on the top of the bare hardware of a computer system.

§   This operating system manages the all parts of  the system, and presents to the users with an interface or virtual machine ,that is easier to program and use.

Comments

  1. Hey Guys "I Have a Hour Complete Full Detail Information About

    Operating System

    Learn in Simple and Easy.

    ReplyDelete

  2. Download Free Zorin OS Ultimate Sep-2021
    Download Now

    ReplyDelete
  3. ऑपरेटिंग सिस्टम के नाम. यहाँ मै आपके साथ पांच commons Operating System kya hai के नाम सांझा कर रहा हूं

    ReplyDelete

Post a Comment

Popular posts from this blog

Multilevel Feedback queue scheduling (MFQ)

  Multilevel Feedback queue scheduling (MFQ) ·          Multilevel feedback queue scheduling is an enhancement of multi-levelqueue scheduling. In this scheme, processes can move between the different queue ·          The various processes are separates in different queue on the basis of their CPU Burst Char characteristics ·          If a process consumes a lot of CPU time , it is placed into a lower priority queue. Thus I/O bound and interactive process are placed in the higher priority queue and CPU bound pricesses are in lower priority ·          If a processes waits too long in a lower priority queue it is moved higher priority queue. Such an aging prevents starvation. ·          The top priority queue is given smallest CPU time Quantum ·      ...

ENTERPROCESS COMMUNICATION AND SYNCHRONIZATION

      ENTERPROCESS COMMUNICATION AND SYNCHRONIZATION ·          In multi programming environment multiple process co-exit . a single   program may be broken into number of processes. ·          The process are classified into two categories : independent processes and cooperating processes. ·          An independent process is a standalone process that does not share any data with any other process. It cannot affect or be affected by the other processes executing   in the system. In other words, the modification made to an independent process does not affect the functioning of other process. ·          A cooperating processes is a process that shares data with other processes in a system it can affect or be affectedly the other processes executing in the system ·      ...

Round Robin

   Round Robin ·          Round robin Scheduling is similar to FCFS but preemption is addede to switch between processes. ·          In RR scheduling, processes are dispatched in FIFO but given a small amount of CPU time. This small amount of CPU time this small amount of time is known as time quantum or time slice. A time quantum is generally from 10 to 100 milliseconds ·          If a process does not complete before its time slice expires, the CPU is time slice and is given to the next waiting process in ready queue. ·          The preempted process in then places at the   tail of the ready queue. ·          If a process is completed before its time slice expires, the process itself release the CPU. The scheduler then proceeds to the next process in ready queue. ...

Multi Level Queue Scheduling (MLQ)

  Multi Level Queue Scheduling (MLQ) ·          Multilevel queue scheduling classifies the processes according to their types for example, a multilevel queue scheduling algorithm makes a common. ·          In this scheduling ready queue is divided into various queue that are called sub queues. A subqueue is a distinct operational queue ·          The process are permanently assigned to subqueues, generally based on some property of the process such as memory size,priority or process type ·          Each subqueue has its process sucheduling algorithm. For example interactive process at the foreground may use round robin scheduling while batch jobs at the background may use the FCFS method ·          For example, consider a system with four different queues 1.   ...

Direct Communicationand Indirect communication

  Direct Communication ·          Direct communication establishes a link between two processes. A communication link is a unidirectional path along which information flows. ·          two processes use single communication link to share information. ·          In this   metod, there cannot be more that one link between two processes                                                     direct communication ·          Send and receive function used in direct communication are given below : ·          Send(process name , message ,(receive(process name , message)             Send(A, message...