 Solution

ID: past-exam-of-the-year-1-of-the-computer-science-course-of-the-university-of-oxford/2014/imperative-programming/4/b/solution

N \geq 0

, rows.length == N, and every rows(i) is a nonnull finite list of entries

(j, x)

satisfying

0 \leq j < N, x \neq = 0.0, column indices strictly increase along each row .

Strict increase excludes repeated columns. The abstraction function gives

A_{ij} = x

when the unique entry

(j, x)

occurs in rows(i), and

A_{ij} = 0

otherwise. Thus omitted positions represent zero; omission does not mean an unknown matrix entry.

 New to topics? Read the docs here!