SB Hodgepodge

$\newcommand{\identity}{\mathrm{id}} \newcommand{\notdivide}{{\not{\mid}}} \newcommand{\notsubset}{\not\subset} \newcommand{\lcm}{\operatorname{lcm}} \newcommand{\gf}{\operatorname{GF}} \newcommand{\inn}{\operatorname{Inn}} \newcommand{\aut}{\operatorname{Aut}} \newcommand{\Hom}{\operatorname{Hom}} \newcommand{\cis}{\operatorname{cis}} \newcommand{\chr}{\operatorname{char}} \newcommand{\Null}{\operatorname{Null}} \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\,}$}}} \newcommand{\sfrac}[2]{{#1}/{#2}} $

Exercises 5.19 Hodgepodge

1.

This is a test of accessing program resources across pages by relying on what is in the database.

🔗

#include "add.h"
#include <iostream>
using namespace std;
int main() {
    int a = 1;
    int b = 2;
    cout << "The sum of " << a << " and " << b << " is " << add(a, b) << endl;
}

🔗

2. With Tasks in an Exercises Division.

Structured with task, recycled earlier from earlier, to make sure that the tasks do not get counted as Runestone reading activities (since they are inside an <exercise> inside of an <exercises> division.

🔗

(a) True/False.

Every vector space has finite dimension.

🔗

True.
The vector space of all polynomials with finite degree has a basis, $B = \{1,x,x^2,x^3,\dots\}\text{,}$ which is infinte.
False.
The vector space of all polynomials with finite degree has a basis, $B = \{1,x,x^2,x^3,\dots\}\text{,}$ which is infinte.

Hint.

$P_n\text{,}$ the vector space of polynomials with degree at most $n\text{,}$ has dimension $n+1$ by Theorem 3.2.16. [Cross-reference is just a demo, content is not relevant.] What happens if we relax the defintion and remove the parameter $n\text{?}$

🔗

(b)

Explain your reasoning in the previous question.

🔗

Prev Top Next