CONCEPT OF OPERATING SYSTEM

 Operating System Definition and Function

In the Computer System (comprises of Hardware and software), Hardware can only understand machine code (in the form of 0 and 1) which doesn't make any sense to a naive user.

We need a system that can act as an intermediary and manage all the processes and resources present in the system.


An Operating System can be defined as an interface between the user and hardware. It is responsible for the execution of all the processes, Resource Allocation, CPU management, File Management, and many other tasks.

The purpose of an operating system is to provide an environment in which a user can execute programs conveniently and efficiently.

Structure of a Computer System

A Computer System consists of:

  • Users (people who are using the computer)
  • Application Programs (Compilers, Databases, Games, Video players, Browsers, etc.)
  • System Programs (Shells, Editors, Compilers, etc.)
  • Operating System ( A special program that acts as an interface between the user and hardware )
  • Hardware ( CPU, Disks, Memory, etc)

What does an Operating system do?

  1. Process Management
  2. Process Synchronisation
  3. Memory Management
  4. CPU Scheduling
  5. File Management
  6. Security

History of OS

  • Operating systems were first developed in the late 1950s to manage tape storage.
  • The General Motors Research Lab implemented the first OS in the early 1950s for their IBM 701
  • In the mid-1960s, operating systems started to use disks
  • In the late 1960s, the first version of the Unix OS was developed
  • The first OS built by Microsoft was DOS. It was built in 1981 by purchasing the 86-DOS software from a Seattle company
  • The present-day popular OS Windows first came into existence in 1985 when a GUI was created and paired with MS-DOS.

Features of Operating System (OS)

Here is a list of important features of OS:

  • Protected and supervisor mode
  • Allows disk access and file systems Device drivers Networking Security
  • Program Execution
  • Memory management Virtual Memory Multitasking
  • Handling I/O operations
  • Manipulation of the file system
  • Error Detection and handling
  • Resource allocation
  • Information and Resource Protection

Advantages of Operating System

  • It is helpful to monitor and regulate resources.
  • It can easily operate since it has a basic graphical user interface to communicate with your device.
  • It is used to create interaction between the users and the computer application or hardware.
  • The performance of the computer system is based on the CPU.
  • The response time and throughput time of any process or program are fast.
  • It can share different resources like fax, printer, etc.
  • It also offers a forum for various types of applications like systems and web applications.

Disadvantages of the Operating System

  • It allows only a few tasks that can run at the same time.
  • If any error occurred in the operating system; the stored data can be destroyed.
  • It is a very difficult task or works for the OS to provide entire security from viruses because any threat or virus can occur at any time in a system.
  • An unknown user can easily use any system without the permission of the original user.
  • The cost of the operating system costs is very high.

Popular posts from this blog

DATA STRUCTURES-II

 UNIT – I  Tree: Header nodes, Threads, Binary search trees, Searching, Insertion and deletion in aBinary search tree , AVL search trees, Insertion and deletion in AVL search tree , m-waysearch tree, Searching, Insertion and deletion in an m-way search tree , B-trees, Searching,Insertion and deletion in a B-tree, B+tree , Huffman’s algorithm , General trees.  UNIT – II  Graphs: Warshall’s algorithm for shortest path , Dijkstra algorithm for shortest path , Operations on graphs , Traversal of graph , Topological sorting .  UNIT – III  Sorting: Internal & external sorting , Radix sort , Quick sort , Heap sort , Merge sort . Searching: Liner search, binary search, merging , Comparison of various sorting and searching algorithms on the basis of their complexity .  UNIT – IV  Files: Physical storage devices and their characteristics , Attributes of a file viz fields, records,Fixed and variable length records, Primary and secondary keys , Classification of files, File operations,
Read more

DATA STRUCTURES FOR B.TECH

DATA STRUCTURES Unit 1: Introduction :   Basic Terminologies:   C oncept of Data Structure, Choice of right Data Structure , Algorithms , how to design and develop algorithm, Complexity of algorithm.   Operations: insertion, deletion, traversal etc,   Analysis of an Algorithm. Searching:  Linear Search and Binary Search Techniques and their complexity analysis. Unit 2: Stacks  and  Queues : Stack  and  its  operations: Algorithms and their complexity analysis, Applications of Stacks: Expression       Conversion and evaluation -corresponding algorithms and complexity analysis. queue, Types of Queue: Simple  Queue, Circular Queue, Priority Queue ; Operations on each types of Queues: Algorithms and their analysis.   Unit 3 : Linked Lists:      Singly   linked  lists: Representation in memory, Algorithms of several operations:  Traversing, Searching, Insertion into, Deletion from linked list; Linked representation of Stack and Queue, Header nodes, Doubly linked list: operations on
Read more

DATA STRUCTURES FOR BCA

UNIT – I  Introduction: Elementary data organization, Data Structure definition , Data type vs. data structure , Categories of data structures, Data structure operations, Applications of data structures, Algorithms complexity and time-space tradeoff, Big-O notataion.   Strings: Introduction, Storing strings, String operations, Pattern matching algorithms.  UNIT – II  Arrays: Introduction, Linear arrays, Representation of linear array in memory, address calculations, Traversal, Insertions, Deletion in an array, Multidimensional arrays, Parallel arrays, Sparse arrays.  Linked List: Introduction, Array vs. linked list, Representation of linked lists in memory, Traversal, Insertion, Deletion, Searching in a linked list, Header linked list, Circular linked list, Two-way linked list, Threaded lists, Garbage collection, Applications of linked lists.  UNIT – III  Stack: Introduction, Array and linked representation of stacks, Operations on stacks, Applications of stacks: Polish notat
Read more