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 ...

Digital Circuits - Shift Registers

We know that one flip-flop can store one-bit of information. In order to store multiple bits of information, we require multiple flip-flops. The group of flip-flops, which are used to hold (store) the binary data is known as register . If the register is capable of shifting bits either towards right hand side or towards left hand side is known as shift register . An ‘N’ bit shift register contains ‘N’ flip-flops. Following are the four types of shift registers based on applying inputs and accessing of outputs. Serial In − Serial Out shift register Serial In − Parallel Out shift register Parallel In − Serial Out shift register Parallel In − Parallel Out shift register Serial In − Serial Out (SISO) Shift Register The shift register, which allows serial input and produces serial output is known as Serial In – Serial Out (SISO) shift register. The block diagram of 3-bit SISO shift register is shown in the following figure. This block d...

discrete mathematics: Venn Diagrams

Venn Diagrams Venn diagram, invented in 1880 by John Venn, is a schematic diagram that shows all possible logical relations between different mathematical sets. Examples Set Operations Set Operations include Set Union, Set Intersection, Set Difference, Complement of Set, and Cartesian Product. Set Union The union of sets A and B (denoted by A ∪ B A ∪ B ) is the set of elements which are in A, in B, or in both A and B. Hence, A ∪ B = { x | x ∈ A O R x ∈ B } A ∪ B = { x | x ∈ A O R x ∈ B } . Example − If A = { 10 , 11 , 12 , 13 } A = { 10 , 11 , 12 , 13 } and B = { 13 , 14 , 15 } { 13 , 14 , 15 } , then A ∪ B = { 10 , 11 , 12 , 13 , 14 , 15 } A ∪ B = { 10 , 11 , 12 , 13 , 14 , 15 } . (The common element occurs only once) Set Intersection The intersection of sets A and B (denoted by A ∩ B A ∩ B ) is the set of elements which are in both A and B. Hence, A ∩ B = { x | x ∈ A A N D...

My skill

Search This Blog