AlgoQuiz#1-Q3

What is a Brute Force Algorithm Design?

• A technique that uses shortcuts to find solutions

• A method that systematically examines all possible solutions

• An algorithm that uses artificial intelligence for quick results

• A design pattern that skips unnecessary solutions

Why might a brute force algorithm be considered computationally expensive?

• It requires minimal computing resources

• It uses all possible solutions, which increases computation time

• It skips unnecessary steps in the solution process

• It only works on small problems

In which of the following scenarios would a brute force algorithm be applied?

• Calculating logarithmic functions

• Password cracking by trying all combinations

• Quickly sorting a large list using optimizations

• Predicting stock market trends

Which sorting algorithm is commonly implemented using a brute force approach?

• Quick Sort

• Merge Sort

• Selection Sort

• Heap Sort

How does the brute force approach apply to the Traveling Salesman Problem?

• By exploring only optimal routes

• By finding shortcuts in each path

• By testing all possible routes to find the shortest one

• By predicting traffic conditions

What is the primary purpose of the Divide-and-Conquer Algorithm Design Technique?

• To combine multiple solutions into a single answer

• To break complex problems into manageable subproblems

• To solve problems in a single step

• To use brute force to find solutions

Which of the following is not an application of the Divide-and-Conquer technique?

• Big data processing

• Financial analysis

• Search engines

• Sequential search

What is a common characteristic of algorithms that use Divide-and-Conquer?

• They examine all possible solutions

• They break problems into smaller, manageable subproblems and combine solutions

• They are only suitable for small data sets

• They rely solely on sequential steps

In which scenario would Binary Search be an appropriate algorithm to use?

• Searching for a name in a randomly ordered guest list

• Finding a book in an alphabetized list of book titles

• Sorting a list of students by height

• Finding the shortest route for a traveling salesman

What is the Decrease-by-a-Constant-Factor technique?

• Reducing the problem size by a varying amount

• Reducing the problem size by a fixed number, often by 1

• Reducing the problem size by a fixed factor, often by half

• Increasing the problem size by a fixed factor