MCS-31 Block 1 Introduction To Algorithmics

Unit-2 Some Pre-requisites and Asymptotic Bounds

By Kirit A. D. (MBA, PMP, ITIL, MCTS, Six Sigma Black Belt)

10/27/2013 1

Content
Asymptotic Bounds Functions & Notations Modular Arithmetic/Mode Function Mathematical Expectation Principle of Mathematical Induction Concept of Efficiency of an algorithm Functions & Notations

10/27/2013

Functions & Notations

Elementary Algorithmics
N = {1, 2, 3, } I = {. , -2, -1, 0, 1 , 2 } R = set of Real Numbers. Summation: The expression a1 + a2 + .. +ai + . + an May be denoted in shorthand as

Product: The expression a1 x a2 x .. x ai x . x an May be denoted in shorthand as

=1 =1

Function Let f: I -> I be defined such that f(x) = x2 for all x I

3

10/27/2013

Mathematical Expectation
Elementary Algorithmics
Range of marks Percentage of students Who scored in the range 08 20 57 09 06 % marks Percentage of students Scoring the marks 08 20 57

0 % to 20% 20% to 40% 40% to 60% 60% to 80% 80% to 100%

10 30 50

70
90

09
06

=1

1 1 = 1 1 + ..

10/27/2013

Principle of Mathematical Induction

Elementary Algorithmics
10/27/2013

Concept of Efficiency of An Algorithm

Elementary Algorithmics Empirical Theoretical

10/27/2013

10/27/2013