ASSIGNMENT SET -2
Q.1.Define
algorithm and write a note on Complexity and Time- Space Tradeoff with example.
Answer:-
Algorithm is a step-by-step procedure, which defines a set of instructions to
be executed in a certain order to get the desired output. Algorithms are
generally created independent of underlying languages, i.e. an algorithm can be
implemented in more than one programming language.
From the data structure point of view,
following are some important categories of algorithms −
Search − Algorithm to search an item in a
data structure.
Sort − Algorithm to sort items in a certain
order.
Insert − Algorithm to insert item in a data
structure.
Update − Algorithm to update an existing
item in a data structure.
Delete − Algorithm to delete an existing
item from a data structure.
Characteristics of an Algorithm
Not all procedures can be called an
algorithm. An algorithm should have the following characteristics −
Unambiguous − Algorithm should be clear and
unambiguous. Each of its steps (or phases), and their inputs/outputs should be
clear and must lead to only one meaning.
Input − an algorithm should have 0 or more
well-defined inputs.
Output − an algorithm should have 1 or more
well-defined outputs, and should match the desired output.
Finiteness − Algorithms must terminate after
a finite number of steps.
Feasibility − should be feasible with the
available resources.
Independent − an algorithm should have
step-by-step directions, which should be independent of any programming code.
How to Write an Algorithm?
There are no well-defined standards for
writing algorithms. Rather, it is problem and resource dependent. Algorithms
are never written to support a particular programming code.
Comments
Post a Comment