Algorithms

Question 1

What is an Algorithm (1)

Answer 1

1.) An algorithm is a finite number of steps/instructions which solve a particular problem or task.

Question 2

Properties of algorithms (7)

Answer 2

1. ) Input.
2. ) Output.
3. ) Definitness.
4. ) Correctness.
5. ) Finitness.
6. ) Effectiveness.
7. ) Generality.

Question 3

Pseudocode (2)

Answer 3

1. ) Pseudocode is a description of what the code will do.

2. ) It is written in English like syntax but using typical coding indentation.

Question 4

Big O (2)

Answer 4

1. ) Classifies Algorithms based on how they react to a change in input size.
2. ) Letter O means the order of the algorithm.

Question 5

Worst case time complexity (1)

Answer 5

1.) Maximum number of operations that can be performed, given a problem size.

Question 6

Difference between Performance and Time Complexity

Answer 6

1. ) Performance refers to how much “computational power” is required and used by the algorithm.
2. ) Time complexity refers to how the resource requirements of an algorithm scale with the problem size.