3.4: Exercises

Last updated
Save as PDF

Page ID: 34828

\( \newcommand{\vecs}[1]{\overset { \scriptstyle \rightharpoonup} {\mathbf{#1}} } \) \( \newcommand{\vecd}[1]{\overset{-\!-\!\rightharpoonup}{\vphantom{a}\smash {#1}}} \)\(\newcommand{\id}{\mathrm{id}}\) \( \newcommand{\Span}{\mathrm{span}}\) \( \newcommand{\kernel}{\mathrm{null}\,}\) \( \newcommand{\range}{\mathrm{range}\,}\) \( \newcommand{\RealPart}{\mathrm{Re}}\) \( \newcommand{\ImaginaryPart}{\mathrm{Im}}\) \( \newcommand{\Argument}{\mathrm{Arg}}\) \( \newcommand{\norm}[1]{\| #1 \|}\) \( \newcommand{\inner}[2]{\langle #1, #2 \rangle}\) \( \newcommand{\Span}{\mathrm{span}}\) \(\newcommand{\id}{\mathrm{id}}\) \( \newcommand{\Span}{\mathrm{span}}\) \( \newcommand{\kernel}{\mathrm{null}\,}\) \( \newcommand{\range}{\mathrm{range}\,}\) \( \newcommand{\RealPart}{\mathrm{Re}}\) \( \newcommand{\ImaginaryPart}{\mathrm{Im}}\) \( \newcommand{\Argument}{\mathrm{Arg}}\) \( \newcommand{\norm}[1]{\| #1 \|}\) \( \newcommand{\inner}[2]{\langle #1, #2 \rangle}\) \( \newcommand{\Span}{\mathrm{span}}\)\(\newcommand{\AA}{\unicode[.8,0]{x212B}}\)

Exercise \(\PageIndex{1}\)

Traditionally, computers keep track of the time/date using a format known as Unix time, which counts the number of seconds that have elapsed since 00:00:00 UTC on Thursday, 1 January 1970. But there's a problem if we track Unix time using a fixed-width integer, since that has a maximum value. Beyond this date, the Unix time counter will roll-over, wreaking havoc on computer systems. Calculate the roll-over date for:

Ordinary (signed) 32-bit integers
Unsigned 32-bit integers, which do not reserve a bit for the sign (and thus store only non-negative numbers).
Signed 64-bit integers
Unsigned 64-bit integers

Exercise \(\PageIndex{2}\)

Find the runtime of each of the following Python code samples (e.g. \(O(1)\) or \(O(N)\)). Assume that the arrays x and y are of size \(N\):

z = x + y
x[5] = x[4]
z = conj(x)
z = angle(x)
x = x[::-1] (this reverses the order of elements).

Exercise \(\PageIndex{3}\)

Write a Python function uniquify_floats(x, epsilon), which accepts a list (or array) of floats x, and deletes all "duplicate" elements that are separated from another element by a distance of less than epsilon. The return value should be a list (or array) of floats that differ from each other by at least eps.

Exercise \(\PageIndex{4}\)

(Hard) Suppose a floating-point representation uses one sign bit, \(N\) fraction bits, and \(M\) exponent bits. Find the density of real numbers which can be represented exactly by a floating-point number. Hence, show that floating-point precision decreases exponentially with the magnitude of the number.