What is meant by the term algorithmic strategy? What characterizes a brute force

Question

What is meant by the term algorithmic strategy? What characterizes a brute force strategy? Give an example of a situation where it would not be appropriate to use only this strategy. What is meant by the term combinatorial problem? Give an example. 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.

Explanation / Answer

a) Algorithm is an important part of computer system. well defined algorithm can acheive a best result successfully within a prescribed time. An algorithm is a finite set of instructions to solve a particular task. All algorithms must satisfy the following criteria: (1) Input. There are zero or more quantities that are externally supplied.(2) Output. At least one quantity is produced. (3) Definiteness. Each instruction is clear and unambiguous.(4) Finiteness. finiteness result easy back tracking. (5) Effectiveness.

b ) Brute Force Strategy:

analysing all the possible path ways using supplied parameters, and suggest the best possible solution to the problem.  brute-force search is simple to implement, , brute-force search is typically used when the problem size is limited, or when there are problem-specific heuristics that can be used to reduce the set of candidate solutions to a manageable size. travelling salesman problem brute force strategy finds the appropriate solution with corresct and best path.

c)

Combinatorial problems involve finding a grouping, ordering, or assignment of a discrete, finite set of objects that satisfies given conditions. Candidate solutions are combinations of solution components that may be encountered during a solutions attempt but need not satisfy all given conditions.

d ) knapsack algorithm :

the step has been divided into different parts, the chooser can choose the item they decide.

for k from 0 to k do

Related Questions

Navigate

• Browse (All)
• Browse W
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.