An algorithm is complete if

    • It terminates with a solution when one exists
    • It starts with a solution
    • It does not terminate with a solution
    • It has a loop
...

It terminates with a solution when one exists

If an algorithm concludes with a solution for every input falling within a given range and for the issues it was created to address, it is said to be complete.

In other words, for any acceptable input, a full algorithm will always yield a response, whether it is the answer to the question or evidence that there isn't one.

This attribute is crucial for preventing the algorithm from running endlessly without delivering a result and for preventing inaccurate or undefinable outcomes from being produced for legitimate inputs.

If you think above Mcq is wrong then please leave us comment with correct answers!

Leave comment below, Write your comment, Reply with your comment