Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
x = 5;
y_correct = 0.5;
assert(abs(polarised(x)-y_correct) < 1e-10)
ang =
0
ang =
1
|
2 | Pass |
x = 180;
y_correct = 0.5;
assert(abs(polarised(x)-y_correct) < 1e-10)
ang =
0
ang =
1
|
3 | Pass |
x = 365;
y_correct = 0.5;
assert(abs(polarised(x)-y_correct) < 1e-10)
ang =
0
ang =
1
|
4 | Pass |
x = [91, 1];
y_correct = 0;
assert(abs(polarised(x)-y_correct) < 1e-10)
ang =
3.7494e-33
|
5 | Pass |
a = randi([-360, 360]);
b = 90*(1+2*randi([-3, 3]));
x = [a, a+b];
y_correct = 0;
assert(abs(polarised(x)-y_correct) < 1e-10)
ang =
9.3735e-32
|
6 | Pass |
a = randi([-360, 360]);
b = 90*(1+2*randi([-3, 3]));
x = [a, a+b];
y_correct = 0;
assert(abs(polarised(x)-y_correct) < 1e-10)
ang =
9.3735e-32
|
7 | Pass |
x = [0, 22.5];
y_correct = 0.85355339059/2;
assert(abs(polarised(x)-y_correct) < 1e-10)
ang =
0.8536
|
8 | Pass |
x = [0, -45];
y_correct = 0.25;
assert(abs(polarised(x)-y_correct) < 1e-10)
ang =
0.5000
|
9 | Pass |
x = [5, 140];
y_correct = 0.25;
assert(abs(polarised(x)-y_correct) < 1e-10)
ang =
0.5000
|
10 | Pass |
x = 5 + (1:5)*22.5;
y_correct = 0.53079004294/2;
assert(abs(polarised(x)-y_correct) < 1e-10)
ang =
0.8536 0.8536 0.8536 0.8536
|
Swap the first and last columns
12410 Solvers
651 Solvers
Program an exclusive OR operation with logical operators
639 Solvers
484 Solvers
Check that number is whole number
1070 Solvers
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!