This solution is outdated. To rescore this solution, sign in.
Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
% Ask a Knight whether 4 is prime
% (he will respond false; your function should respond true)
A=true; X=@isprime; str='X(4)';
f0=inline('logical(interp1([0,1],[0,x],1))','x','A','X');
F=@(str)xor(~A,f0(eval(str),A,X));
clear A X;
assert(isequal(AnswerGenerator(F,str),true))
X(4)
|
2 | Pass |
% Ask a Knave whether 4 is prime
% (he will respond true; your function should respond false)
A=false; X=@isprime; str='X(4)';
f0=inline('logical(interp1([0,1],[0,x],1))','x','A','X');
F=@(str)xor(~A,f0(eval(str),A,X));
clear A X;
assert(isequal(AnswerGenerator(F,str),false))
X(4)
|
3 | Pass |
% Ask a Knight whether he is a Knight
% (both Knights and Knaves would respond true and so should your function)
A=true; X=@isprime; str='A==true';
f0=inline('logical(interp1([0,1],[0,x],1))','x','A','X');
F=@(str)xor(~A,f0(eval(str),A,X));
clear A X;
assert(isequal(AnswerGenerator(F,str),true))
A==true
|
4 | Pass |
% Ask a Knave whether he is a Knight
% (both Knights and Knaves would respond true and so should your function)
A=false; X=@isprime; str='A==true';
f0=inline('logical(interp1([0,1],[0,x],1))','x','A','X');
F=@(str)xor(~A,f0(eval(str),A,X));
clear A X;
assert(isequal(AnswerGenerator(F,str),true))
A==true
|
5 | Pass |
% Ask a Knight whether he would respond affirmatively to the question of whether he is a Knight
% (a Knave would respond false to this same question, and so should your function)
A=true; X=@isprime; str='F(''A==true'')';
f0=inline('logical(interp1([0,1],[0,x],1))','x','A','X');
F=@(str)xor(~A,f0(eval(str),A,X));
clear A X;
assert(isequal(AnswerGenerator(F,str),false))
A==true
|
6 | Pass |
% Ask a Knave whether he would respond affirmatively to the question of whether he is a Knight
% (a Knight would respond true to this same question, and so should your function)
A=false; X=@isprime; str='F(''A==true'')';
f0=inline('logical(interp1([0,1],[0,x],1))','x','A','X');
F=@(str)xor(~A,f0(eval(str),A,X));
clear A X;
assert(isequal(AnswerGenerator(F,str),true))
A==true
|
7 | Pass |
A=true; X=@isprime; str='diff(X(2:3))';
f0=inline('logical(interp1([0,1],[0,x],1))','x','A','X');
F=@(str)xor(~A,f0(eval(str),A,X));
clear A X;
assert(isequal(AnswerGenerator(F,str),true))
diff(X(2:3))
|
8 | Pass |
A=false; X=@isprime; str='diff(X(2:3))';
f0=inline('logical(interp1([0,1],[0,x],1))','x','A','X');
F=@(str)xor(~A,f0(eval(str),A,X));
clear A X;
assert(isequal(AnswerGenerator(F,str),false))
diff(X(2:3))
|
9 | Pass |
A=true; X=@isprime; str='A==X(6)';
f0=inline('logical(interp1([0,1],[0,x],1))','x','A','X');
F=@(str)xor(~A,f0(eval(str),A,X));
clear A X;
assert(isequal(AnswerGenerator(F,str),false))
A==X(6)
|
10 | Pass |
A=false; X=@isprime; str='A==X(6)';
f0=inline('logical(interp1([0,1],[0,x],1))','x','A','X');
F=@(str)xor(~A,f0(eval(str),A,X));
clear A X;
assert(isequal(AnswerGenerator(F,str),false))
A==X(6)
|
11 | Pass |
A=true; X=@isprime; str='A&any(X(1:3))';
f0=inline('logical(interp1([0,1],[0,x],1))','x','A','X');
F=@(str)xor(~A,f0(eval(str),A,X));
clear A X;
assert(isequal(AnswerGenerator(F,str),true))
A&any(X(1:3))
|
12 | Pass |
A=false; X=@isprime; str='A&any(X(1:3))';
f0=inline('logical(interp1([0,1],[0,x],1))','x','A','X');
F=@(str)xor(~A,f0(eval(str),A,X));
clear A X;
assert(isequal(AnswerGenerator(F,str),true))
A&any(X(1:3))
|
13 | Pass |
A=true; X=@(x)rem(x,2); str='F(''F(''''X(3)'''')'')';
f0=inline('logical(interp1([0,1],[0,x],1))','x','A','X');
F=@(str)xor(~A,f0(eval(str),A,X));
clear A X;
assert(isequal(AnswerGenerator(F,str),false))
X(3)
|
14 | Pass |
A=false; X=@(x)rem(x,2); str='F(''F(''''X(3)'''')'')';
f0=inline('logical(interp1([0,1],[0,x],1))','x','A','X');
F=@(str)xor(~A,f0(eval(str),A,X));
clear A X;
assert(isequal(AnswerGenerator(F,str),true))
X(3)
|
Find relatively common elements in matrix rows
865 Solvers
Test if a Number is a Palindrome without using any String Operations
181 Solvers
128 Solvers
61 Solvers
Polite numbers. N-th polite number.
128 Solvers
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!