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 11 discussion

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

The term "greedy algorithms" refers to machine-learning algorithms that:

  • A. update priors as more data is seen.
  • B. examine every node of a tree before making a decision.
  • C. apply a theoretical model to the distribution of the data.
  • D. make the locally optimal decision.
Show Suggested Answer Hide Answer
Suggested Answer: D 🗳️
by SuntzuLegacy at May 19, 2025, 8:45 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: D
“Greedy algorithms” are those that always pick the locally optimal choice at each step, hoping it leads to a globally optimal solution. Therefore, the correct choice is: D. Make the locally optimal decision.
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