Search the courses, subjects, tracks, games and features, or jump straight to a page.
5 cards from this section. Quick, good the night before a test.
What does it mean for an algorithm to be finite?
Think about what happens if there is no end to the steps.
Give an example of an input in an algorithm.
Consider what kind of data you would provide to an algorithm.
What does 'finiteness' mean in an algorithm?
Consider what happens if an algorithm never stops.
True or False: Every algorithm must accept at least one input.
Think about algorithms that do not require any external data.
Design an algorithm to calculate the factorial of a number. Describe how it meets the five features of a good algorithm.
Think about how the factorial operation is defined.
Explain how a poorly defined algorithm might affect software development. Provide an example.
Consider the typical development cycle and where errors might creep in.
5 more questions in this section. Enroll free to practise them all.
Enroll free