Algo&Complex-Prelim Exam

Consider a mathematical problem that requires finding the greatest common divisor (GCD) of two numbers using the Euclidean method. This problem-solving approach involves repeatedly subtracting the smaller number from the larger number until the numbers become equal. This can be classified as:

• A finite algorithm involving non-recursive steps

• An infinite algorithm with a finite solution

• A recursive algorithm with a finite number of steps

• A non-algorithmic solution

Which of the following situations would not be considered an algorithm?

• A step-by-step process to calculate the area of a circle

• A set of instructions that repeats indefinitely without reaching a conclusion

• A finite procedure to find the maximum number in a list

• A recursive method to solve the factorial of a number

An algorithm is used to find the shortest path between two points in a city using a road network graph. This type of problem is most commonly associated with:

• Artificial intelligence, as it requires machine learning models.

• Operations research, as it involves optimization of routes and decision-making.

• Data science, as it deals with data analysis and processing.

• Healthcare, as it helps predict medical outcomes.

In data science, how do algorithms help businesses in fields such as marketing and finance?

• They randomly select data points to provide insights.

• They prevent the need for any human intervention in decision-making.

• They process large datasets to identify patterns and trends that inform strategic business decisions.

• They handle customer inquiries and provide direct feedback to clients.

A company wants to improve its marketing strategy by predicting customer behavior based on past purchase history and social media activity. What role do algorithms play in this scenario?

• They randomly select a strategy based on personal opinions.

• They analyze customer data to identify patterns, predict future behaviors, and inform marketing decisions.

• They eliminate the need for data analysis by automating all marketing decisions.

• They allow the company to choose a marketing strategy without considering any data.

Why is it important for an algorithm to be "clear and unambiguous"?

• It allows the algorithm to have multiple interpretations, offering flexibility.

• It ensures that each step of the algorithm is easily understood and leads to only one possible interpretation, preventing confusion during implementation.

• It encourages creative solutions by allowing different interpretations of the same step.

• It allows the algorithm to evolve over time with different meanings for the same steps.

Which of the following best illustrates the need for "finiteness" in an algorithm?

• The algorithm should run indefinitely to find the most optimal solution.

• The algorithm must complete its task within a finite number of steps, ensuring that it does not run endlessly and always provides an answer.

• Finiteness is only needed when the algorithm deals with large datasets.

• Finiteness ensures that the algorithm can restart from the beginning after completing its task.

Why is it important for an algorithm to be "feasible"?

• The algorithm must rely on futuristic technology to ensure optimal performance.

• It should be simple, generic, and executable with available resources, ensuring that it can be practically implemented and used in real-world scenarios.

• Feasibility is not crucial as long as the algorithm works in theory.

• The algorithm should focus on complexity rather than practicality to be effective.

How does being "language-independent" benefit an algorithm?

• The algorithm needs to be rewritten for each programming language.

• It consists of plain instructions that can be implemented in any programming language, ensuring consistent results no matter the language used.

• Language independence limits the algorithm's applicability to only certain types of tasks.

• Algorithms should rely on specific languages to ensure better performance.

What does "definiteness" mean in the context of an algorithm, and why is it essential?

• It allows instructions to be ambiguous so that different programmers can interpret them based on their preferences.

• It ensures that every instruction is precise, unambiguous, and easy to interpret, so the algorithm's steps are clear and easily followed without confusion.

• Definiteness means that the algorithm can be altered by users based on their needs.

• It allows the algorithm to have varying interpretations depending on the situation.