Fundamentals of Algorithms and Logic

What is an algorithm?

• A recipe for cooking food.

• An algorithm is a step-by-step procedure for solving a problem.

• A type of computer hardware.

• A random guess without any steps.

Define the term 'logic sequence'.

• A logic sequence is a type of computer algorithm.

• A logic sequence is a series of logically connected statements or propositions.

• A logic sequence is a random collection of numbers.

• A logic sequence is a visual representation of data.

What are the key components of an algorithm?

• Programming Language

• Input, Output, Steps, Termination

• Data Structure

• Algorithm Complexity

Explain the difference between a linear and a binary search algorithm.

• Linear search checks elements one by one, while binary search divides the list and requires sorting.

• Linear search is faster than binary search for large datasets.

• Linear search requires a sorted list to function properly.

• Binary search checks each element sequentially like linear search.

What is the purpose of flowcharts in algorithm design?

• To create a detailed written report of the algorithm.

• The purpose of flowcharts in algorithm design is to provide a visual representation of the algorithm's steps and decision points.

• To replace the need for coding the algorithm entirely.

• To ensure the algorithm runs faster in execution.

Describe the concept of time complexity.

• Time complexity is the total number of lines in an algorithm's code.

• Time complexity is a computational complexity that describes the amount of time an algorithm takes to run as a function of the size of the input.

• Time complexity measures the space an algorithm uses based on input size.

• Time complexity refers to the number of errors in an algorithm.

What is a decision tree in the context of algorithms?

• A decision tree is a model used for classification and regression that splits data into branches based on feature values.

• A decision tree is a linear model that predicts outcomes based on a single feature.

• A decision tree is a type of neural network used for deep learning.

• A decision tree is a clustering algorithm that groups similar data points together.

How does recursion work in algorithms?

• Recursion works by a function calling itself with a base case to terminate and a recursive case to break down the problem.

• Recursion is only used in database queries.

• Recursion eliminates the need for loops in programming.

• Recursion is a method of sorting data in arrays.

What is the significance of sorting algorithms?

• Sorting algorithms are significant for efficient data organization, faster searches, and improved performance in data processing.

• Sorting algorithms are only used for visual effects.

• Sorting algorithms are irrelevant in modern computing.

• Sorting algorithms slow down data retrieval processes.

Give an example of a real-world application of algorithms.

• Search engine optimization (SEO) algorithms, like Google's PageRank.

• Inventory management systems

• Social media engagement metrics

• Weather forecasting algorithms