Skip to main content

Section 16 Interactive Exercises

View Source

Interactive components, just for testing, no commentary.

Exercises 16.1 True/False

A True/False question.

1. 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.


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

Exercises 16.2 Multiple-Choice

Multiple-Choice problem

1. Multiple-Choice, Not Randomized, One Answer.

    What color is a stop sign?

  • Green

  • Green means “go!”.

  • Red

  • Red is universally used for prohibited activities or serious warnings.

  • White

  • White might be hard to see.

Hint 1.

What did you see last time you went driving?

Hint 2.

Maybe go out for a drive?

Exercises 16.3 Parsons Problem, Math Proof

With some MathJax.

1. Parsons Problem, Mathematical Proof.

Create a proof of the theorem: If \(n\) is an even number, then \(n\equiv 0\mod 2\text{.}\)

Dorothy will not be much help with this proof.

Exercises 16.4 Parsons Problem, Code

Programming Parsons problem, requiring indentation.

1. Parsons Problem, Programming.

The Sieve of Eratosthenes computes prime numbers by starting with a finite list of the integers bigger than 1. The first member of the list is a prime and is saved/recorded. Then all multiples of that prime (which not a prime, excepting the prime itself!) are removed from the list. Now the first number remaining in the list is the next prime number. And the process repeats.

The code blocks below can be rearranged to form one of the many possible programs to implement this algorithm to compute a list of all the primes less than \(250\text{.}\) [Ed. this version of this problem requires the reader to provide the necessary indentation.]

Exercises 16.5 Matching

Events and dates.

Exercises 16.6 Clickable Area

Words, not code.

1. Clickable Areas, “Regular” Text.

Exercises 16.7 Old-Style Fillin-In

Do not use this as a model for new exercises. Just for backwards-compatibility.

1. Fill-In, String and Number Answers.

Complete the following line of a Python program so that it will declare an integer variable age with an initial value of 5.

age = ;

Reading Questions 16.8 A Reading Question

1. Short Answer.

This should be built with a text-box, only on a capable server (Runestone). So it can be answered

Subsection 16.9 Faux Subsection

We used <exercises> divisions above, and need a <subsection> to feed the schema.