Here you can ask questions and find or give answers to organizational, academic and other questions about studying computer science.

1.1k questions

1.2k answers

1.6k comments

524 users

0 votes
Hello,

please take a look at the solution of exam in August 2019, no. 3d). Why are there no deadends in the state set of the universal predecessors?

Thanks

Edit: Also, please take a look at the solution in the same exam, no. 7b). The trace of [(Fb) SU (!a & Xa)] is wrong, correct? It should be the same trace as [b SU (!a & Xa)].
in * TF "Emb. Sys. and Rob." by (280 points)
edited by

1 Answer

0 votes
 
Best answer
I remember that I corrected the example solution of problem 3d of the 2019-08 exam already. There was a bug, but the current solution you find in the web should be correct now. Please double check, I guess you have considered an outdated version.

Second point: yes there is mistake in the trace you mentioned. It is corrected now.
by (165k points)
selected by

Related questions

Imprint | Privacy Policy
...