Characteristic of Algorithm:
- It must be finite
- It must be unambiguous
- It must have zero or more inputs
- It must have one or more outputs
- It must be executable
EPROM
|
EEPROM
|
||
EPROM stands for erasable programmable
read only memory
|
1
|
EEPROM stands for electrically
erasable programmable read only memory
|
|
Stored data can be erased by using
ultra violet ray
|
2
|
Its data erased with higher voltages/
electrical signal.
|
|
All data stored in EPROM are erased
when the user erased data
|
3
|
The case of EEPROM one can erase data
of a fixed memory cell
|
|
The speed of EPROM which data can be
read within 45 nsec to 90 nsec
|
4
|
The speed of EEPROM at which data can
be read within 45 nsec to 200 nsec
|
Static RAM
|
Dynamic RAM
|
||
Information stored on RS flip-flops
|
1
|
Information stored on FET transistors
|
|
No needs to be refreshed
|
2
|
Needs to be refreshed
|
|
Capacity is low
|
3
|
Capacity is high
|
|
It is expensive
|
4
|
It is cheap in cost
|
|
Much faster
|
5
|
Slower than static RAM
|
RAM
|
ROM
|
||
RAM is volatile
|
1
|
ROM is non-volatile
|
|
High speed
|
2
|
Access speed is less
|
|
Small in size
|
3
|
Larger size
|
|
Read/ write memory
|
4
|
Read only memory
|
|
Continuously power supply is needed
for RAM to maintain its state
|
5
|
ROM does not need such continuous
power supply
|
Primary Memory
|
Secondary Memory
|
||
It is volatile
|
1
|
It is non-volatile
|
|
Directly access by the processor.
|
2
|
Not directly access by the processor.
|
|
Much faster.
|
3
|
Slower than primary memory.
|
|
It is expensive.
|
4
|
It is cheap in cost.
|
|
Low capacity.
|
5
|
Large capacity.
|
|
Example: RAM, ROM
|
6
|
Example: Hard disk, floppy disk.
|
Figure: Classification of computer memory |
Multi-programming OS
|
Time sharing OS
|
||
The process can be executed by a
single processor
|
1
|
In this process two or more users can
uses a processor on their own terminal
|
|
It has no fixed time slice
|
2
|
It has fixed time slice
|
|
In case of multi-programming before
finishing a task the execution power is not taken off
|
3
|
The execution power is taken off
before finishing of execution
|
|
Example: Mac OS
|
4
|
Example: Windows NT
|
Batch Processing OS
|
Multi-programming OS
|
||
It is slower in processing
|
1
|
It is faster in processing
|
|
CPU needs to stand idly in this
process
|
2
|
CPU needs not stand idly in this
process
|
|
The processes have to wait in a queue
|
3
|
No process has to wait in a queue
|
|
The execution of process starts batch
wise
|
4
|
The execution of process starts as it
centers the processor
|
Multi-programming OS
|
Multiprocessing
|
||
This process can be executed by a
single process.
|
1
|
This process can be executed by two or
more processor.
|
|
User doesn’t have to wait to end the
program.
|
2
|
Many programs can be processed separately.
|
|
Process over lapping occurs here.
|
3
|
Process over lapping doesn’t occur
here.
|
|
The whole system stops if the CPU is
damaged.
|
4
|
The system runs smoothly even often
the damage of one or more CPU.
|