Capgemini Pseudo Code Questions Quiz-1

int sum (int B[], int n)

{

  int s = 0, j;

  for (j = 0; j < n; j++)

    s = s + B[i];

  return s;

}// sizeof(int) = 2 bytes

For input e = 7 & f = 8.

  work (input e, input f)

  If (e < f)

  return work (f, e)

  elseif (f != 0)

  return (e + work (e, f - 1))

  else

  return 0

Input p = 9, w = 6 ,

p = p + 1 ;

w = w - 1 ;

p = p + w 

if (p > w)

  print p

else

  print w

Input t = 6, h = 9 and set x = 0 

Integer c 

if (h > t)

  for (c = t; c < h; c = c + 1)

    x = x + c 

  End for loop

  print x

else

    print error message print x

integer i

set i=3

do

print i+3

i=i-1

while( i not equals 0)

end while

Integer a, b, c, sum

Read a, b, c

Set sum = a + b + c

if ((sum EQUALS 180) and (a NOT EQUALS 0) and (b NOT EQUALS 0) and (c NOT EQUALS 0)) 

  Print " Success"

Otherwise

  Print "Fail"

End if

Integer funn(Integer a, Integer b)

	if(a > 0) 

		if(b > 0)

			return a + b + funn(a + 1, 0) + funn(a + 2, 0) + funn(a + 3, 0) 

		End if 

	End if

	return a + b 

End function funn()

Integer count

	for (each count from 0 to 9)

		print "#" 

		if (count > 6)	

			CONTINUE 

		print count 

	End for

public void func (Tree root)

{

  func (root.left ());

  func (root.right ());

  System.out.println (root.data ());

}

a) public void min (Tree root)

{

  while (root.left () != null)

    {

      root = root.left ();

    }

  System.out.println (root.data ());

}

b) public void min (Tree root)

{

  while (root != null)

    {

      root = root.left ();

    }

  System.out.println (root.data ());

}

c) public void min (Tree root)

{

  while (root.right () != null)

    {

      root = root.right ();

    }

  System.out.println (root.data ());

}

d) public void min (Tree root)

{

  while (root != null)

    {

      root = root.right ();

    }

  System.out.println (root.data ());

}