Pattern Matching and Algorithms Quiz

What is pattern matching in strings?

• Finding a substring within a string

• Sorting a string alphabetically

• Counting characters in a string

• Reversing a string

In the brute force pattern matching method, how is the pattern searched?

• By checking the pattern at every possible position in the text

• By dividing the text into smaller parts

• By using a dictionary to store words

• By skipping some characters randomly

Which of the following is a limitation of the brute force method in pattern matching?

• It requires pre-sorting the text

• It may take a long time for large inputs

• It cannot handle special characters

• It only works for numbers

What is the best-case scenario for brute force pattern matching?

• When the pattern appears at the end of the text

• When the pattern is not in the text

• When the pattern appears at the very beginning

• When the pattern consists of only spaces

The brute force algorithm checks for a match by:

• Comparing characters one by one at each position

• Jumping to every alternate character in the text

• Using hashing to store indices

• Only checking the first and last characters of the pattern

What is the greedy technique used for?

• Finding the optimal solution step by step

• Solving problems in a backward manner

• Generating random solutions

• Sorting numbers in an increasing order

Which of the following is an example of a problem that can be solved using the greedy technique?

• Minimum spanning tree

• Matrix multiplication

• Tower of Hanoi

• Fibonacci sequence

What is the main characteristic of the greedy technique?

• It always guarantees the best solution

• It makes the locally optimal choice at each step

• It backtracks to previous decisions

• It stores all possible solutions before choosing one

A disadvantage of the greedy approach is:

• It always finds the worst solution

• It cannot solve any problem

• It may not always provide the global optimum solution

• It requires sorting before solving a problem

Which of the following is not a problem typically solved using a greedy approach?

• Fractional knapsack problem

• Huffman coding

• Traveling salesman problem

• Kruskal's algorithm