+1 vote
in Data Structures & Algorithms I by (88.2k points)
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 Checking

I'd like to ask this question from Binary Decision Diagrams &  And Inverter Graph in section Graph of Data Structures & Algorithms I

The question was asked in a job interview.

1 Answer

+1 vote
by (737k points)
selected by
Best 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.

Related questions

Welcome to TalkJarvis QnA, a question-answer community website for the people by the people. On TalkJarvis QnA you can ask your doubts, curiosity, questions and whatever going in your mind either related to studies or others. Experts and people from different fields will answer.