Date: 22-11-2023 AIM 2.

Operating System by Abhishek Sachan Sir

An Operating System (OS) is a program which acts as an interface between the user and the
computer hardware. It is a program that must be on any computer for proper booting. OS is a
software that manages the computer hardware as well as providing an environment for
application programs to run.
Examples: Windows, MacOS, LINUX, UNIX, etc.

Objectives of OS

1. To make the computer system convenient and easy to use for the user.
2. To use the computer hardware in an efficient way.
3. To execute user program and make solving user problems easier.
4. Process management/ Memory management/ File management/ Device management.

Four Components of Computer:

1. Hardware
2. Operating System
3. Application program/ software
4. Users

[Date] 1
Date: 22-11-2023 AIM 2.0

Parts of Operating System

1. Kernel: A kernel is the core component of an operating system. It acts as a bridge

between applications and the data processing performed at the hardware level using
inter-process communication and system calls. The kernel is the main interface
between the computer’s physical hardware and the processes running on it. It enables
multiple applications to share hardware resources by providing access to CPU,
memory, disk I/O, and networking.
The kernel loads first into memory when an operating system is loaded and remains in
memory until the operating system is shut down again. It is responsible for various
tasks such as disk management, task management, and memory management

2. Shell: A shell in an operating system is a computer program that exposes the

operating system’s services to a human user or other programs.
 It is the outermost layer of the operating system.

[Date] 2
Date: 22-11-2023 AIM 2.0

 Shells use either a command-line interface (CLI) or a graphical user interface

(GUI) to control processes and files, as well as to start and control other programs.
 The shell also manages the interaction between the system and the user by taking
user input, evaluating it, and eventually dealing with the output.
 Shell is also called as command Interpreter.

HISTORY OF OPERATING SYSTEM

 First machine having ability to store OS: IBM System/360.
 First OS: Multics
 UNIX: Ken Thompson, Dennis Ritchie (also the father of C language)
 LINUX: Linus Torvalds
 Macintosh: First GUI OS
 IBM: DOS/ PC – DOS (1981)
 Later Microsoft bought DOS from IBM and rebranded it as MS – DOS (in 1983)
 CLI: Command Line Interface
 CUI: Character User Interface
 GUI: Graphical User Interface
 DOS: Disk Operating System
 First Company to create a GUI: Xerox

[Date] 3
Date: 22-11-2023 AIM 2.0

History Of Microsoft Operating Systems That Are “Gui”

Based
1. Microsoft Windows 1.0
2. Microsoft Windows 2.0
3. Microsoft Windows 3.0
4. Microsoft Windows – 95
5. Microsoft Windows – 98
6. MS Windows – 2000 (Millennium Edition) (ME)
7. MS Windows – XP (Experience/ Expert Programming)
8. MS Windows Vista
9. MS Windows 7
10. MS Windows 8.1
11. MS Windows 10
12. MS Windows 11

Functions of OS
1. Processor management
2. Act as a resource manager
3. Memory management
4. File management
a. FAT: File allocation table
b. NTFS: New technology file system
 Encryption/ Decryption feature
5. Security
 Firewall and Antivirus
6. Device management
7. Input/ output devices
 Device driver management by OS
8. Deadlock prevention
 System Hang or Blue Screen of Death Prevention
9. Time management
 Fast Processing by system to minimize processing time
10. Coordinates with system software and hardware

[Date] 4
Date: 22-11-2023 AIM 2.0

Types of Operating System

1. Batch Processing Operating System (1980s)

This type of operating system does not interact with the computer directly. There is an
operator which takes similar jobs having the same requirement and groups them into
batches. It is the responsibility of the operator to sort jobs with similar needs.

Advantages of Batch Operating System

 Multiple users can share the batch systems.
 The idle time for the batch system is very less.
 It is easy to manage large work repeatedly in batch systems.
Disadvantages of Batch Operating System
 The computer operators should be well known with batch systems.
 Batch systems are hard to debug.
 It is sometimes costly.
 The other jobs will have to wait for an unknown time if any job fails.
Examples of Batch Operating Systems : Payroll Systems, Bank Statements, NEFT,
etc.

2. Multiprogramming Operating System

Multiprogramming Operating Systems can be simply illustrated as more than one program
is present in the main memory and any one of them can be kept in execution. This is
basically used for better execution of resources.

