CompTIA Exam DY0-001 Topic 4 Question 8 Discussion

Actual exam question for CompTIA's DY0-001 exam

Question #: 8
Topic #: 4

[All DY0-001 Questions]

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

Aupdate priors as more data is seen.

Bexamine even/ node of a tree before making a decision.

Capply a theoretical model to the distribution of the data.

Dmake the locally optimal decision.

Show Suggested Answer

Suggested Answer: D

Greedy algorithms build the solution iteratively by choosing at each step the option that appears best at that moment, without reconsidering earlier choices.

by Rusty at Jul 14, 2025, 12:25 AM

Limited Time Offer

25%

Off

Get Premium DY0-001 Questions as Interactive Web-Based Practice Test or PDF

Contribute your Thoughts:

Submit Cancel

Boris

2 days ago

I think it means making the locally optimal decision.

upvoted 0 times

...

Bernardine

4 days ago

What do you think the term 'greedy algorithms' refers to?

upvoted 0 times

...