3.1 - Fundamentals of Algorithms

What is an algorithm?

• A type of computer hardware

• A sequence of instructions or a set of rules to solve a problem

• A programming language

• A type of software application

What does decomposition involve in problem-solving?

• Combining multiple problems into one

• Breaking down a complex problem into smaller parts

• Ignoring the problem entirely

• Solving the problem in one step

What is the purpose of abstraction in computing?

• To add more details to a problem

• To remove unnecessary details and focus on important aspects

• To make a problem more complex

• To create a physical model of a problem

What is pattern recognition in the context of problem-solving?

• Ignoring patterns in data

• Identifying similarities or patterns to simplify solutions

• Creating new patterns in data

• Destroying existing patterns

What is pseudocode?

• A real programming language

• A method of writing algorithms using plain English

• A type of computer virus

• A software development tool

What is a flowchart used for?

• To create a database

• To represent an algorithm or process visually

• To write a novel

• To design a website

What is a search algorithm?

• An algorithm that sorts data

• An algorithm that finds items with specific properties within a collection

• An algorithm that compresses data

• An algorithm that encrypts data

How does a linear search algorithm work?

• It checks every element in the list until the target is found

• It divides the list into two parts and searches each part

• It sorts the list before searching

• It uses a hash table to find the target

What is the main advantage of a binary search over a linear search?

• It can search unsorted lists

• It is faster for large, sorted lists

• It uses less memory

• It can find multiple targets at once

Which of the following is NOT a characteristic of an algorithm?

• It must have a clear starting point

• It must have a clear ending point

• It must be ambiguous

• It must be effective