start

declare x, i=2

read n

if i<n & n/i==0

print "n is not prime number" goto 9

else

i=i+1 goto 4

print "n is prime number"

stop

start 

input 3 numbers (a,b,c)

store the value in variables (a,b,c)

if (a>b)

  a if(a>c)

    print,a is greatest

    else,print c is greatest 

 else if (b>c)

   if true print ,b is greatest 

   else, c is greatest 

   stop

start

input i=0

i=i+2

print i

while i<99 repeat step 3 and 4

stop

function Analyser (M)                                        //legacy   application                       

                         features =   array ()                     

                            Do While on files

                 If(file ==class) {

                File return = components (file);

                If (File return ==true){

                    Features[]  =   file.name;

}                              

                                   end while

        SF←feature.components               //proposed microservice                                            

           End function

​

sdaf

sdfdsf

sdfdsf

sdfds

sdfdsaf

sfsdf

​

Input: matrix M0, M1, input secret image S

Output: meaningless shares R1, R2, …, Rn, restored image Rs

​

For each pixel in secret image S as S(i, j) with size H*W that  1≤i<H ,  1≤j<W, 

Repeat 1, 2

    If S (i, j) = 0 select random row in M0 and insert in shares R1(i, j), R2(i, j), …, Rn (i, j)

If S (i, j) = 1 select random row in M1 and insert in shares R1(i, j), R2(i, j), …, Rn (i, j)

​