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


546 users

0 votes

2023.02.15 question paper, 

here the question is to find the universal predecessor of (q & (p | a)) . 

But while starting it's denoted as Pre.forall ( p xor q) . it should be  Pre.forall ( q & (p | a)) .is it ?

From where p xor q came?

in # Study-Organisation (Master) by (2.7k points)

1 Answer

+1 vote
Best answer
Yes, that seems to be a solution from another exam problem!
by (166k points)
selected by
Thanks for the clarification
But actually, it is just the argument the pre-operator that is wrong, the rest seems to be allright.

Related questions

Imprint | Privacy Policy