Types of Operating System (OS)

Following are the popular types of OS (Operating System):

Batch Operating System
Multitasking/Time-Sharing OS
Multiprocessing OS
Real-Time OS
Distributed OS
Network OS
Mobile OS

Batch Operating System

Some computer processes are very lengthy and time-consuming. To speed the same process, a job with a similar type of needs is batched together and run as a group.

The user of a batch operating system never directly interacts with the computer. In this type of OS, every user prepares his or her job on an offline device like a punch card and submits it to the computer operator.

Multi-Tasking/Time-sharing Operating systems

The time-sharing operating system enables people located at a different terminal(shell) to use a single computer system at the same time. The processor time (CPU) which is shared among multiple users is termed as time-sharing.

Real-time OS

A real-time operating system time interval to process and respond to inputs is very small. Examples: Military Software Systems, Space Software Systems are the Real-time OS example.

Distributed Operating System

Distributed systems use many processors located in different machines to provide very fast computation to their users.

Network Operating System

Network Operating System runs on a server. It provides the capability to serve to manage data, users, groups, security, application, and other networking functions.

Mobile OS

Mobile operating systems are those OS that is especially that are designed to power smartphones, tablets, and wearables devices.

Some most famous mobile operating systems are Android and iOS, but others include BlackBerry, Web, and watchOS.

Comments

Discrete Mathematics - Rules of Inference

To deduce new statements from the statements whose truth that we already know, Rules of Inference are used. What are Rules of Inference for? Mathematical logic is often used for logical proofs. Proofs are valid arguments that determine the truth values of mathematical statements. An argument is a sequence of statements. The last statement is the conclusion and all its preceding statements are called premises (or hypothesis). The symbol “ ∴ ∴ ”, (read therefore) is placed before the conclusion. A valid argument is one where the conclusion follows from the truth values of the premises. Rules of Inference provide the templates or guidelines for constructing valid arguments from the statements that we already have. Table of Rules of Inference Rule of Inference Name Rule of Inference Name P ∴ P ∨ Q P ∴ P ∨ Q Addition P ∨ Q ¬ P ∴ Q P ∨ Q ¬ P ∴ Q Disjunctive Syllogism P Q ∴ P ∧ Q P Q ∴ P ∧ Q Conjunction P → Q Q → R ∴ P → R P → Q Q → R ∴ P → R ...

5 best private search engines and why you need to use them.

5 best private search engines and why you need to use them By: Boniyeamin laju ▪ May 31, 2019 ▪ 3 minute read 5 best private search engines and why you need to use Normal browsers like Google and Bing are designed to track users’ activities and profile their online behavior. The primary reason for this is to create advertisements that will be attractive to the user. However, there-there is always the concern of personal information being compromised due to security breaches, state surveillance, and unauthorized data sharing. Fortunately, private search engines can help keep your private information safe. Simply put, Private Search Engines, also known as PSE, uses proxy and encrypted search request to hide your personal information from anyone looking to misuse your information. Below you will find more information about what a PSE is, how it works, and wh...

Discrete Mathematics - Propositional Logic

The rules of mathematical logic specify methods of reasoning mathematical statements. Greek philosopher, Aristotle, was the pioneer of logical reasoning. Logical reasoning provides the theoretical base for many areas of mathematics and consequently computer science. It has many practical applications in computer science like design of computing machines, artificial intelligence, definition of data structures for programming languages etc. Propositional Logic is concerned with statements to which the truth values, “true” and “false”, can be assigned. The purpose is to analyze these statements either individually or in a composite manner. Prepositional Logic – Definition A proposition is a collection of declarative statements that has either a truth value "true” or a truth value "false". A propositional consists of propositional variables and connectives. We denote the propositional variables by capital letters (A, B, etc). The connectives connect the propositi...

My skill

Search This Blog