Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
p=[2 0 -4 0 -1 1];
a=-2;
b=4;
f = @(x) polyval(p,x);
assert(isequal(trapezoidal_rule(f,a,b,1),5280))
|
2 | Pass |
p=[2 0 -4 0 -1 1];
a=-2;
b=4;
f = @(x) polyval(p,x);
assert(isequal(trapezoidal_rule(f,a,b,2),2634))
|
3 | Pass |
p=[2 0 -4 0 -1 1];
a=-2;
b=4;
f = @(x) polyval(p,x);
assert(isequal(trapezoidal_rule(f,a,b,4),1516.875))
|
4 | Pass |
p=[2 0 -4 0 -1 1];
a=-2;
b=4;
f = @(x) polyval(p,x);
P=polyint(p);
I_correct=polyval(P,b)-polyval(P,a);
I=trapezoidal_rule(f,a,b);
assert(abs(I-I_correct)<1)
|
5 | Pass |
p=[2 0 -4 0 -1 1];
a=-2;
b=4;
f = @(x) polyval(p,x);
I = trapezoidal_rule(f,a,b,1000);
P=polyint(p);
I_correct=polyval(P,b)-polyval(P,a);
assert(abs(trapezoidal_rule(f,a,b,1000)-I_correct)<1e-1)
|
3879 Solvers
Sum all integers from 1 to 2^n
6335 Solvers
Back to basics 24 - Symbolic variables
115 Solvers
190 Solvers
MATCH THE STRINGS (2 CHAR) very easy
194 Solvers