It is a generic way of describing an algorithm without using any programming language-related notations.

• Notation

• Pseudocode

• Divide and conquer

• Flowchart

This characteristic of an algorithm indicates that the actions to be carried out must be rigorously and unambiguously specified.

• Effectiveness

• Output specification

• Input specification

• Definiteness

This indicates the location of a variable relative to the first element in an array.

• Notation

• Link

• Index

• Node

This is a general approach by which a variety of problems from different areas of computing can be solved algorithmically.

• Algorithm design techniques

• Understanding the problems

• Analyzation techniques

• Designing data structures

It pertains to a common pseudocode notation that performs a loop that has a condition at the end.

• If-Then-Else

• Repeat-Until

• While

• For

How many phases does the design and analysis of algorithm contain?

• Seven (7)

• Five (5)

• Six (6)

• Four (4)

It implies that the solution per problem may vary because of the different algorithms that can be used in solving.

• Analyzation techniques

• Designing data structures

• Algorithm design techniques

• Understanding the problems

It is a straightforward approach to solve a problem based on the problem statement and concept definition.

• Divide and conquer

• Brute force

• Linear structure

• Flowcharting

It pertains to the part of an algorithm that involves the determination of the computational complexity.

• Analysis

• Design

• Input

• Output

It is used to chain the data to be processed in a linked list.

• Notation

• Link

• Index

• Node