[Date] 5
Date: 22-11-2023 AIM 2.0

Advantages of Multi-Programming Operating System

 Multi Programming increases the Throughput of the System.
 It helps in reducing the response time.
Disadvantages of Multi-Programming Operating System
 There is not any facility for user interaction of system resources with the system.

3. Multitasking Operating System/ Time Sharing OS

Multitasking refers to execution of multiple tasks (say processes, programs, threads etc.) at
a time. Multitasking is a logical extension of multi programming. The major way in which
multitasking differs from multi programming is that multi programming works solely on
the concept of context switching whereas multitasking is based on time sharing alongside
the concept of context switching.
Multi-tasking system’s working –
 In a time-sharing system, each process is assigned some specific quantum of
time for which a process is meant to execute. Say there are 4 processes P1, P2,
P3, P4 ready to execute. So, each of them is assigned some time quantum for
which they will execute.
 Thus, the CPU makes the processes to share time slices between them and
execute accordingly. As soon as time quantum of one process expires, another
process begins its execution.
 Here also basically a context switch is occurring but it is occurring so fast that
the user is able to interact with each program separately while it is running. This
way, the user is given the illusion that multiple processes/ tasks are executing
simultaneously. But actually, only one process/ task is executing at a particular
instant of time. In multitasking, time sharing is best manifested because each
running process takes only a fair quantum of the CPU time.

[Date] 6
Date: 22-11-2023 AIM 2.0

There are two types of Multi-Tasking Systems which are listed below.

1. Pre-emptive Multi-Tasking
2. Cooperative Multi-Tasking

4. Multiprocessing Operating System

Multi-Processing Operating System is a type of Operating System in which more than one
CPU is used for the execution of resources. It betters the throughput of the System.

Multiprocessing

Advantages of Multi-Processing Operating System

 It increases the throughput of the system.
 As it has several processors, so, if one processor fails, we can proceed with
another processor.

[Date] 7
Date: 22-11-2023 AIM 2.0

Disadvantages of Multi-Processing Operating System

 Due to the multiple CPU, it can be more complex and somehow difficult to
understand.

Single CPU: Batch processing, Multiprogramming, Multitasking

More than one CPU: Multiprocessing

5. Real Time Operating System (RTOS)

Real-Time Operating Systems (RTOS) are specialized systems designed for environments
that need to process a large number of events, mostly external, within strict time
constraints. These systems are commonly used in industrial control, telephone switching,
flight control, and real-time simulations. The processing time in an RTOS is typically
measured in tenths of seconds, and the system operates within a fixed deadline. If the
processing doesn’t occur within these specified constraints, it can lead to system failure.
Examples of RTOS include airline traffic control systems, Command Control Systems,
airline reservation systems, heart pacemakers, Network Multimedia Systems, and robots.
The various examples of Real-time operating systems are:
o MTS
o Lynx
o QNX
o VxWorks etc.

Advantages of RTOS
 Fast Processing
 Fixed time
Example – RTGS (Real time gross settlement), IMPS (Immediate payment Service)

[Date] 8
Date: 22-11-2023 AIM 2.0

Types of Real Time Operating System

1. Hard RTOS: These operating systems guarantee that critical tasks are completed within
a range of time.
For example, a robot is hired to weld a car body. If the robot welds too early or too late,
the car cannot be sold, so it is a hard real-time system that requires complete car welding
by the robot hardly on time., scientific experiments, medical imaging systems, industrial
control systems, weapon systems, robots, air traffic control systems, etc.

2. Soft RTOS: Soft RTOS accepts a few delays via the means of the Operating system. In this kind
of RTOS, there may be a closing date assigned for a particular job, but a delay for a small amount
of time is acceptable. So, cut off dates are treated softly via means of this kind of RTOS.
For Example, this type of system is used in Online Transaction systems and Livestock
price quotation Systems. Like ATMs, Ticket Booking, Reservation System, etc.
3. Firm RTOS: RTOS of this type have to follow deadlines as well. In spite of its small
impact, missing a deadline can have unintended consequences, including a reduction in
the quality of the product. Example: Multimedia applications.
For Example, this system is used in various forms of Multimedia applications.

4. Deterministic Real-time operating System: Consistency is the main key in this type of
real-time operating system. It ensures that all the task and processes execute with
predictable timing all the time, which make it more suitable for applications in which
timing accuracy is very important. Examples: INTEGRITY, PikeOS.

