DAA Prefinals

What is Brute Force Algorithm Design Technique also known as?

• proof by assumption.

• proof by construction.

• proof by exhaustion.

• proof by contradiction.

What is the method of mathematical proof used in Brute Force?

• The statement is solved through pattern analysis followed by a generalization of the results.

• The statement is solved by using only a single test case to infer a broader solution.

• The statement to be proved is split into a finite number of cases or sets of equivalent cases, where each type of case is checked to see if the proposition in question holds.

• The statement is simplified by ignoring outlier cases and focusing only on the most common results.

How is the Brute Force approach described?

• It is a complicated approach that combines data analysis and prediction based on input types.

• It is a trial-and-error method that uses randomness to discover the correct output.

• It is a straightforward approach to solve a problem based on the problem's statement and definitions of the concepts involved.

• It is a layered strategy that builds abstraction to gradually approach a solution.

What does 'Force' come from in Brute Force?

• Using creative logic

• Using mathematical tricks

• Using computer power, not intellectual power

• Using machine learning

What does Brute Force mean in short?

• try smarter

• plan before you code

• just do it.

• optimize everything

Which of the following is a reason for the importance of using Brute Force Algorithm Design Technique?

• It is applicable only to academic problems and is rarely used in practice.

• It is applicable to a very wide variety of problems, such as sorting, searching, string matching.

• It is mostly theoretical and only serves pedagogical purposes.

• It is applicable in rare scenarios where data is already sorted and filtered.

What is one practical value of Brute Force?

• It yields trivial solutions that often require additional algorithms to be useful.

• It yields abstract models which can later be implemented using optimized methods.

• It yields reasonable algorithms of at least some practical value with no limitation on instance size.

• It yields outcomes only for special cases under highly restricted inputs.

When might it not make sense to use a more elegant solution than Brute Force?

• When data sets are extremely large and performance is critical to the application.

• When a particular problem can be solved so quickly with a Brute Force method that it does not make sense to waste time devising a more elegant solution.

• When advanced methods like greedy algorithms are explicitly required by the specification.

• When the implementation is too risky and requires approval from a review board.

When is Brute Force still useful?

• When solving large-scale data sets

• When solving small-size instances of a problem

• When teaching advanced optimization

• When approximations are allowed

What is one educational value of Brute Force?

• It can serve as an important theoretical or educational purpose.

• It is suitable for automated proof checking.

• It provides advanced programming paradigms.

• It teaches heuristic problem-solving.