What is an Algorithm? Flashcards
What is an algorithm?
An algorithm is a set of commands that must be followed for a computer to perform calculations or other problem-solving operations.
Define the term ‘Problem’ in the context of algorithms.
A problem can be defined as a real-world problem or real-world instance problem for which you need to develop a program or set of instructions.
What are the main components of an algorithm?
- Input
- Processing
- Output
How do algorithms work?
Algorithms take input data, process it through logical and mathematical operations, and produce an output.
What is meant by the efficiency of an algorithm?
Efficiency refers to the algorithm’s ability to accomplish tasks quickly and with minimal resources.
What is the role of optimization in algorithm design?
Algorithm designers seek ways to optimize their algorithms, making them faster and more reliable.
List some significant applications of algorithms.
- Data Analysis and Machine Learning
- Cryptography & Security
- Information Retrieval and Search Engines
- Optimization Problems
- Genomics and Medical Diagnostics
What is the characteristic of finiteness in an algorithm?
An algorithm must always have a finite number of steps before it ends.
What does definiteness mean in the context of algorithms?
An algorithm needs to have exact definitions for each step to ensure clear directions.
What is meant by the ‘Input’ of an algorithm?
Inputs are one or more values supplied to the algorithm before its processing.
What is the expected outcome of an algorithm referred to as?
The output.
What is the effectiveness of an algorithm?
Each stage of an algorithm must be straightforward and achievable within finite time using basic operations.
What does generality refer to in algorithms?
An algorithm should be able to solve a group of issues rather than being limited to a single particular case.
What does it mean for an algorithm to be cross-language compatible?
The algorithm must have small and simple instructions that can be implemented in any programming language.
True or False: An algorithm can have an infinite number of steps.
False
Fill in the blank: An algorithm must produce one or more _______.
outputs
What is a Brute Force Algorithm?
A straightforward approach that exhaustively tries all possible solutions.
What is a Recursive Algorithm?
A method that breaks a problem into smaller, similar subproblems and repeatedly applies itself to solve them.
What is an Encryption Algorithm used for?
To transform data into a secure, unreadable form using cryptographic techniques.
What is a Backtracking Algorithm?
A trial-and-error technique used to explore potential solutions by undoing choices when they lead to an incorrect outcome.
What is a Searching Algorithm designed to do?
Find a specific target within a dataset.
What is the purpose of a Sorting Algorithm?
To arrange elements in a specific order.
What does a Hashing Algorithm do?
Converts data into a fixed-size hash value for rapid data access.
What is a Divide and Conquer Algorithm?
Breaks a complex problem into smaller subproblems and combines their solutions.
What is a Greedy Algorithm?
Makes locally optimal choices at each step to find a global optimum.
What is a Dynamic Programming Algorithm?
Stores and reuses intermediate results to avoid redundant computations.
What is a Randomized Algorithm?
Utilizes randomness in its steps to achieve a solution.
What are the essential pre-steps before writing an algorithm?
- Clear problem definition
- Consider constraints
- Understand input required
- Define expected output
- Ensure solution fits constraints
What is the purpose of analyzing an algorithm?
To assess its relevance for different applications or compare it to other algorithms.
What is a Linear Search Algorithm?
An algorithm that finds if a specific item exists in a list by comparing each item.
What steps does a Bubble Sort Algorithm include?
- Compare adjacent numbers
- Swap them if in wrong order
- Repeat until no swaps needed
How do you calculate the factorial of a number using an algorithm?
Multiply a variable by each integer from 1 to n.
What is the Euclidean Algorithm used for?
Finding the Greatest Common Divisor (GCD) of two numbers.
What is an algorithm?
A process or set of rules to be followed in calculations or other problem-solving operations.
Algorithms are fundamental in computer science for automating tasks.
What is the output of an algorithm?
The algorithm’s outcome after every step has been completed.
Outputs should be clearly related to the input.
Define effectiveness in the context of algorithms.
Stages must be straightforward to carry out in finite time using basic operations.
Every operation should be doable and practicable.
What does generality mean for an algorithm?
An algorithm should be able to solve a group of issues rather than being limited to a single case.
It offers a generic fix for various inputs.
What is feasibility in algorithm design?
Indicates that an algorithm is practical and can be implemented with available resources.
An algorithm should require minimal changes when redefined.
What is time complexity?
Measures the amount of time an algorithm takes to complete as a function of the size of its input.
Helps analyze efficiency and predict runtime growth.
Define space complexity.
Measures the amount of memory an algorithm uses as a function of the size of its input.
Includes memory for input, output, and auxiliary variables.
What does it mean for an algorithm to be independent?
Relies only on logical constructs and is language-independent.
A simple algorithm is easier to understand.
What is parallel computing in algorithms?
Divides tasks into smaller sub-tasks for parallel execution on multiple processors.
Improves performance and reduces execution time.
What does performance measure in an algorithm?
How well the algorithm works, including its correctness and efficiency.
Correctness indicates that inputs produce the desired output.
What are processing steps in an algorithm?
The sequence of steps in the algorithm, also referred to as modularity.
Breaking down problems into small modules enhances clarity.
What does ‘unambiguous’ mean in the context of algorithms?
Each step in the algorithm is clear and has one meaning.
This defines an algorithm’s robustness.
How can algorithms be represented?
Through natural language, flow charts, pseudocode, and programming languages.
Each method has its advantages and disadvantages.
List the qualities of a good algorithm.
- Efficiency
- Correctness
- Clarity
- Scalability
- Reliability
- Optimality
- Robustness
- Adaptability
- Simplicity
These qualities ensure effective algorithm performance.
What is the big O notation used for?
To represent an algorithm’s time complexity and space complexity.
It helps in analyzing the performance of algorithms.
What are the advantages of algorithms?
- Efficiency
- Reproducibility
- Problem-solving
- Scalability
- Automation
They streamline processes and enhance productivity.
What are the disadvantages of algorithms?
- Complexity
- Limitations
- Resource Intensive
- Inaccuracy
- Maintenance
Developing algorithms can be challenging and requires ongoing updates.
Why is it called an algorithm?
The term comes from the Medieval Latin term algorism, referring to rules for arithmetic using the Hindu-Arabic numeral system.
The term evolved to represent systematic problem-solving methods.
Who is considered the father of algorithms?
Muhammad ibn Musa Al-Khwarizmi, a 9th-century Muslim scientist.
He invented algorithms and algebra.
What does the theory of algorithms involve?
It involves the structure and complexity of algorithms, including metric and descriptive theories.
Metric theory focuses on complexity, while descriptive theory on input-output correspondence.
