Revision Quiz 3

Which of these describes iteration within an algorithm?

• Repeating a set of instructions only once
• Repeating a set of instructions multiple times
• Skipping certain steps in the algorithm
• Executing the instructions in a random order

Which of these describes selection in an algorithm?

• Choosing the last step in a series

• Repeating steps a certain number of times

• Choosing a specific step from a collection based on certain criteria.

• Selecting all elements from a collection

In the context of algorithms, which of these best describes decomposition?

• Ignoring the details of a problem and focusing on the big picture
• Breaking down a complex problem into smaller subproblems
• Solving a problem without breaking it down into smaller parts
• Combining multiple problems into a single complex issue

In the context of algorithms, which of these describes abstraction?

• Revealing all details regardless of relevance
• Identifying repeating methods or processes within a system

• Hiding unnecessary details and focusing on essential characteristics
• Breaking down a problem into smaller sub tasks

In the context of algorithms which of these describes pattern recognition?

• Identifying irregularities in a process

• Breaking down a process into smaller sub tasks

• Finding outliers in data
• Identifying repeating steps in a process

What is the meaning of anomalous data?

• Data points that are similar to the rest of the data
• Data points that are significantly different from the rest of the data
• Data points that are missing from the dataset
• Data points that are irrelevant to the analysis

What is the definition of an algorithm?

• A cooking recipe
• A random guess
• A musical instrument
• A step-by-step procedure or formula for solving a problem.

What is the definition of pseudocode?

• A form of encryption used in computer programming
• A type of code used for debugging software
• A programming language specifically designed for pseudonyms
• A high-level description of a computer program or algorithm that uses natural language elements mixed with some programming language constructs.

In the context of algorithms, what is the meaning of finiteness?

• An algorithm that has no defined steps or operations
• An algorithm that can run indefinitely without stopping
• An algorithm that can only be executed once
• An algorithm having a limited number of steps or operations, ensuring it will eventually terminate.

What is the minimum number of inputs and outputs an algorithm should have?

• 0 inputs and 0 outputs
• 1 input and 1 output

• 0 inputs and 1 output
• 1 input and 0 outputs