GUI (Graphical User Interface)
GUI (Graphical User Interface)
Interface)
The pictorial representation are called pictures rather than representations.
The OS interacts with the help of pictures rather than commands.
GUI environment gives a flexible working environment to the user for interacting with
the hardware.
Fast and easy.
Interaction through icons. (Icons are pictorial representation of a program)
Four characteristics of icon.
1. Visual 2.Textual 3. Operational 4. Positional
Basic Components of GUI
Desktop
Windows
Menu Bar
Menu
Scroll Bar
Menu Options
Dialog Box
Listbox
Text Box
Radio Button
Control Menu
Terminal I/O
Command Processor
File Specific Infector Infector
Infection Methods:
1. Append
2. Replace
3. Insert
4. Delete
5. Redirect
Virus Removal:
The virus removal program scans the disk files from the patterns of the known disk. On
detection, it removes them. However, if that virus has already damaged some other data,
it would be impossible to recover the old data.
Virus Prevention:
• Buy official legal copies of software from reliable stores or sources.
• Be careful when picking up free, unreliable or illegal software.
• Frequent backups and running of monitoring programs.
MS-Windows & Windows NT
MS Windows Windows NT
Supports all GUI features but works It is a full-fledged operating system.
slow due to MS-DOS Does not require MS-DOS
Only one application at a time can underneath.
be executed on the processor. Supports portable OS like UNIX.
Allows to start many application but It is multi-user, multitasking,
can execute only one. All others are
multithreading
idle.
Needs a lot of memory.
Multi- user
Multi- threading
Multi-
tasking
Features of Windows NT
2. Symmetric Processing
3. Threads
4. Multi tasking
5. Built – in Networking
Linux
Looks and feels like any other UNIX system
It is open-source (free) OS.
Its development began in 1991.
True 32-bit processor in Intel’s range of PC compatible CPU’s.
Revolves around the central operating system kernel- the core.
It is a standard environment for applications and for user programming.
Features of LINUX
Used by
scheduling Each process
Used in some
Specified by the algorithm. is normally
data centre
user externally They base given certain
situations
generally at the their time to run
where each
time of initiating calculations irrespective of
the process. user pays for
on the current its
the time used.
state of the importance.
process.
Running, Ready and Blocked Process in Process
Management
Running State
• There is only one process, which is executed b CPU at any given
moment is called as running state.
Ready State
• The process which is not waiting for an external event such as I/O
operation but which is not running is said to be in ready state.
• There is only one CPU, which is executing some process while the
process in the ready state is waiting for CPU’s attention.
Blocked
State
• When the process is waiting for an external event such as an I/O
operation, the process is said to be in blocked state.
Terms in case of Magnetic Disk:
Latency Time/
Tracks and Transmission
Seek Time Rotational
Sectors Time
delay
Magnetic disk
surface is made The time The time
up of concentric The time required for required for
circles called required for activate requested
tracks. read/write read/write sector on
A track is heads to move head for track to rotate
further divided to the correct appropriate below the
into smaller track surface and
areas called head
read data
sectors.
Memory Map of Single User Operating System
Kernel
Terms related to Memory Management :
• The basic principle behind • In many systems, when a • At any time, a process has a
virtual memory is called process is executing with only number of pages in the physical
locality of reference. a few pages in memory and memory. Not all the pages are
when an instruction is actively referred.
• This gives some basis to encountered which refers to • The set of pages in the physical
forecast whether a page is any instruction or data in some memory actively referred to at
likely to be referenced in other page which is outside the any moment is called working
the near future or not. main memory i.e on the disk , set.
• Thus, it helps to decide page fault occurs.
• At this stage, the OS must bring
whether the page should the required page into the
be thrown out from Main memory before the execution of
memory to make space for that instruction can restart.
new page or not.
Terms related to Memory Management :
Page
Dirty Page/ Dirty
Replacement Demand Paging
Bit
Policy
• As the no. of processes and the • In this, a page is brought in only
no. of pages in main memory when demanded.
increases all the page frames • Consider a process is created
become occupied. • The page which is modified with no pages in main memory.
• At this time, if a new page is to after it is loaded in main When the process is dispatched
be brought in, the operating memory from disk is called initially, the program counter
system has to overwrite some dirty page. will have been loaded with the
existing page in the memory. • The operating system address of first instruction. This
• The page to be overwritten is address is obviously belongs to
maintains one bit for each a page outside the main
selected by page replacement physical page frame to denote memory.
policy. whether a page has become • So a page fault will occur and
dirty or not.
• this is called dirty bit. the OS will now bring that page
in memory.