[Date] 9
Date: 22-11-2023 AIM 2.0

Advantages of Real-time operating system:

The benefits of real-time operating system are as follows-:

o Easy to layout, develop and execute real-time applications under the real-time
operating system.
o The real-time working structures are extra compact, so those structures require much
less memory space.
o In a Real-time operating system, the maximum utilization of devices and systems.

o Focus on running applications and less importance to applications that are in the
queue.
o Since the size of programs is small, RTOS can also be embedded systems like in
transport and others.
o These types of systems are error-free.

o Memory allocation is best managed in these types of systems.

Disadvantages of Real-time operating system:

The disadvantages of real-time operating systems are as follows-

o Real-time operating systems have complicated layout principles and are very costly to
develop.
o Real-time operating systems are very complex and can consume critical CPU cycles.

CPU Scheduling

1. CPU Utilization: Keep the CPU as busy as possible.

2. Turnaround time: Amount of time to execute a particular process.

Turnaround time = Completion time – Arrival Time

3. Burst Time: Burst time is the total time takes by the process for its execution on the
CPU.
4. Arrival Time: Arrival time is the time when a process enters into the ready sate and
is ready for its execution.

[Date] 10
Date: 22-11-2023 AIM 2.0

5. Exit time: Exit time is the time when a process completes its execution and exit from
the system.
6. Waiting time: It is the time when a process is in the memory waiting to be executed
by the CPU.

Waiting Time = Turnaround time – Burst time

7. Response Time: Response time is the time spent when the process is in the ready
state and gets the CPU for the first time.
8. Throughput: Throughput is a way to find the efficiency of a CPU. It can be defined
as the number of processes executed by the CPU in a given amount of time.

Types of Scheduling

1. Non-Preemptive Scheduling: In this algorithm, if a new process of higher

priority than the currently running process arrives, then the currently executing
process is not disturbed. Rather, the newly arrived process is put at the head of the
ready queue, i.e., according to its priority in the queue. And when the execution of the
currently running process is complete, the newly arrived process will be given the
CPU.

Advantages

a. It provides a low scheduling overhead.

b. It is a very simple method.
c. It uses less computational resources.
d. It offers high throughput.

Disadvantages

a. It has a poor response time for the process.

b. A machine can freeze up due to bugs.

[Date] 11
Date: 22-11-2023 AIM 2.0

2. Preemitive Scheduling: Preemptive scheduling is a method that may be used

when a process switches from a running state to a ready state or from a waiting state
to a ready state. The resources are assigned to the process for a particular time and
then removed. If the resources still have the remaining CPU burst time, the process is
placed back in the ready queue. The process remains in the ready queue until it is
given a chance to execute again.
When a high-priority process comes in the ready queue, it doesn't have to wait for the
running process to finish its burst time. However, the running process is interrupted in
the middle of its execution and placed in the ready queue until the high-priority
process uses the resources. As a result, each process gets some CPU time in the ready
queue. It improves the overhead of switching a process from running to ready state
and vice versa, increasing Preemptive scheduling flexibility.

Advantages
a. It is a more robust method because a process may not monopolize the processor.
b. Each event causes an interruption in the execution of ongoing tasks.
c. It improves the average response time.
d. It is more beneficial when you use this method in a multi-programming environment.
e. The operating system ensures that all running processes use the same amount of CPU.

Disadvantages
a. It requires the use of limited computational resources.
b. It takes more time suspending the executing process, switching the context, and
dispatching the new incoming process.
c. If several high-priority processes arrive at the same time, the low-priority process
would have to wait longer.

Preemptive Scheduling Non-Preemptive Scheduling

The resources are assigned to a Once resources are assigned to a process, they are
process for a long time period. held until it completes its burst period or changes
to the waiting state.

[Date] 12
Date: 22-11-2023 AIM 2.0

Its process may be paused in the When the processor starts the process execution, it
middle of the execution. must complete it before executing the other
process, and it may not be interrupted in the
middle.

When a high-priority process When a high burst time process uses a CPU,
continuously comes in the ready another process with a shorter burst time can
queue, a low-priority process can starve.
starve.

It is flexible. It is rigid.

It is cost associated. It does not cost associated.

It has overheads associated with It doesn't have overhead.

process scheduling.

It affects the design of the It doesn't affect the design of the OS kernel.
operating system kernel.

