Skip to main content
Contents Index Dark Mode Prev Up Next Scratch ActiveCode Profile \(
\newcommand{\lt}{<}
\newcommand{\gt}{>}
\newcommand{\amp}{&}
\definecolor{fillinmathshade}{gray}{0.9}
\newcommand{\fillinmath}[1]{\mathchoice{\colorbox{fillinmathshade}{$\displaystyle \phantom{\,#1\,}$}}{\colorbox{fillinmathshade}{$\textstyle \phantom{\,#1\,}$}}{\colorbox{fillinmathshade}{$\scriptstyle \phantom{\,#1\,}$}}{\colorbox{fillinmathshade}{$\scriptscriptstyle\phantom{\,#1\,}$}}}
\)
Section 2.10 Self Check
Checkpoint 2.10.1 .
Which of the following algorithms has the least efficient big O complexity?
Incorrect, even though \(n^3\) is the most significant part for all of these formulas, the way it interacts with the rest of the equation is also important to note.
\(45 n^3 + 1710 n^2 + 16 n + 5\)
Incorrect, even though \(n^3\) is the most significant part for all of these formulas, the way it interacts with the rest of the equation is also important to note.
Correct!
A and B would be equally efficient/inefficient
Look closer, the efficiencies would be different
Checkpoint 2.10.2 .
Checkpoint 2.10.3 .
When considering computer resources, what factors do we have in mind? Select all that apply.
No, we do not consider the restraints of a language when thinking about how efficient an algorithm is.
Yes, we consider how much space we need to solve a problem.
Yes, we consider how much time it takes to solve a problem
No, we do not consider how much energy it takes at this point.
Checkpoint 2.10.4 .
When considering the Big O of an algorithm, what do we use to quantify our description of an algorithm.
This can be dependent of the programming language
This can be dependent on the machine, programming language, and other factors
Yes, when quantifying the time it takes to execute an algorithm we base it on the number of steps it takes to solve the problem, not the time it takes
the readability of the code
No, a very efficient algorithm can be programmed efficiently in C++ without any extra spaces making it unreadable, however the solution would still be efficient.
You have attempted
of
activities on this page.
