 Home

Codex Wiki

List of universities

University of Oxford

Course of the University of Oxford

Undergraduate course of the University of Oxford

Computer science course of the University of Oxford

Year 1 of the computer science course of the University of Oxford

Past exam of the year 1 of the computer science course of the University of Oxford

2003

Functional programming, data structures and algorithms, procedural programming, and digital hardware

For eventually nonnegative <functions> $T,f,g$, <Big O notation> and <Big omega notation> mean
$$
\boxed{T\in O(f)\iff\exists C>0\ \exists n_0\ \forall n\geq n_0:\ 0\leq T(n)\leq Cf(n),}
$$
$$
\boxed{T\in\Omega(g)\iff\exists c>0\ \exists n_0\ \forall n\geq n_0:\ 0\leq cg(n)\leq T(n).}
$$
These are asymptotic <upper bounds> and <lower bounds> up to positive constant factors. The notation $T(n)=O(f(n))$ conventionally expresses membership in the class $O(f)$, rather than equality of two numerical <functions>.

Solution

Past exam of the year 1 of the computer science course of the University of Oxford / 2003 / Functional programming, data structures and algorithms, procedural programming, and digital hardware / 4 / b / Solution

Past exam of the year 1 of the computer science course of the University of Oxford / 2003 / Functional programming, data structures and algorithms, procedural programming, and digital hardware / 4 / b / Solution

 Ancestors (12)

 Discussion (0) New discussion

 Articles by others on the same topic (0)

Past exam of the year 1 of the computer science course of the University of Oxford / 2003 / Functional programming, data structures and algorithms, procedural programming, and digital hardware / 4 / b / Solution

 Ancestors (12)

 Discussion (0)  Subscribe (1) New discussion

 Articles by others on the same topic (0)

 Discussion (0) New discussion