Algorithms Practice Test

Question 1

What is the definition of an algorithm?

Accepted Answer

Step by step instructions used to solve a problem.

Answer

An algorithm is a finite set of well-defined, unambiguous instructions or a step-by-step procedure designed to solve a specific problem or perform a computation. It provides a clear, systematic method to achieve a desired output from a given input. This definition emphasizes the precise and sequential nature required for effective problem-solving.

Question 2

Isn't it true that algorithms are only used in computers?

Accepted Answer

A) False

Answer

Algorithms are not exclusively used in computers; they are fundamental to problem-solving in many aspects of daily life. Examples include recipes, assembly instructions for furniture, or even a set of directions to a location. Computers merely automate the execution of these step-by-step procedures, but the underlying logic is universally applicable.

Question 3

What's the difference between pseudocode and a flowchart?

Accepted Answer

A flowchart is a diagrammatic description of an algorithm, whilst pseudocode is a textual description of an algorithm.

Answer

A flowchart is a diagrammatic representation of an algorithm, using standardized graphical symbols and arrows to visually depict the sequence of operations and decisions. In contrast, pseudocode is a textual description of an algorithm, using a simplified, informal language that resembles programming code but is not executable. Both serve as planning tools to outline an algorithm's logic before actual coding.

Question 4

Why is it necessary to use a flowchart?

Accepted Answer

To plan a program before making it.

Answer

Flowcharts are necessary as a visual planning tool to design and understand the logical flow of a program before writing any code. They help in breaking down complex problems into manageable steps, identifying potential issues, and ensuring a clear, efficient solution. By visualizing the algorithm, it becomes easier to communicate, analyze, and refine the program's structure.

Question 5

The upper bound is defined by this algorithm analysis.

Accepted Answer

Big Oh

Answer

Big O notation (O) is used in algorithm analysis to describe the upper bound of an algorithm's running time or space complexity. It provides a worst-case scenario estimate, indicating the maximum amount of time or space an algorithm will take as the input size grows. This helps in understanding how an algorithm scales and performs under the most demanding conditions.