1.

Which of the following logical operation can’t be implemented by polynomial time graph manipulation algorithms using Binary Decision Diagrams?(a) Conjunction(b) Disjunction(c) Negation(d) Tautology CheckingI'd like to ask this question from Binary Decision Diagrams &And Inverter Graph in section Graph of Data Structures & Algorithms IThe question was asked in a job interview.

Answer»

The correct answer is (d) Tautology CHECKING

Explanation: In BINARY Decision DIAGRAM, Conjunction, Disjunction, Negotiation can be IMPLEMENTED in polynomial time whereas tautology checking can be implemented in linear time.



Discussion

No Comment Found

Related InterviewSolutions