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

543 users

0 votes

Hello and good morning,

I´m currently working on an Compose Algorithm example and I´ve come to a case I don´t know how to proceed.

I´m supposed to replace every d (and that´s the "problem") in this BDD (Screenshot 1) by this BDD (Screenshot 2). In the first step the case in line 4 of the algorithm "elsif x = label(phi) then return ITE(alpha, high(phi),low(phi))" holds. Now I have a whole BDD as the If-condition in the ITE operator and I don´t know how to proceed. Until now, I only had BDD(0) or BDD(1) as the if-condition when I was supposed to use ITE. I´ve thought about something like this (Screenshot 3) but even if this is correct I dont know how to finish.

I hope I´ve pointed my problem out clear enough.

Thank you in advance for any responses.

Best regards.

in # Mandatory Modules Bachelor by (1.2k points)

1 Answer

+1 vote
 
Best answer

Yes, you can use the ITE algorithm with three BDDs as operands. That is the core problem solved by the ITE algorithm. Once you have figured out the three BDDs which are the operands of the ITE algorithm, then you simple follow the steps of the ITE algorithm:

Maybe I don't understand what your problem there is?

by (166k points)
selected by
Okay that actually seems to be pretty easy. Honestly, I´ve not yet discovered that slide.

Thank you very much.
Yes, there are really many slides. But slide 32 which presents the ITE algorithm as a kind of program is also fine. It's a matter of taste, which version you prefer.

Related questions

+1 vote
1 answer
0 votes
1 answer
0 votes
1 answer
+1 vote
1 answer
0 votes
1 answer
Imprint | Privacy Policy
...