MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 3 Mcqs, each offering curated multiple-choice questions to sharpen your P, NP, NP-hard, NP-complete Complexity Classes Multiple Choice knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
To which class does the Euler s circuit problem belong? |
| A. | P class |
| B. | NP class |
| C. | Partition class |
| D. | Complete class |
| Answer» B. NP class | |
| 2. |
The Euler s circuit problem can be solved in? |
| A. | O(N) |
| B. | O( N log N) |
| C. | O(log N) |
| D. | O(N<sup>2</sup>) |
| Answer» E. | |
| 3. |
_________ is the class of decision problems that can be solved by non-deterministic polynomial algorithms. |
| A. | NP |
| B. | P |
| C. | Hard |
| D. | Complete |
| Answer» B. P | |