Aman malviya
Operating System
And its types
01
Content
What is Operating System & its Purpose
Types of OS and Their function
GUI,Process,Thread and Kernal
Deadlock,Spooling ,Virtual Memory and Cache
Types of Scheduling Algorithms
Operating System?
Operating System?
Operating System (OS) is basically a software program that manages and handles all
resources of a computer such as hardware and software. The first OS was introduced
in the early 1950s known as GMOs. An OS is responsible for managing, handling, and
coordinating overall activities and sharing of computer resources. It acts as an
intermediary among users of computer and computer hardware
Purpose of OS
Operating System?
Operating System (OS) is basically a software program that manages and handles all
resources of a computer such as hardware and software. The first OS was introduced
in the early 1950s known as GMOs. An OS is responsible for managing, handling, and
coordinating overall activities and sharing of computer resources. It acts as an
intermediary among users of computer and computer hardware
Purpose of OS
Process management
Resource Management
Memory management
Security
File management
Types of OS
Batch OS
Time Sharing OS
Distributed OS
Network OS
RealTime OS
Graphic User Interface
It is a visual representation of communication
presented to the user for easy interaction with
the machine. The actions in a GUI are usually
performed through direct manipulation of
graphical elements like buttons and icons
A process is the execution of a
program that allows you to perform
Process and the appropriate actions specified in
a program.
Thread Thread is an execution unit that is
part of a process. A process can have
multiple threads, all executing at the
same time.
It is a system program that provides
interface between user and
computer. When computer boots up
Kernal and Operating System is the first
program that loads.
OS A kernel is the core component of an
operating system. It is also a system
program. It is the part of Operating
System which converts user
commands into machine language
Multi-tasking is the logical extension
of multiprogramming. In this
system, the CPU executes multiple
jobs by switching among them
typically using a small time
quantum, and these switches occur
Multitasking and so frequently that the users can
interact with each program while it
Multiprocessing is running.
Multiprocessing is a system that has
two or more than two processors. In
this, CPUs are added for increasing
computing speed of the system.
Because of Multiprocessing, there
are many processes that are
executed simultaneously
Deadlock Spooling
Deadlock is a situation where a set Spooling simply stands for
of processes are blocked because Simultaneous peripheral
each process is holding a resource operations online. It is referred to
and waiting for another resource as putting data of various I/O jobs
acquired by some other process in a buffer
Virtual Memory Cache
Virtual Memory is a storage Cache memory is a chip-based
scheme that provides user an computer component that makes
illusion of having a very big main retrieving data from the
memory. This is done by treating a computer's memory more efficient
part of secondary memory as the
main memory
Types of Scheduling Algorithms
1.First Come FCFS considered to be the simplest of all
operating system scheduling algorithms.
First come first serve scheduling algorithm
First Serve (FCFS) states that the process that requests the CPU
first is allocated the CPU first and is
implemented by using FIFO queue.
Shortest job first (SJF) is a scheduling process
2.Shortest Job that selects the waiting process with the smallest
execution time to execute next. This scheduling
First (SJF) 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
3. Longest Job Longest Job First(LJF) scheduling process is just
opposite of shortest job first (SJF), as the name
suggests this algorithm is based upon the fact
First(LJF) that the process with the largest burst time is
processed first. Longest Job First is non-
preemptive in nature.
4. Priority Preemptive Priority CPU Scheduling Algorithm is
a pre-emptive method of CPU scheduling
algorithm that works based on the priority of a
Scheduling process. In this algorithm, the editor sets the
functions to be as important, meaning that the
most important process must be done first
5. Round Round Robin is a CPU scheduling algorithm
where each process is cyclically assigned a fixed
time slot. It is the preemptive version of First
Robin Algorithm come First Serve CPU Scheduling algorithm.
Round Robin CPU Algorithm generally focuses on
Time Sharing technique.
QUIZ TIME
1.Which of the following is not
considered as an OS?
Windows XP Fedora
Linux MacOS
1.Which of the following is not
considered as an OS?
Windows XP Fedora
Linux MacOS
2.What is the use of a banker's
algorithm?
Rectify deadlock Solve deadlock
Prevent deadlock None of the above
2.What is the use of a banker's
algorithm?
Rectify deadlock Solve deadlock
Prevent deadlock None of the above
3._ is not an approach to Handling
Deadlock
Virtual Memory Deadlock Avoidance
Deadlock Prevention Detect and recover
3._ is not an approach to Handling
Deadlock
Virtual Memory Deadlock Avoidance
Deadlock Prevention Detect and recover
4. Which of the following scheduling
algorithms is preemptive scheduling?
FCFS Scheduling Network Scheduling
SJF Scheduling SRTF Scheduling
4. Which of the following scheduling
algorithms is preemptive scheduling?
FCFS Scheduling Network Scheduling
SJF Scheduling SRTF Scheduling
5. Which of the following statement is correct
about fragmentation ?
It is software that connects the OS.
It is part of the software.
Loss the memory
All of the above
5. Which of the following statement is correct
about fragmentation ?
It is software that connects the OS.
It is part of the software.
Loss the memory
All of the above
import React from 'react';
function ThankYou() {
return (
<div>
<h1>Thank you!</h1>
<p>Thanks for Attending.</p>
</div>
);
}
export default ThankYou;
