..:: Complexity Classes on Data Structure and Algorithms related Questions and Answers

Complexity Classes on Data Structure and Algorithms related Questions and Answers

Question : Problems that can be solved in polynomial time are known as?
1. intractable
2. tractable
3. decision
4. complete
Answer : 2 - tractable

* Be the First to Post a Comment.

Submit comment :

Ask Question

Note : Name and Email never shown.

Other Questions

Practice Paper sets

Complexity Classes on Data Structure and Algorithms related Questions and Answers

Submit comment :

Ask Question

JagSchool of Transformative Skills

PDPM Indian Institute of Information Technology Design Manufacturing

Global Institute Of Technology & Management

Institute for future education Entrepreneurship and leadership

Other Questions

Practice Paper sets

Complexity Classes on Data Structure and Algorithms related Questions and Answers

Submit comment :

Ask Question

Subscribe