Click to edit the outline text format

Second Outline Level

Third Outline Level
Fourth Outline Level
Fifth Outline Level
Sixth Outline Level
Seventh Outline LevelInsert Image

Subtitle

ALGORITHMS IN COMPUTER
SCIENCE Date

BY , ROHIT MATHEWS GEORGE

INTODUCTION.
The word Algorithm means “a process or set of rules to be
followed in calculations or other problem-solving operations”.
Therefore Algorithm refers to a set of rules/instructions that step-
by-step define how a work is to be executed upon inorder to get
the expected results.
Algorithms are at the core of most techniques used in
contemporary computers alongside other technologies.
 ML ALGORITHM.
“Machine Learning” (ML) or ML is an algorithmic field that blends ideas from statistics,
computer science and many other disciplines (see below) to design algorithms that
process data, make predictions and help make decisions.
In terms of impact on the real world, ML is the real thing, and not just recently. Indeed,
that ML would grow into massive industrial relevance was already clear in the early
1990s, and by the turn of the century forward-looking companies such as Amazon were
already using ML throughout their business, solving mission-critical back-end problems
in fraud detection and supply-chain prediction, and building innovative consumer-
facing services such as recommendation systems.
BACK PROPAGATION ALGORITHM.

In machine learning, specifically deep learning, backpropagation (backprop, BP) is an

algorithm widely used in the training of feedforward neural networks for supervised
learning; generalizations exist for other artificial neural networks (ANNs), and for
functions generally.
“Backpropagation” algorithm that was rediscovered by David Rumelhart in the early
1980s, and which is now viewed as being at the core of the so-called “AI revolution,”
first arose in the field of control theory in the 1950s and 1960s. One of its early
applications was to optimize the thrusts of the Apollo spaceships as they headed
towards the moon.
 ABC ALGORITHM.
 In computer science and operations research, the artificial bee colony
algorithm (ABC) is an optimization algorithm based on the intelligent
foraging behaviour of honey bee swarm, proposed by Derviş Karaboğa
(Erciyes University) in 2005.
 A set of honey bees, called swarm, can successfully accomplish tasks
through social cooperation. In the ABC algorithm, there are three
types of bees: employed bees, onlooker bees, and scout bees. The
employed bees search food around the food source in their memory;
meanwhile they share the information of these food sources to the
onlooker bees. The onlooker bees tend to select good food sources from
those found by the employed bees. The food source that has higher
quality (fitness) will have a large chance to be selected by the
onlooker bees than the one of lower quality. The scout bees are
translated from a few employed bees, which abandon their food sources
and search new ones.
 In the ABC algorithm, the first half of the swarm consists of employed
bees, and the second half constitutes the onlooker bees.
 KMP ALGORITHM.

In computer science, the Knuth–Morris–Pratt string-searching algorithm (or KMP

algorithm) searches for occurrences of a "word" W within a main "text string" S by
employing the observation that when a mismatch occurs, the word itself embodies
sufficient information to determine where the next match could begin, thus bypassing
re-examination of previously matched characters.
The algorithm was conceived by James H. Morris and independently discovered by
Donald Knuth "a few weeks later" from automata theory. Morris and Vaughan Pratt
published a technical report in 1970.The three also published the algorithm jointly in
1977.Independently, in 1969, Matiyasevichdiscovered a similar algorithm, coded by a
two-dimensional Turing machine, while studying a string-pattern-matching recognition
problem over a binary alphabet. This was the first linear-time algorithm for string
matching.
 KMP ALGORITHM.

In computer science, the Knuth–Morris–Pratt string-searching algorithm (or KMP

algorithm) searches for occurrences of a "word" W within a main "text string" S by
employing the observation that when a mismatch occurs, the word itself embodies
sufficient information to determine where the next match could begin, thus bypassing
re-examination of previously matched characters.
The algorithm was conceived by James H. Morris and independently discovered by
Donald Knuth "a few weeks later" from automata theory. Morris and Vaughan Pratt
published a technical report in 1970.The three also published the algorithm jointly in
1977.Independently, in 1969, Matiyasevichdiscovered a similar algorithm, coded by a
two-dimensional Turing machine, while studying a string-pattern-matching recognition
problem over a binary alphabet. This was the first linear-time algorithm for string
matching.
 DIJKSTRA'S ALGORITHM
Click to edit the outline text
format

“
Second Outline Level
Dijkstra's algorithm (or Dijkstra's Shortest
Third Outline Level
Path First algorithm, SPF algorithm) is an
Fourth Outline
Level
algorithm for finding the shortest paths between
nodes in a graph, which may represent, for
Fifth
Outline example, road networks. It was conceived by
Level computer scientist Edsger W. Dijkstra in 1956
Sixth and published three years later.
Outline The algorithm exists in many variants.
Level
Dijkstra's original algorithm found the shortest
S
e path between two given nodes, but a more common
v variant fixes a single node as the "source" node
e and finds shortest paths from the source to all
nt other nodes in the graph, producing a shortest-
h
O path tree.
ut
lin
 GENETIC ALGORITHM.
Click to edit the outline text
format

“
Second Outline Level
Third Outline Level
Genetic algorithm – This is the most popular type
Fourth Outline of EA. One seeks the solution of a problem in the
Level
form of strings of numbers (traditionally binary,
Fifth although the best representations are usually
Outline
Level those that reflect something about the problem
Sixth being solved), by applying operators such as
Outline recombination and mutation (sometimes one,
Level sometimes both). This type of EA is often used in
S optimization problems.
e
v
e
nt
h
O
ut
lin
Click to edit the outline text
format

“
Second Outline Level
Third Outline Level
Fourth Outline
Level
Fifth
Outline
Level
Sixth
Outline
Level
S
e
v
e
nt
h
O
ut
lin