Answer the following statements true (T) or false (F)
1. An algorithm is a step-by-step sequence of instructions for carrying out some task.
2. A sequence of instructions for assembling a bookcase does not qualify as an “algorithm” since the instructions are not written in formal, mathematical notation.
3. For a precise, clearly-stated problem, there can be only one algorithm that solves that problem.
4. Big-Oh notation is used to measure the exact number of seconds required by a particular algorithm when executing on a particular computer.
5. Suppose you have been given a sorted list of 100 names and need to find a particular name in that list. Using sequential search, it is possible that you might have to look at every location in the list before finding the desired name.
1. TRUE
2. FALSE
3. FALSE
4. FALSE
5. TRUE
You might also like to view...
Windows 10 uses a(n) ________ account for easy access and storage of online files
A) eye OS B) Chrome C) iCloud D) OneDrive
Clicking the Clear All Formatting button removes the formatting from ________
A) the selected text and selected shapes B) only the selected shapes C) all text in the presentation D) only the selected text