Solve each problem for 't'
- int
t=0;
for (int a=1; a<=6; a++)
t = t + a;
t = t + 4;
t=25
- int
t=2, a=4, b=7;
do
{
t=t+a*b;
a++;
b+=2;
} while
(b<12)
t=141
- int
t=0, a, b, c, d;
for (a=1;a<=4;a++)
{
for (b=4;b>=0;b--)
{
if (a==b) t=t+2;
else t=t+3;
t++;
}
t=t+3;
}
t=88
- int
a,b,c,d,t;
a=4;b=7;c=10;t=0;
t=(a%3) * (c/b) + b*a;
t=29
5. int a,b,c,d,t;
t=0;d=4;
for (a=1;a<7;a+=2)
{
t=t+a%3
t -=3;
for (b=1;b<=a;b++)
{
t=t+b;
if (b<2) t++;
else
{
t++;
d=d+2;
}
t=t+a;
}
t=t+a;
}
t=69
- int
n[]=new int [10];
int t=0;
int a,b,c,d;
d=3;
for (a=0; a<=9;a++)
{
n[a]=d;
d=d+2;
}
for (c=1; c<=9;c=c+2)
t=t+n[c];
t=65
- int
t=0;
String cat =
“123ABC4512”;
int a=cat.indexOf(“3”,3);
int b=cat.indexOf(“1”,0);
b=b%3;
t=t+a*b;
t= -3
- int
t,a,b,c;
t=0;
for (a=1;a<4;a++)
{
for (b=1;b<4;b++)
{
for (c=1;c<5;c++)
{
t=t+c;
t++;
}
}
t=t+a;
}
t=132
ADVANCED
PRACTICE PROBLEMS
| Answers to first 30 problems
1. t = 8
2. t = 10
3. t = 20
4. t = -48
5. t = -42
6. t = 18
7. t = 228
8. t = 140
9. t = 54
10. t = 216
11. t = 220
12. t = 190
13. t = 182
14. t = 38
15. t = 24
16. t = 22
17. t = 65
18. t = 15
19. t = 12
20. t = 34
21. t = 10
22. t = 16
23. t = 24
24. t = 46
25. t = 41
26. t = 96
27. t = 42
28. t = 49
29. t = 38
30. t = 150
31. t=700
32. t=1625
33. t=125
34. t=575
35. t=650
36. t=535
37. t=-630 |
1.
int a,t;
t=0;
for(a=1;a<5;a=a+1)
t=t+2;
2.
int a,t;
t=0;
for(a=1;a<5;a=a+1)
t=t+a;
3.
int a,t,c;
t=0; c=2;
for(a=1;a<5;a=a+1)
t=t+a*c;
4.
int a,t,c;
t=0; c=3;
for(a=1;a<=7;a=a+2)
t=t-a*c;
5.
int a,t.c;
t=0; c=-2;
for(a=5;a<=10;a=a+2)
t=t+a*c;
6.
int a,t,c;
t=0; c=2;
for(a=5;a<=10;a=a+2)
t=a*c;
7.
int a,t.c;
t=0; c=4;
for(a=12;a>6;a=a-1)
t=t+a*c;
8.
int a,t.c;
t=0; c=4;
for(a=12;a>=6;a=a-2)
t=t+a*c-1;
9.
int a,t.c,f;
t=0; c=4; f=3;
for(a=f;a<=6;a=a+1)
t=t+a*f;
10.
int a,t.c,f,g;
t=0; c=4; f=3; g=9;
for(a=f;a<=g;a=a+2)
t=t+a*g;
11.
int a,t.c,f,g;
t=0; c=4; f=3; g=9;
for(a=f;a<=g;a=a+2)
{
t=t+a*g;
t++;
}
12.
int a,t.c,f,g;
t=0; c=4; f=6; g=9;
for(a=2;a<=f;a=a+1)
{
t=t+a*g;
t=t+2;
}
13.
int a,t.c,f,g;
t=0; c=4; f=6; g=9;
for(a=2;a<=f;a=a+1)
{
t=t+a*g;
if(a==f)
t=t+2;
}
14.
int a,t.c,f,g;
t=0; c=4; f=6; g=9;
for(a=2;a<=6;a=a+1)
{
t=t+a;
if(a<3)
t=t+2;
else
t=t+4;
}
15.
int a,t.c,f,g;
t=0; c=4; f=6; g=9;
for(a=2;a<=7;a=a+2)
{
t=t+a;
if(a>=3)
t=t+2;
else
t=t+5;
t++;
}
16.
int a,t.c,f,g;
t=0; c=4; f=6; g=9;
for(a=2;a<=7;a=a+2)
{
t=t+a;
if(a>=3)
t=t+2;
else
{
t=t+5;
t++;
}
}
17.
int a,t.c,f,g;
t=0; c=4; f=6; g=9;
for(a=2;a<=7;a=a+2)
{
t=t+a;
if(a<=3)
{
t=t+2;
g=g-1;
}
else
{
t=t+g;
t++;
}
t=t+11;
}
18.
int a,b,t.c,f,g;
t=0; c=4; f=6; g=9;
for(a=2;a<=7;a=a+2)
{
t=t+1;
for(b=2;b<4;b=b+1)
t=t+2;
}
19.
int a,b,t.c,f,g;
t=0; c=4; f=6; g=9;
for(a=2;a<=7;a=a+2)
{
t=t+1;
for(b=2;b<4;b=b+1)
t=t+2;
t=t-1;
}
20.
int a,b,t.c,f,g;
t=0; c=4; f=6; g=9;
for(a=c;a<=7;a=a+1)
t=t+g;
for(b=2;b<4;b=b+1)
t=t+2;
t=t-f;
21.
int a,b,t.c,f,g;
t=0; c=4; f=6; g=9;
for(a=1;a<4;a++)
{
for(b=1;b<=a;b++)
t+=b;
}
22.
int a,b,t.c,f,g;
t=0; c=4; f=6; g=9;
for(a=1;a<4;a++)
{
for(b=1;b<=a;b++)
t+=b;
t=t+a;
}
23.
int a,b,t.c,f,g;
t=0; c=4; f=6; g=9;
for(a=1;a<=3;a++)
{
for(b=1;b<=a;b++)
{
t+=b;
t=t+a;
}
}
24.
int a,b,t.c,f,g;
t=0; c=4; f=6; g=9;
for(a=1;a<=3;a++)
{
for(b=a;b<=5;b++)
{
t+=2;
t=t+a;
}
}
25.
int a,b,t.c,f,g;
t=0; c=4; f=6; g=9;
for(a=1;a<=3;a++)
{
t=t+a;
for(b=a;b>=0;b--)
{
t+=2;
t=t+a;
}
t=t-1;
}
26.
int a,b,t.c,f,g;
t=0; c=4; f=6; g=9;
for(a=1;a<=4;a++)
{
for(b=1;b<4;b++)
{
for(c=1;c<5;c++)
t=t+2;
}
}
27.
int a,b,t.c,f,g;
t=0; c=4; f=6; g=9;
for(a=1;a<=4;a++)
{
for(b=1;b<4;b++)
{
t++;
if(a == b)
{
for(c=1;c<5;c++)
t=t+c;
}
}
}
28.
int a,b,t.c,f,g;
t=0; c=4; f=6; g=9;
for(a=1;a<=4;a++)
for(b=a;b<4;b++)
for(c=b;c<5;c++)
t=t+c;
29.
int a,b,t.c,f,g;
t=0; c=4; f=6; g=9;
for(a=1;a<=4;a++)
for(b=4;b>=0;b=b-1)
{
if (a==b) t=t+2;
else t=t+b;
}
30.
int a,b,t.c,f,g;
t=0; c=4; f=6; g=9;
for(a=1;a<=4;a++)
for(b=4;b>=0;b=b-1)
for(c=a;c<=b;c++)
t=t+a+b+c;
IN ALL THE PROBLEMS BELOW,
ASSUME THAT n IS AN
ARRAY THAT IS INT AND 5 BY 5 BIG AND ALREADY CONTAINS THE FOLLOWING
VALUES:
5, 10 ….25
in row 0
30, 35…50 in row 1
55,60….75 in row 2
80, 85….100 in row 3
105,110..125 in row 4
31.
int a,b,t.c,f,g;
t=0; c=4; f=6; g=9;
for(a=0;a<=4;a++)
t=t+n[a][2] +n[a][4];
32.
int a,b,t.c,f,g;
t=0; c=4; f=6; g=9;
for(a=0;a<=4;a++)
for(b=0;b<=4;b++)
t=t+n[a][b];
33.
int a,b,t.c,f,g;
t=0; c=4; f=6; g=9;
int hogh=0;
for(a=0;a<=4;a++)
{
for(b=0;b<=4;b++)
{
if(n[a][b] > high)
high=n[a][b];
}
}
t = high;
34.
int a,b,t.c,f,g;
t=0; c=4; f=6; g=9;
int hogh=0;
for(a=0;a<=4;a++)
{
t+=n[a][0]
+ n[a][4]-n[0][a];
}
35.
int a,b,t.c,f,g;
t=0; c=4; f=6; g=9;
int hogh=0;
for(a=0;a<=4;a++)
t+=n[a][a] +n[a][4-a];
36. int
n[][]=new int[10][10];
int t,a,b,c,d;
t=0; c=4;
for (a=0;a<=9;a++)
{
for (b=0;b<=9;b++)
{
n[b][a]=c;
c++;
}
}
for (c=0;c<=9;c++)
t=t+n[c][c];
37. int a,b,c,d,e,t;
t=0;a=4;b=6;c=10;
int n[][]=new int[10][10];
int g[] = new int [10];
for ( int r=0;r<=9;r++)
{
g[9-r] =b-a;
for (int f=9;f>=0;f--)
{
g[9-r]
=g[9-r] + 1;
n[f][r]
= b;
b++;
}
}
for ( int aa=0;aa<=9;aa=aa+3)
{
for (int bb=0;bb<=9;bb++)
n[aa][bb]=n[bb][aa]
+ g[bb];
}
for ( int ss=0; ss<=9; ss++)
t=t+n[ss][ss]-n[9][ss];
