Book of tasks on programming. Old version

 

 by Aliaksandr N. Prykhodzka

 

сервер, editor, винчестер, pascal, form, электронный репетитор, язык программирования, applet, select, hierarchy, string, сети Петри, javascript
 

for valuable work you must have JavaScript (allow active content)

Java. J.9. Nest of tasks. Type Boolean

 

 

Calculator

/ - division

\ - rest

S - sum of numbers from and to

P - multiply numbers from and to

J.9.1     Answer      Pascal-analogue      Visual Basic-analogue

Determine a value produced by function AA


boolean AA()
{
      int m=7;      int k=4;      int n=5;
      boolean b3=(m>k);
      boolean b2=(n>m) | b3;
      boolean b1=b2 & b3;
      return b1;
}

 

 

Calculator

/ - division

\ - rest

S - sum of numbers from and to

P - multiply numbers from and to

J.9.2     Answer      Pascal-analogue      Visual Basic-analogue

Determine a value produced by function AA


boolean AA()
{
      boolean b1=false;
      for (int i = 1; i < 6; i++) b1=b1 | (i % 3 == 0);
      return b1;
}

 

 

Calculator

/ - division

\ - rest

S - sum of numbers from and to

P - multiply numbers from and to

J.9.3     Answer      Pascal-analogue      Visual Basic-analogue

Determine a value produced by function AA


boolean AA()
{
      int k=0;
      for (int i = 1; i < 4; i++) k=k+i;
      int j=0;
      for (int i = 1; i < 4; i++) j=j+2;
      boolean b1=(k==j);
      return b1;
}

 

 

Calculator

/ - division

\ - rest

S - sum of numbers from and to

P - multiply numbers from and to

J.9.4     Answer      Pascal-analogue      Visual Basic-analogue

Determine a value produced by function AA


boolean AA()
{
      int i=5;      int j=15;
      boolean b1=true;
      for (int k = 7; k < 12; k++)
            b1=b1 & ((i>k) & (k<j));
      return b1;
}

 

©   Aliaksandr Prykhodzka    1993 - 2007