Skip to main content

Types of Operating System

An operating system is the basic mechanism behind the working of the computer systems and mobile devices and so, understanding the operating system becomes very important from a user’s perspective. The various types of Operating systems are as follows:

Types of Operating System

1. Batch Operating System

Batch Operating System

As, is very clear from the name itself, a batch operating system works by grouping the jobs into batches, hence the CPU does not directly interacts with the jobs, instead it interacts with the batches which are created by the operating system on the basis of similarities among them.

It supports multiple users and the idle time of the CPU is very less. Since, it works by grouping multiple jobs into lesser number of batches, managing a large amount of work becomes easy in a batch operating system. However, batch operating systems are costly and debugging is harder.

Example: Payroll systems, Bank statements etc.

2. Time-Sharing Operating System

Time-Sharing Operating System

In the time sharing operating systems, a certain time limit “quantum” is assigned to each one of the jobs. After the completion of one job, the other one is assigned the time. Hence, each job gets equal time in the CPU.

Often, these systems have a data communication problem, however.

Examples: Unix, Multics etc.

3. Network Operating System

Network Operating System

They too work on an interconnection model but this model comprises of a client-server like small private network.

Unlike the distributed systems which are loosely coupled, the network operating systems are tightly coupled systems. This means that all the computers connected to the centralized server know the configurations, connections etc. These connections and the network are quite stable and the different systems located at various locations can easily access the server and hence the sharing of files can be done easily. But the cost of the server and maintenance and other updates are considerably high.

Example: UNIX, Linux, Novell Netware, Microsoft Windows server 2003 etc.

4. Distributed Operating System

Distributed Operating System

The distributed operating systems, allow the interconnection of various systems all over the world using a shared communication network. We can share documents anywhere on the network.

However, all the interconnected systems are independent and hence, the failure of one won’t affect any other system in the network. The computation tasks are also fast and the load on just one computer is reduced.

Example: LOCUS.

5. Real Time Operating System

Real Time Operating System

The real time operating systems are known for their quick processing of inputs and correspondence. These systems have to work quickly because even a small delay in the response results in failure. So, they work as if working in real time and absolutely no time is required for processing.

The real time operating systems are further divided into two categories:

  • Hard Real Time Operating System

In these systems, even a small delay in time period can lead to major destructions. Hence, the response time (the time required to respond to inputs) must not exceed more than the time which is safe.

These are used in missile launching systems, automatic parachutes, etc.

  • Soft Real Time Operating System

In these systems, the time constraint is not that severe and delays in response might not lead to destruction, however, the system still is considered to be failing. These are used in software application developments like games and other software where immediate user interaction is involved.

These real time operating systems are error free and memory is allocated excellently in them, also the current running application is in focus while the others in queue are not much considered. But, they use very complex algorithms and heavy system resources.

Source: https://www.geeksforgeeks.org/operating-system-types-operating-systems-awaiting-author/

The operating system is a program on which the other software runs, and a clear understanding of them can be made through the above points.

The post Types of Operating System appeared first on The Crazy Programmer.



from The Crazy Programmer https://www.thecrazyprogrammer.com/2019/03/types-of-operating-system.html

Labels

Labels:

Comments

Post a Comment

Popular posts from this blog

dotnet sdk list and dotnet sdk latest

Can someone make .NET Core better with a simple global command? Fanie Reynders did and he did it in a simple and elegant way. I'm envious, in fact, because I spec'ed this exact thing out in a meeting a few months ago but I could have just done it like he did and I would have used fewer keystrokes! Last year when .NET Core was just getting started, there was a "DNVM" helper command that you could use to simplify dealing with multiple versions of the .NET SDK on one machine. Later, rather than 'switching global SDK versions,' switching was simplified to be handled on a folder by folder basis. That meant that if you had a project in a folder with no global.json that pinned the SDK version, your project would use the latest installed version. If you liked, you could create a global.json file and pin your project's folder to a specific version. Great, but I would constantly have to google to remember the format for the global.json file, and I'd constan...
Post a Comment
Read more

Rail Fence Cipher Program in C and C++[Encryption & Decryption]

Here you will get rail fence cipher program in C and C++ for encryption and decryption. It is a kind of transposition cipher which is also known as zigzag cipher. Below is an example. Here Key = 3. For encryption we write the message diagonally in zigzag form in a matrix having total rows = key and total columns = message length. Then read the matrix row wise horizontally to get encrypted message. Rail Fence Cipher Program in C #include<stdio.h> #include<string.h> void encryptMsg(char msg[], int key){ int msgLen = strlen(msg), i, j, k = -1, row = 0, col = 0; char railMatrix[key][msgLen]; for(i = 0; i < key; ++i) for(j = 0; j < msgLen; ++j) railMatrix[i][j] = '\n'; for(i = 0; i < msgLen; ++i){ railMatrix[row][col++] = msg[i]; if(row == 0 || row == key-1) k= k * (-1); row = row + k; } printf("\nEncrypted Message: "); for(i = 0; i < key; ++i) f...
3 comments
Read more

Data Encryption Standard (DES) Algorithm

Data Encryption Standard is a symmetric-key algorithm for the encrypting the data. It comes under block cipher algorithm which follows Feistel structure. Here is the block diagram of Data Encryption Standard. Fig1: DES Algorithm Block Diagram [Image Source: Cryptography and Network Security Principles and Practices 4 th Ed by William Stallings] Explanation for above diagram: Each character of plain text converted into binary format. Every time we take 64 bits from that and give as input to DES algorithm, then it processed through 16 rounds and then converted to cipher text. Initial Permutation: 64 bit plain text goes under initial permutation and then given to round 1. Since initial permutation step receiving 64 bits, it contains an 1×64 matrix which contains numbers from 1 to 64 but in shuffled order. After that, we arrange our original 64 bit text in the order mentioned in that matrix. [You can see the matrix in below code] After initial permutation, 64 bit text passed throug...
Post a Comment
Read more