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


538 users

0 votes

I don't know if this has been mentioned before, but in ws17 ex. 5a) the truth table is wrong for x,y,z=0. According to my calculations, f should be 0. Will the BDD change and how?
Also, another question referring 5c): Why do we connect the c node with the d node when c=1 and not vice versa?
in # Mandatory Modules Bachelor by (380 points)
I don't find a mistake in that exam paper, can you double-check which exam paper and exercise it is, and maybe you can edit your question and add the function we talk about to make sure that we do not look at different problems.
I think I calculated the implication before the XOR operation.I didn't know the priority order I guess.
The precedences are as follows:
    1. EQV
    2. IMP
    3. OR
    4. XOR
    5. AND
    6. NEG

1 Answer

0 votes

So, I guess the first question is already answered if it was a wrong use of the operator precedences: XOR binds stronger than implication. If you have doubts about something like this, please ask in exams.

For problem 5c, one should compute the conjunction of BDDs for ((a∧¬b)∨c) and a∧b∧¬d ∨ ¬a which should produce the following BDDs:

  &  =   

Note that the ordering is given and therefore c must occur before d on the paths.

by (166k points)

Related questions

0 votes
1 answer
0 votes
1 answer
asked Aug 23, 2020 in # Mandatory Modules Bachelor by kremenadla (380 points)
0 votes
1 answer
+1 vote
1 answer
asked Jun 3, 2020 in * Other Teaching Fields by wei (190 points)
0 votes
1 answer
Imprint | Privacy Policy