operating system
operating system
operating system
Write its
function?
Asked in Board Exam (Oct. 2004, 2007 Mar. 2009) Important
Ans : An Operating System is a program, which acts as an interface between the user of
computer and the computer hardware.
The operating system can be viewed as a set of software programs, normally supplied along
with hardware for the effective and easy use of the machine.
i) The primary aim of the operating system is to make the hardware convenient to use.
ii) To help users to execute programs.
iii) To control execution of program to prevent errors and improper use of computer system.
iv) To make provision for security of information to users .
vi) It provides facility to share the same hardware among the users.
i) IM: Information Management provides facilities to store, retrieve, modify the information,
on various devices. The services provided under IM are :
ii) PM : The services provided under process management are directed to keep track of all
running programs, called processes. In multiuser operating systems, number of users located
at different terminals may execute different programs at a time. In such case operating
system keeps track of all processes. It schedules them and dispatches them one after another.
iii) MM : The services in Memory Management keep track the of all memory locations. They
determine memory allocation policy and use various techniques and algorithms to achieve
this.
2) These system services manage the organization of information into files and directories by
allocating memory space to them.
3) It also ensures that correct programs have access to information, have occupied memory
space and driving various devices.
i) Create a file.
ii) Create a directory.
iii) Open a file for read/write purposes.
iv) Explore a directory.
v) Close a file.
vi) Read data from file to buffer.
vii) Write data from buffer to file.
viii) Move file pointer.
ix) Create a link.
x) Change working directory.
2) But such a computer system has only one C.P.U. and it can execute only one instruction,
belonging to any one of these programs at the same time.
3) The Process Management of such O. S. keeps track of all running programs called
processes, Schedule then and dispatch them one after the another. While doing so, it
gives an impression to each user that it has the full control of C.P.U.
4) The Process Management modules of single user O.S. are less complicated than multi-user
O.S.
i) Read a process.
ii) Block a process.
li) Resume a process.
iv) Terminate a process.
v) Suspend a process.
vi) Delay a process.
vii) Change the priority of a process
viii) Generate a process.
2) But before loading it in memory, it should know that how much of free memory is available
and how much of memory should be allocated to the job.
3) For this, the operating system keeps list of all free memory location. Before a program is
loaded in memory the operating system consults with this list. It loads the program into
memory and modifies the list.
4) When the program is executed complete, it removes programs from main memory and
again modify the list.
5) For this, the O.S. determines memory allocation/deallocation policies and uses various
techniques and algorithms to athieve this.
(a) Some system may allow system calls to be made directly from a higher level language
program. In this, calls are predefined function or subroutine.
(b) Some languages — C, PERL – allow system calls to be made directly.
(c) FORTRAN system provides set of library routines.
i) Easier to use :
1) Windows 98 is a single user multitasking operating system.
2) Navigating around the computer is easier in Windows 98,
3) A file can be opened by a single click.
4) Windows 98 allows us to use multiple monitors with single computer.
5) New hardware can be easily installed and used without restarting computer.
6) With Windows 98 we can use digital cameras and other digital imaging devices.
ii) Faster :
1) Windows and programs open faster than in Windows 95.
2) The computer speed and efficiency can be easily improved by simple maintenance.
ii) A user will get faster response eventhough multiple applications are running.
vi) Windows NT uses New Technology File Systems (NTFS), which implements fault tolerance,
security and has support for very large files
i) Linux is a multiuser, operating system with a full set of unix compatible tools.
ii) Linux runs on a wide variety of platforms. It was developed exclusively on PC architecture
iii) It provides as much as functionality from limited resources. It can run on machine having
4MB of RAM.
iv) Linux presents standard interfaces to both the programmer and user
vi) Linux is free software. Free in the sense that people can copy it, modify it, use it in any
manner they want.
1. Kernel : Kernel maintains all important abstractions of the operating system, such
as processes and virtual memory.
2. System libraries : System libraries define a standard set of functions through
which applications can interact with the kernel, and which implements much of
the O.S functionality.
3. System utilities : These are programs that perform individual, specialised
management tasks. Some system utilities may be invoked just once to initialize
and configure some aspects of system.
Following figure shows various components of Linux system:
2) Each file has a specific name, which is used to refer that file.
3) For convenient use of the computer system, the O.S. provides a uniform logical view of
information storage.
4) The operating system manages mass storage devices to implement the abstract concept of
file.
6) Using various data structures file system in IM allows user to define files and directories
and allowcate/ deallocate the disk space to each file.
i) Tape-based systems:
(a) Tape-based systems are simple but inefficient.
(b) In these svstems, files are stored on to reels of physical tapes. Generally one or more files
are stored on to one tape.
(c) Tapes are used for transport of data from one computer to another.
i) Finding a file on tape-based systems is difficult and time consuming, while a file can easily be
found on a disk-based system.
ii) In tape-based systems, if a file is to be modified, it requires to copy entire tape whereas in a
disk based systems a file can be modified easily, without copying the entire disk.
iv) Disk-based systems are easier and convenient to use instead of tape-based systems.
v) Each disk consists of number of blocks, which can be rewritten easily, while we require
entire tape to copy, if we have to rewrite something.
13 Explain the file system related to Information
Management with file operations only.
Asked in Board Exam (March 2004, 2007 Oct.2015) Important
Ans : 1) The file system related to IM allows the user to define files and directories and
allocate/deallocate the disk space to each file.
3) File operations : The file concept is implemented by the operating system. System calls
are provided to create, read, write, rewind and delete files.
(a) Create a file : For Creating a file, first whether sufficient space is available for that file is
checked. If it is available, entry for new file must be made in directory.
(b) Write to a file : For whiting to a file, there is command in which name of the file is given.
Then Operating system search for that file in directory entry and write to it
(c) Reading a file : For reading a file, there is a system call in which file is specified. Then
operating system searches for that file in directory entry and read it.
(d) Rewind a file : The directory is searched for appropriate entry and file is reset to the
beginning of file.
(e) Delete a file: To delete a file, directory entry is searched and if file is found, it releases the
memory space and that directory entry now become invalid.
Ans : i) Tracks and Sectors : Magnetic disk surface is made up of concentric circles called
tracks. The number of tracks varies depending on the disk type. A track is further divided into
smaller areas called sectors.
A sector is a smallest unit of information which can be read from or written to the disk.
Sector varies from 32 bytes to 4096 bytes and track contains 4 to 32 sectors per track and
from 75 to 500 tracks per disk surface.
ii) Seek time: The time required for read/write heads to move to the correct track is called as
seek time.
iii) Transmission time : The time required for activate Read/Write head for appropriate
surface and read data is called as transmission time.
iv) Latency time/Rotational delay : The time required for requested sector on track to rotate
below the head is called as latency time or rotational delay.
External fragmentation :
Variable partition suffers from external fragmentation,
Suppose a job of 512 bytes is terminated and new job is of 256 bytes is loaded in the partition
then 256 bytes of memory is wasted. T his is called as external fragmentation.
i) Dumb terminal :
(a) A dumb terminal consists of a microprocessor on which small programs can run and
limited amount of memory.
(b) It is responsible for basic I/O operations.
(¢) A dumb terminal does no processing on input characters.
i) Anytime all characters stored in the video RAM are displayed on the screen by the video
controller using display electronics.
v) A typical alphanumeric screen can display 25 lines each consisting of 80 characters i.e. 25 X
80 = 2000 characters.
vi) Data Byte : All 2000 characters are stored in video RAM. To display any specific character
on the screen at a specific position all ASCII or EBCDIC code for that character is to move in
video RAM.
vii) Attribute Byte : There is one attribute byte for each data byte. This byte tells the video
controller how the character is to be displayed. It signifies whether the corresponding data
character which is stored next to it in the video RAM is to be displayed bold, underlined,
blinking or in reverse video et
(b) Anytime, all the 2000 characters (25 lines X 80 columns on screen) stored in video RAM are
displayed on the screen by the video controller.
(c) The video RAM is treated as part of the main memory only.
(d) Therefore, for moving any data in or out of the video RAM, ordinary load or store
instructions are sufficient.
(a) Small memory within the keyboard itself : When a character is keyed in, the 8-bit ASCII
EBCDIC code is generated which is stored temporarily in the memory of the terminal itself.
(b) The video-RAM (data and attribute byte) : The ASCII or EBCDIC code for the character is
to move the video RAM at the corresponding position with appropriate co-ordinates.
(c) The operating system buffers : The operating system has one buffer for each terminal
and two separate buffers for input and output operations.
(d) The I/O area of the application program : When the user finishes keying in the data, the
data stored in operating system buffer for that terminal is flushed out to the I/O area of the
application program which wants that data.
Q. 20 What is a process ?
Asked in Board Exam (Oct. 2002, Oct. 2004) Important
Ans : Process :
i) A process is defined as a program under execution, which competes for CPU time and other
memory resources.
ii) In simple terms, a program does not compete for computing resources such as CPU. time
or memory, whereas a process does. A program may be present on paper reside on disk.
It may be compiled or tested but it still does not compete for computing resources.
iii) Once a user wants to execute a program, it is located on the disk and loaded in the main
memory, at that time, it becomes a process, because it then compete for C.P.U. time and
other resources.
2) Degree of multiprogramming.
Ans : 1) Context switching :
In multiprogramming system, multiple processes are run at the same time such that when
process 1 wait for an I/O, process 2 executes and vice versa. The lost in time, in turning the
attention of CPU from one process to another is called as context switching.
2) Degree of multiprogramming :
The number of processes running simultaneously and hence competing for CPU is known as
degree of multiprogramming.
ii) In multiprogramming, C.P.U. can execute two or more processes simultaneously. When
process 1 waits for an external event such as an I/O operation, C.P.U. executes process 2 and
vice versa.
iii) When C.PU. switches from one process to another the time required for switching is called
as context switching.
Context switching
iv) Let A and B be the two processes ready for execution and requires C.P.U. time for
execution.
Let CPU time be given to process A, which is having some instructions depending on
process B or on some external event such as an I/O operation. Then, it is the job of operating
system to halt the execution of process A and give C.P.U. time for process B.
The lose in time in turning the attention of C.P.U. from process A to process B is known as
context switching.
v) During context switching the status of C.P.U. registers and flags of the old process are
stored in memory.
For-e-g :-
// A. CPP
# include <iostream.h>
# include “B.h”
void main ()
{
int a = 10, b = 20;
cout << add (a,b);
}
// B.h
# include <iostream.h>
int add (int x, int y)
{
return (x+y);
}
C++
Here A and B are the two processes, where process A is depending on B. When process A is
being executed, CPU executes instructions one by one. When it comes to the instruction one
by one. When it comes to the instructions cout <<add (a,b); it stops execution because the
output of this instruction depends on Output of process B.
Thus there is need of execution of process B. So C.P.U. stores the contents of registers and
flags of process A in RSA (Register Save Area). It then loads process B in memory. The time
required for this is known as context switch. The CPU then executes process B and output is
given to process A and execution of process A restarts from the instruction from which it was
halted.
The major difference between blocked and ready process is that a blocked process can not
be directly scheduled even if CPU is free, whereas a ready process can be scheduled if the
C.PU. is free.
2) In this case the O.S. has to keep track of all these processes and will have to dispatch them
one after another. This is known as process scheduling.
3) While scheduling various processes, there are many objectives for the operating system.
Some of these objectives conflict with each other. Therefore, the O.S. designers have to
choose a set of objectives to be achieved. Some of these objectives are as listed below :
i) Fairness
ii) Good throughput
iii) Good CPU utilization
iv) Low turnaround time
v) Low waiting time
vi) Good response time.
iii) CPU utilization is the fraction of the time that the CPU is busy.
iv) Turnaround time is the elapsed time between the time a program or job is submitted and
the time when it is completed.
v) Waiting time is the time a job spends waiting in the queue of the newly admitted processes
for the operating system to allocate resources to it before commerncing its execution.
vi) Response time is the time slice for responding to a question or an event. It depends on
degree of multiprogramming, the efficiency of the hardware along with the O.S. and th policy
of O.S. to allocate the resources.
Ans : (1) Turnaround time : Turnaround time is the elapsed time between the time a
program or a job is submitted and the time when it is completed.
(2) Waiting time : Waiting time is the time a job spends waiting in the queue of the newly
admitted processes for the operating system to allocate resources to it before commencing its
execution.
(3) Terminal response time : In the Time-sharing system, Terminal response time is the time
to respond with an answer or result to a question and it depends on degree of
multiprogramming, the efficiency of hardware with OS and policy of OS to allocate resources.
(4) Event response time : In the real-time system, event response time is the to respond
with an event.
i) This philosophy allows a higher priority process to replace a currently running process even
if its time slice is not over or it has not requested for any external operation.
iii) It is suited for on-line, real time processing, where interactive users and high priority
processes require immediate attention.
iv) The preemptive philosophy increases fairness of the system but decreases throughput.
Non-preemptive philosophy :
ii) This means that even a high priority process enters the system, the running process can not
be forced to give up control.
iii) However if the running process is blocked due to some external request another process
can be scheduled.
iv) It is not suited for real time systems, where high priority events requires an immediate
attention.
2) Due to many processes competing for the same available resources like C.P.U. and
memory, concept of priority is used.
(2) In many cases, the operating system allows user to change its priority externally even
during its execution.
(3) If the user does not specify any external priority at all, the operating system assumes a
certain priority, called the default priority. But when an urgent job needs to be done, the
system manager permits the process to be created with a higher priority.
(1) The concept of internal priority is used by scheduling algorithms. They base their
calculations on the current state of the process eg, each user, while firing a process, can be
forced to
specify the expected time that the process is likely to take for completion.
(2) The operating system can then set internal priority, which is highest for the shortest job
(SJF i.e. shortest job first algorithm), so that at only a little extra cost to large job, many short
jobs will complete.
(3) This has two advantages : (a) If short jobs are finished faster, the number of processes
competing for CPU. will be decreased. (b) The number of satisfied users will increase.
(4) However if a stream of short jobs keeps coming on, an important large job may suffer from
indefinite postponement. To avoid this, set higher external priority to important large jobs
(a) This priority is used in some data centre situations where each user pays for the time used.
(b) Higher priority processes are charged at a higher rate to prevent each user from firing his
job at the highest priority. This is known as scheme of purchased priority.
(c) Operating system keeps track of the time used by each process and the priority at which it
was used.
(a) Each process is normally given certain time to run irrespective of its importance. This is
known as Time slice.
(b) Time slice given to each process so that a process does not use the CPU indefinitely.
(2) Hence in operating systems which supports multitasking, a process can be considered to
be made up of number of tasks, which can run simultaneously in the same way that a
multiuser operating system supports multiple process at the same time.
(3) Just like processes, a task can also have priorities and states.
(4) A task can be in ready, running or blocked states and accordingly task control blocks (TCB)
are linked together.
(5) When the operating system schedules a process with multiple tasks and allocates time
slice to it, the following happens :
(i) The operating system select the highest priority ready task within that process and
schedules it.
(ii) Atany time if the process time slice is over, the operating system turns the process as well
as currently runing task into ready state from running state.
(iii) If the process time slice is not over but the current task is either over or blocked, the
operating system chooses next highest priority ready task within that process and
schedules it. ’
(iv) If there is no other ready task within that process only then the O.S. turns that process to
blocked state.
On the current state of the process e.g. each user, while firing a process, can be forced to,
specify the expected time that the process is likely to take for completion.
Q. 30 Explain the term multitasking with a suitable
example.
Asked in Board Exam (Oct. 2003, 2013) Important
Ans :
1) Multitasking : A task can be defined as an asynchronous code path within a process. In
multitasking, a process can consist of tasks, which run simultaneously.
2) Multiple tasks should be able to run concurrently within a process.
3) Multitasking allows programmer flexibility and improves CPU utilization.
4) It reduces the overheads of switching at a process level.
5) For example :
Consider a process consisting of two tasks :
(a) Two task are defined within the same process. They run concurrently within the same
process if synchronized properly.
(b) If task 0 is blocked, instead of blocking entire process, the operating system will find out
whether tasks 1 can be scheduled.
(c) When both tasks are blocked, only then entire process is blocked. Again if one task is
ready, the process can be moved to ready list and then scheduled.
(ii) When various tasks are defined in a process, then process would be blocked only if all the
tasks in that process are blocked.
(iii) Again even if any task becomes ready, the process can be moved to ready list from
blocked list.
(iv) By adding task levels, context switching at various process levels can be reduced.
a) To keep track of all memory locations free or allocated and i allocated; to which process
and how much.
b) To decide memory allocation policy i.e. which process should get how much memory
locations Normally, this is achieve with the help of some special hardware.
(2) The memory map of such operating systems consists of program to be executed i.e.
process, free memory available, command interpreter and kernel.
(3) The command interpreter of the single user operating system is invoked when the
computer is started.
(4) This O.S loads program to be excuted in the main memory and assign as much memory as
possible to it. It then sets instruction pointer and executes the program.
(6) The kernel of such O.S provides basic operating systems services, while the command
interpreter interpretes the commands
(1) In fixed partitioning, partitions could be of different sizes. But once decided, their size can
not be changed
2) In this method partitions are fixed at the time of system generation. At this time, system
manager has to declare the partition time.
(3) Fixed partitions are also called as static partitions. On declaring fixed partitions, the
operating system creates Partition Description Table (PDT).
(1) In variable partitioning number of partitions and their sizes are variable.
(3) These partitions are created by the operating system at run time they differ in size.
(4) The procedure to be followed for memory allocation is nearly same as that in case of fixed
partitions.
(5) At any time, any partition may be free or allocated to some process. Also, in variable
partitioning, starting address of partition is not fixed.
i) The long term process scheduler of the PM decides which process to be brought in to the
memory.
ii) It then finds out the size of the program to be loaded by consulting the IM portion of the
0.S. The compiler keeps the size of the program in the header of the executable file.
iii) Then makes a request to the partition allocation routine of the MM to allocate a free
partition, with the appropriate size.
(iv) With the help of the IM module it now loads the binary program in the allocated partiition.
(v) It then makes an entry of the partition ID in the PCB (process control block) before the PCB
is linked to the chain of ready processes by using the PM module of the operating system.
(vi) The routine in the MM now redefines partition description table and marks the status of
that partition as allocated. (ALLC)
(2) As shown in figure operating system may be loaded at lower addresses i.e. 0 to P. At any
time, only one user process is in the memory. This process is run to completion and then next
process is brought in the memory.
OR
(d) When a program is to be executed its pages are loaded into any available frames and the
page map tables defined to translate from user pages to memory frames.
Every address generated by CPU is divided in two parts :- a page number (p) and a page
offset / displacement (d). The page number is used as an index into a PMT.
Q. 39 What is segmentation?
Asked in Board Exam (March.2011, Oct. 2004) Important
Ans : (1) Segments are logical divisions of programs and hence are normally of variable sizes.
(2) Segmentation 1s a memory management scheme which support user’s view of memory.
(4) Each program in executable form can be considered to be consisting of ditferent segments
such as code, data and stack. Each of these can be further divided into new segments.
(5) A program normally contains main program, some subprograms and few predefined and
precompiled functions. Each of these belongs to different segments.
(6) An application programmer does not necessarily have to declare different segments in the
program. If various segments in his programs does not explicitly, then the compiler does it by
its own. Following are the jobs of compiler :
(7) Consider the examples as shown in figure Four segmeents numbered 0 to 3. The SMT
(Segment Map Table) has separate entry for each segment givingthe size and base of
segment.
Segment 0 Segment 1
999 399
Segments
ii) This gives some basis to forecast whether a page is likely to be referenced in the near
future or not, depending on its behavior in past.
iii) Thus, it helps to decide whether the page should be thrown out from main memory
to make space for new page or not. )
iv) If this principle is not valid, user can not throw any pages out on the disk from
memory without a possible severe degradation in the performance.
ii) At this stage, the operating system must bring the required page into the memory
before the execution of that instruction can restart.
iii) This has a significant bearing on the policy of bringing in pages from the disk to the
main memory, if the operating system follows the “Working set model.”
ii) At this time, if a new page is to be brought in, the operating systern has to overwrite some
existing page in the memory
ii) The operating system maintains one bit for each physical page frame to denote whether
a page has become dirty or not. This bit is called dirty bit.
6) Demand paging :
ii) Consider a process is created with no pages in main memory. When the process is
dispatched initially, the program counter will have been loaded with the address of first
instruction. This address obviously belongs to a page outside the main memory. So a page
fault will occur and the O.S. will now bring that page in memory.
iii) In this way as page fault goes on occurring, the O.S. brings new referred pages. This
is called demand paging.
iv) The drawback of demand paging is that a lot of pages which have been used in past,
but which now are not required, remain in memory unnecessarily.
Advantages of GUI :
1) With GUI commands are replaced by graphics. Hence it is not necessary to remember the
command and its meaning,
2) With GUI user can run several programs simultaneously.
3) User can communicate and exchange data between programs without transferring or
copying
files.
Features of GUI:
1) Replacement of command with icons :
(a) Commands are grouped together in various levels of hierarchy and when the user selects a
group, further commands in that group are displayed.
(b) This allows the user to select a command using a cursor and simply clicking on it.
(c) User can select the command and use the application without first having to know about
the computer and its working.
(a) GUI – based applications provide “HELP” about various features of the application.
(b) HELP can assist the user in knowing everything about the application.
(c) In the windowing environment, if user gets confused at any point, a HELP is readily
available. This makes GUI-based applications more popular and efficient.
Q. 44 What is meant by GUI ? What are the
essential components of GUI ? Explain any three.
Asked in Board Exam (March 2004, Oct. 2004, 12, 15) Important
Ans. : GUI : The interface which replace cryptic commands by their graphical representation
are called Graphical User Interface (GUI).
Windows operating system is GUI based operating system.
1) Menu bar:
(i) Menu bar normally appears at the top of the window under the window title.
(ii) Some commonly used menu bar options are File, Edit, View, Help etc.
(iii) When one of these menu is selected, a pulldown menu appears on the screen.
2) Scroll bar:
3) Dialogue boxes :
(i) Dialogue box is a window, used by the application to interact with the user.
(ii) A dialogue box can also be used to display information or to get user input and also
for a combination of these two functions.
(iii) Dialogue boxes are of two types :
(a) Modal dialogue box
(b) Modeless dialogue box.
(iv) A dialogue box where an application can continue only after the user has responded to the
dialogue is called modal dialogue box.
(v) A dialogue box, which allows user to continue without responding to it is called modeless
dialogue box.
Q. 45 Explain in short the function of Menubar and
scroll bar components of G.U.I
Asked in Board Exam (March 2002, 2008, 2011) Important
Ans :
(i) Menubar :
1) Push button :
It is a rectangular button having a label, indicating action to be carried out. This button is used
to select an action represented by button. This button normally used when one action is to be
selected at of many choices.
For e.g. [SAVE]
Workarea
Modeless
Apllication
3) Check buttons :
A check button consists of a square box and an accompanying text. This is used for selecting
one or more choices from a list of options.
e.g.
☑ Auto manage
☑ Default position
☑ Align
iii) Dialogue boxes are of two types : (i) Model dialogue box ii)Modeless dialogue box.
iv) A dialogue box where an application can continue only after the user has responded to the
dialogue is called model dialogue box.
v) A dialogue box, which allows user to continue without responding to it is called modeless
dialogue box.
1) Program Manager :
(d) It also indicates how each group contents are controlled and displayed on the screen.
2) File Manager :
(b) This is used to traverse through the file system and change drives, to search, copy, move,
create or delete files and directories.
(c) Applications can be started directly from the File Manager.
3) Control Panel :
(a) It can be used to choose or change the color schemes in the applications, select and display
the background of the screen, select border width and other border characteristics, cursor
size and shape etc.
(c) It is also used to configure printers and other ports on the PC.
2) In multiuser operating systems, the concepts of security and protection are very important.
User programs should not interfere with one another or with the operating system.
3) In general, Secure Systems are those, which control, through the use of specific security
features, access to information that only properly authorized individuals or processes
operating on their behalf will have access to read, write, create or delete.
4) There are three main elements of security viz. Confidentiality, integrity and availability.
(i) Confidentiality :
(ii) Integrity :
Integrity ensures that the information is not amended or deleted by an unauthorised manner.
It is generally related to Write operations.
(iii) Availability :
2) The major threats to security in any computing environment can be categorized as follows :
Security Threats
4) Out of these five security threats, the first fwo, viz. tapping and disclosure, are categorized
as passive threats and the other three as active threats.
5) It is clear that in both the cases (i) and (ii), information goes to the third party. But, the
difference is that in tapping the third party accessed information without knowledge of other
two parties. Whereas in disclosure the source party willingly discloses information to the third
party.
1. Authentication :
Authentication means verification of access to the system resources. Following are some of
the ways in which authentication may take place :
(i) By stealing and using somebody else’s password and then use it.
(ii) Use of vendor supplied password which can be used by only system administrator.
(iv) If a user logs on and then goes off, an intruder can use that terminal.
2. Browsing :
(i) In some systems, there exist files with access controls, which are very permissive.
(ii) One can browse through the system file to get this information, after which, unprotected
files/databases could be easily accessed.
3. Trap doors:
(i) Sometimes, software engineers leave some secret entry point to modify their programs.
These are called trap doors.
Use of active or passive wire traps, or mechanism to pick up the screen radiation and to
recognize what is displayed on screen is called electric data capture.
5. Invalid parameters :
6. Line trapping :
A special terminal is used to tap into a communication line. It causes access to confidential
data.
7. Waste recovery :
By using some technique, deleted files can be recovered, password may be recollected.
8. Rouge software :
2. But, while doing this, it consumes the network resources to a very large extent.
3. A computer worm can potentially bring the entire network to a grinding halt.
Mode of Operation:
5. It just spreads, thereby consuming large resources such as transmission capacity or disk
storage. It denies services to legitimate users.
6. A computer worm usually operates on a network. Each node on network maintains , a
“mailing list”, which contains the names and addresses of the reachable machines on the
network. The worm gets access to this list and using this, sends a copy of itself to all those
addresses.
7. If the worm is intelligent, after reaching a node it checks whether a copy of itself already
exist there or not. If exists, it does not create one more Copy.
8. If the worm in dumb, it just copies itself to all nodes. So, if one node’s address is at several
places in network, then it would have several copies of the worm.
1. A computer virus is a part of program, which is written with clear intention of infecting
other programs.
2. A computer virus is not a complete program by itself. It can not act independantly.
3. A computer virus causes direct harm to the system. It can corrupt code as well as data.
4. The classification of virus is based on what do it affects or where the virus resides.
(i) Append: In this method the viral code appends itself to the unaffected programs.
(ii) Replace: In this case, the viral code replaces the original executable program completely
or partially to carry out some funny actions.
(iii) Insert : In this case, the viral code is inserted in the body of an executable code to carry
out some funny or undesirable actions.
(iv) Delete : In this case, the viral code deletes some code from the executable program.
1. A virus works in a number of ways. Normally, the developer of a virus has to be a very
bright person who knows the operating system very well in order to break it.
2. This person produces interesting or useful program such as a good game or utility.
However,
this program has some viral code embendded in it.
3. Typically, it is developed under MS-DOS, as viruses are very popular on the PCs.
4. This program is then published on the public bulletin board system or it is distributed to
people free of charge.
5. Tempted by its contents and the price, the user acquires it and then starts using it after
copying it onto the machine.
6. At this stage, the virus can be said to be in a nascent state. After executing the game or the
utility i.e. the host program, the virus also executes, which allows it to spread to other
programs on the machine and infect them.
1. Normally, a virus detection program checks the integrity of the binary files.
2. The program maintains a check sum on each file. A mismatch in it indicates virus.
3. Some programs reside in the memory and continuously monitor certain memory
and I/O operations for guarding against any suspicious behavior.
(ii) Virus removal :
1. User cannot cure the data (recover) after viral affection. Hence the best way is to
prevent viruses.
2. For this user must buy official, legal copies of software from reliable stores or
sources.
3. One should be extremely careful about picking up free, unreliable or illegal
software.
4. Frequent back-ups and running of monitoring programs also help in detection,
and thus subsequent prevention of different viruses.
Q. 58 Differentiate between computer worms and
computer viruses.
Asked in Board Exam (March 2004,09,12,14,15) Important
Ans :
Computer worms :
i) A computer worm is a complete program.
ii) A computer worm can act independently.
iii) Generally it do not cause direct harm to computer system.
iv) It just goes on spreading on to network and consumes network resources to a large extent.
Computer viruses :
1) Worm Prevention : A worm can be prevented by strong and various check points on
communication system.
2) Virus Prevention :
(a) Users cannot cure the data after viral affection. Hence the best way is to prevent
viruses.
(b) For this user must buy official, legal copies of software from reliable stores or sources,
(c) One should be extremely careful about picking up free unreliable or illegal software.
(d) Frequent back-ups and running of monitoring programs also help in detection, and
thus subsequent prevention of different viruses.