BSCS 2-2 - DAA Quiz - 6-19-2023

Which of the following is a characteristic of the Brute Force method?

• It is always the fastest algorithm

• It is commonly used for problems with a small solution space

• It is suitable for solving large-scale problems

• It guarantees the most optimal solution

Which of the following best describes the Brute Force method?

• A method that relies on trial and error to find the solution

• A method that applies heuristics to quickly narrow down the solution space

• A method that uses optimized algorithms for efficient problem-solving

• A method that employs divide and conquer techniques to solve complex problems

Which of the following algorithms utilizes the Brute Force method?

• Selection Sort

• Quick Sort

• Merge Sort

• Insertion Sort

Which of the following is an advantage of the Brute Force method?

• It always has a fast execution time

• It requires less computational resources

• It is applicable to all types of problems

• It guarantees finding the optimal solution

What is one of the advantages of utilizing the Brute Force method for problem-solving, where all possible solutions are exhaustively tried without any optimization techniques, in comparison to other algorithms?

• It guarantees finding the optimal solution

• It always has a fast execution time

• It is applicable to all types of problems

• It requires less computational resources

Which of the following statements correctly describes a key difference between Selection Sort and Insertion Sort?

• Selection Sort is a stable sorting algorithm, whereas Insertion Sort is no

• Selection Sort is a comparison-based sorting algorithm, whereas Insertion Sort is a non-comparison-based algorithm

• Selection Sort has a time complexity of O(n^2), while Insertion Sort has a time complexity of O(n log n)

• Selection Sort is an in-place sorting algorithm, whereas Insertion Sort requires additional space

Which type of algorithm is likely to outperform the Brute Force method for large-scale problems?

• Dynamic programming

• Greedy algorithms

• Backtracking

• Randomized algorithms

14. What is a potential disadvantage of the Brute Force method when compared to other algorithms?

• It requires extensive memory usage

• It is not applicable to combinatorial problems

• It does not guarantee finding a feasible solution

• It is limited to problems with a small search space

Which of the following is an example of a problem that can be solved using the Brute Force method?

• Shortest path problem

• Minimum spanning tree problem

• Knapsack problem

• None of the mentioned

It is a comparison-based sorting algorithm that repeatedly swaps adjacent elements if they are in the wrong order.

• Selection Sort

• Merge Sort

• Bubble Sort

• Insertion Sort