Algorithm can be represented graphically using...........................

...............................is defined as step by step procedure for solving a particular problem

An Algorithm's performance an be analysed by using............................

..............................is defined as the amount of Computer time required to complete the execution of a program/problem

Upper bound running time complexity of an algorithm is also called as.....................

.......................is the amount of computer memory required to the execute the program /problem.

Lower bound running time complexity of an algorithm is also called as.................

............................Notation is used to represent strict upper bound running time complexity of an algotihm

............................Notation is used to represent strict lower bound running time complexity of an algorithm.

.................................notation denotes Average case Time complexity

........................................Notations are called as Asymptotic Notations.

......................is used to represent strict upper bound running time complexity where as.................is used to represent upper bound running time complexity of an algorithm.

......................is used to represent strict lower bound running time complexity where as.................is used to represent lower bound running time complexity of an algorithm.

Let f(n) and g(n) be two non-negative functions,f(n)=O(g(n)) if and only if..........................

Let f(n) and g(n) be two non-negative functions,f(n)= $\omega$  (g(n)) if and only if..........................

Let f(n) and g(n) be two non-negative functions,f(n)=  $\theta$  (g(n)) if and only if..........................

...................................are the characteristics of an algorithm

Find the time complexity for the following algorithm using step count method.

Algorithm sum(a,n)

{

nsum=0;

for(i=1;i<=n;i++)

{

nsum=nsum+a[i];

}

}

Find the space complexity for the following algorithm

Algorithm sum(a,b,c)

{

a=10;

b=20;

c=30;

d=a+b+c;

}