Data Algorithms
From the book I Am Datapedia!, published here free by the author.
Part of I Am Datapedia!
Questions 1–10 of 10
1. What is an algorithm?
2. What does it mean to say that an algorithm is independent of any language?
3. What does the Unambiguous characteristic of an algorithm require?
4. How many inputs may a well-formed algorithm have?
5. What does the Output characteristic of an algorithm state?
6. Which characteristic of an algorithm is described by Finiteness?
7. What does the Feasibility characteristic of an algorithm mean?
8. Which of the following is NOT one of the ways an algorithm behaves from a data point of view?
9. Which data algorithm behaviour arranges items in a certain order?
10. Which characteristic says an algorithm should have step-by-step directions that do not depend on any programming code?