Preliminary Algorithm and Complexities Examination

Algorithms are named after the 9th-century Persian mathematician _____________________.

__________________ refers to an informal high-level description of the operating principle of a computer program or algorithm.

The ____________________________ can be understood as the amount of space required by an algorithm to run to completion.

The term ____________________________ measures how many steps are required by the algorithm to solve the given problem.

List down the 2 types of algorithms in approximate of time.

List down at least 8 Characteristics of Algorithm

List down the 3 Asymptotic Notations used to calculate the running time complexity of an algorithm.

_________________________ imposes a complexity of O (log(N)). It undergoes the execution of the order of log (N) steps. To perform operations on N elements, it often takes the logarithmic base as 2.

• Logarithmic Complexity

• Quadratic Complexity

• Constant Complexity

• Linear Complexity

• Cubic Complexity

_________________________ It imposes a complexity of O (n^2). For N input data size, it undergoes the order of N^2 count of operations on N number of elements for solving a given problem.

• Logarithmic Complexity

• Quadratic Complexity

• Constant Complexity

• Linear Complexity

• Cubic Complexity

_________________________ Imposes a complexity of O (N). It encompasses the same number of steps as that of the total number of elements to implement an operation on N elements.

• Logarithmic Complexity

• Quadratic Complexity

• Constant Complexity

• Linear Complexity

• Cubic Complexity