Data Algorithms — Learn free

Self-check

Questions 1–10 of 10

1. What is an algorithm?
Question 1A. A programming language used to store dataB. A procedure consisting of multiple steps with a set of instructions for a desired resultC. A table that holds the output of a queryD. A hardware device that speeds up processingE. A diagram of how data flows between systems
2. What does it mean to say that an algorithm is independent of any language?
Question 2A. It can only be written in EnglishB. It must be written in one specific programming languageC. It cannot be implemented by a computer at allD. It can be implemented in any programming languageE. It works only on data stored in a single language
3. What does the Unambiguous characteristic of an algorithm require?
Question 3A. Each step and each input or output should be clear and lead to only one meaningB. The algorithm should have no inputs at allC. The algorithm should produce several different outputs for the same inputD. The algorithm should be written without commentsE. The algorithm should run in under one second
4. How many inputs may a well-formed algorithm have?
Question 4A. Exactly one inputB. At least two inputsC. Zero or more well-defined inputsD. Exactly as many inputs as outputsE. No inputs, since inputs make it ambiguous
5. What does the Output characteristic of an algorithm state?
Question 5A. It may have zero outputsB. It should produce an output only when there is an errorC. Its output does not need to match what was desiredD. It should always produce exactly one outputE. It should have one or more well-defined outputs that match the desired output
6. Which characteristic of an algorithm is described by Finiteness?
Question 6A. It must use a limited amount of memoryB. It must terminate after a finite number of stepsC. It must be written in fewer than one hundred linesD. It must handle only a finite set of data typesE. It must be run a finite number of times per day
7. What does the Feasibility characteristic of an algorithm mean?
Question 7A. It should be achievable with the available resourcesB. It should be free of any inputsC. It should be written by more than one developerD. It should be executed on the cloudE. It should be the fastest possible solution
8. Which of the following is NOT one of the ways an algorithm behaves from a data point of view?
Question 8A. Search an item in a data structureB. Sort items in a certain orderC. Insert an item into a data structureD. Compress a data structure to save spaceE. Delete an existing item from a data structure
9. Which data algorithm behaviour arranges items in a certain order?
Question 9A. SearchB. InsertC. SortD. UpdateE. Delete
10. Which characteristic says an algorithm should have step-by-step directions that do not depend on any programming code?
Question 10A. UnambiguousB. FinitenessC. FeasibilityD. OutputE. Independent