1- What is an Algorithm?

2- Define each of them

Sort

Insert

Update

Delete

3- List Characteristics of an Algorithm?

4- Give me one example of an algorithm

5- What are asymptotic analysis, we can easily conclude?

6- Define each of them

Worst case

Average case

Best case

7- Example of best-case?

8- What the commonly used asymptotic notations used for calculating the running time complexity?

True and false

1- Algorithms are generally created independent of underlying languages ( )

2- Finiteness Algorithms must terminate after a finite number of steps. ( )

3- Feasibility Should be feasible with the available resources ( )

4- Independent An algorithm should have step-by-step directions ( )

5- Space complexity It is a way of representing the amount of time needed by a program to run to the completion ( )

6- Time complexity It is the amount of memory space required by an algorithm, during a course of its execution ( )

7- Specification: Description of the computational procedure ( )

8- Pre-conditions: The condition(s) on input while Post-conditions: The condition(s) on output ( )

9- Body of the Algorithm: A sequence of clear and unambiguous instructions. ( )

10- Worst case: It defines the input for which the algorithm takes the huge time ( )

11- Average case: It takes average time for the program execution ( )

12- Best case: It defines the input for which the algorithm takes the lowest time ( )

13- Big oh Notation () specifically describes worst case scenario. ( )

14- Theta Notation () This notation represents the average complexity of an algorith ( )

15- Omega Notation () specifically describes best case scenario. ( )