Complexity Classes on Data Structure and Algorithms related Questions and Answers - Page 5

Question 41 : To which of the following class does a CNF-satisfiability problem belong?
1. NP class
2. P class
3. NP complete
4. NP hard
View Answer   Discuss with Members

Question 42 : Who invented the inclusion-exclusion principle to solve the Hamiltonian path problem?
1. Karp
2. Leonard Adleman
3. Andreas Bjorklund
4. Martello
View Answer   Discuss with Members

Question 43 : The sum and composition of two polynomials are always polynomials.
1. true
2. false
3.
4.
View Answer   Discuss with Members

Question 45 : The Euler's circuit problem can be solved in?
1. O(N)
2. O( N log N)
3. O(log N)
4. O(N2)
View Answer   Discuss with Members


View 41 - 45 of 45 Questions

* Be the First to Post a Comment.

Submit comment :


Captcha Image
Reload

Ask Question

Captcha Image
Reload

Note : Name and Email never shown.





Subscribe


Become a part of EducationForever. Subscribe to our FREE Newsletter