ExamTopics Logo
Mail Us[email protected]
Menu
Comptia Discussions
exam questions

Exam DY0-001 All Questions

View all questions & answers for the DY0-001 exam
Go to Exam

Exam DY0-001 topic 1 question 80 discussion

Actual exam question from CompTIA's DY0-001
Question #: 80
Topic #: 1
[All DY0-001 Questions]

Which of the following is best solved with graph theory?

  • A. Optical character recognition
  • B. Traveling salesman
  • C. Fraud detection
  • D. One-armed bandit
Show Suggested Answer Hide Answer
Suggested Answer: B 🗳️
by SuntzuLegacy at May 20, 2025, 12:09 a.m.

Comments

Chosen Answer:
This is a voting comment (?). It is better to Upvote an existing comment if you don't have anything to add.
Switch to a voting comment New
Submit Cancel
SuntzuLegacy
1 month, 1 week ago
Selected Answer: B
B. Traveling salesman. The traveling salesman problem is fundamentally a graph-theory problem in which one seeks a route that visits each node exactly once while minimizing travel distance or cost.
upvoted 1 times
...
Community vote distribution
A (35%)
C (25%)
B (20%)
Other
Most Voted
A voting comment increases the vote count for the chosen answer by one.

Upvoting a comment with a selected answer will also increase the vote count towards that answer by one. So if you see a comment that you already agree with, you can upvote it instead of posting a new comment.

SaveCancel