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

529 users

0 votes

According to the question statement- 

Formula x3 ∨ x4 should be considered 'alpha' in the algorithm and other diagram should be a ϕ. But in the solution, it is given vise.versa. 

I am referring to the below algorithm-

is the solution in the exam paper correct?

in * TF "Emb. Sys. and Rob." by (1.1k points)

1 Answer

0 votes
 
Best answer

The solution is correct. You can use the teaching tool to convince yourself about this: Use the tool https://es.cs.uni-kl.de/tools/teaching/BDDAlgorithms.html, and select 

  • action = Compose
  • style = Show false leaf
  • variable ordering : x1;x2;x3;x4
  • first operand (bdd1) : x3 | x4
  • second operand (bdd2) : true ⊕ x1 ⊕ x2 ⊕ x3 ⊕ x4
  • variable for compose: x2

This will compute the BDD for [true ⊕ x1 ⊕ x2 ⊕ x3 ⊕ x4]{x2 := x3 | x4}, i.e., the BDD for true ⊕ x1 ⊕ (x3 | x4) ⊕ x3 ⊕ x4.

by (166k points)
selected by

Related questions

0 votes
1 answer
asked Jan 25, 2021 in * TF "Emb. Sys. and Rob." by dn (1.4k points)
0 votes
1 answer
0 votes
1 answer
0 votes
1 answer
asked Jan 18, 2021 in * TF "Emb. Sys. and Rob." by MS (1.1k points)
Imprint | Privacy Policy
...