Its CPU utilization is very high. Its CPU utilization is very low.

Examples: Round Robin and FCFS and SJF are examples of non-Preemptive
Shortest Remaining Time First scheduling.

Scheduling Algorithm

1. FCFS (First Come First Serve) : Mode: Non-Pre-emptive

FCFS considered to be the simplest of all operating system scheduling algorithms. First
come first serve scheduling algorithm states that the process that requests the CPU first is
allocated the CPU first and is implemented by using FIFO queue.

[Date] 13
Date: 22-11-2023 AIM 2.0

Characteristics of FCFS:
 FCFS supports non-Preemptive and Preemptive CPU scheduling algorithms.
 Tasks are always executed on a First-come, First-serve concept.
 FCFS is easy to implement and use.
 This algorithm is not much efficient in performance, and the wait time is quite
high.

Advantages of FCFS:
 Easy to implement
 First come, first serve method

Disadvantages of FCFS:
 FCFS suffers from Convoy effect.
 The average waiting time is much higher than the other algorithms.
 FCFS is very simple and easy to implement and hence not much efficient.

2. Shortest Job First (SJF): Mode: Non-Pre-emptive

Shortest job first (SJF) is a scheduling process that selects the waiting process with the
smallest execution time to execute next. This scheduling method may or may not be
Preemptive. Significantly reduces the average waiting time for other processes waiting to
be executed. The full form of SJF is Shortest Job First.

Characteristics of SJF:
 Shortest Job first has the advantage of having a minimum average waiting time
among all operating system scheduling algorithms.
 It is associated with each task as a unit of time to complete.
 It may cause starvation if shorter processes keep coming. This problem can be solved
using the concept of ageing.

[Date] 14
Date: 22-11-2023 AIM 2.0

Advantages of Shortest Job first:

 As SJF reduces the average waiting time thus, it is better than the first come first
serve scheduling algorithm.
 SJF is generally used for long term scheduling

Disadvantages of SJF:
 One of the demerits SJF has is starvation.
 Many times, it becomes complicated to predict the length of the upcoming CPU
request

3. Round Robin
Round Robin is a CPU scheduling algorithm where each process is cyclically assigned a
fixed time slot. It is the Preemptive version of First come First Serve CPU Scheduling
algorithm. Round Robin CPU Algorithm generally focuses on Time Sharing technique.
Each process gets a small unit of CPU time (time quantum), usually 10-100 milliseconds.
After this time has elapsed, the process is pre-empted and added to the end of the ready
queue.
Timer interrupts every quantum to schedule next process.

Spooling

Spooling is a process in which data is temporarily held to be used and executed by a device,
program, or system. Data is sent to and stored in memory or other volatile storage until the
program or computer requests it for execution.

SPOOL is an acronym for simultaneous peripheral operations online. Generally, the spool
is maintained on the computer's physical memory, buffers, or the I/O device-specific
interrupts. The spool is processed in ascending order, working based on a FIFO (first-in, first-
out) algorithm

[Date] 15
Date: 22-11-2023 AIM 2.0

Note: The older MS-DOS FAT file system supports a maximum of 8 characters for the base
file name and 3 characters for the extension, for a total of 12 characters including the dot
separator. This commonly known as an 8.3 file name. So, the naming convention in DOS was
8.3

Wildcard characters

Two types of Wildcard characters in DOS are:

1. Asterisk(*) – It shows many letters.

2. Question Mark (?) – It shows only one character.

Note: To show combination of characters we use “Wildcard characters”.

[Date] 16
Date: 22-11-2023 AIM 2.0

Points to remember

1. First screen displays after starting of computer is called “Desktop”

2. Shortcut key of Desktop is Winkey + D
3. Task Manager shortcut key – Ctrl + Alt + Del.
4. File/ Folders always appears in the form of “Icons” in GUI.
5. Icons operated by “Mouse”.
6. Mouse was invented by: Doughlas Engelbart.
7. Father of GUI: Steve Jobs.
8. FAT stands for “File Allocation Table”.
9. NTFS stands for “New Technology File System”.
10. Drivers are internal part of Operating System.
11. New folder shortcut key is Ctrl + Shift + N.

[Date] 17
Date: 22-11-2023 AIM 2.0

[Date] 18
Date: 22-11-2023 AIM 2.0

[Date] 19
Date: 22-11-2023 AIM 2.0

[Date] 20