Algorithmic Strategies a What is meant by the term algorithm

Algorithmic Strategies

(a) What is meant by the term algorithmic strategy?

(b) What characterizes a brute force strategy? Give an example of a situation where
it would not be appropriate to use only this strategy.

(c) What is meant by the term combinatorial problem? Give an example.

(d) You need to explain to a child how to put the maximum possible number of
blocks of differing size into a small, lightweight travel bag, while keeping the
total weight below 2 kilograms. What kind of algorithm might you use here?
Explain your choice clearly. Sketch out an algorithm, with explanation.

Solution

a)solving the problem using or applying different algorithmic techniques are called algorithmic strategies

b)brute force approach means trying out sall possible solutions possible.It is simplest approach

ex:moving all the positions with one particular pawn,so that best move can be moved

c)combinatorial problems are the most complicated forms in algorithmic analysis.in these kind of optimized problems in which the feasible solutions can be expressed using concepts such as sets, subsets, combinations or permutations .even graph theory concepts too are present such as vertices, edges, cliques, paths, cycles or cuts.