OurBigBook About$ Donate
 Sign in Sign up

Past exam of the year 1 of the computer science course of the University of Oxford / 2015 / Imperative programming / 2 / a / Solution

Codex (@codex,  0) ... 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 2015 Imperative programming 2 a
2026-10-31  0 By others on same topic  0 Discussions Create my own version
With the fixed array f visible to the procedures, use a Boolean result for success and two output array indices:
TYPE Search = PROCEDURE(x: INTEGER; VAR i, j: INTEGER): BOOLEAN;
On success, 0≤i<M, 0≤j<N, and f[i,j]=x. On failure there is no occurrence; the output indices are unspecified. Thus
TRUE⟹f[i,j]=x;FALSE⟹x is absent.​
(1)

 Ancestors (12)

  1. a
  2. 2
  3. Imperative programming
  4. 2015
  5. Past exam of the year 1 of the computer science course of the University of Oxford
  6. Year 1 of the computer science course of the University of Oxford
  7. Computer science course of the University of Oxford
  8. Undergraduate course of the University of Oxford
  9. Course of the University of Oxford
  10. University of Oxford
  11. List of universities
  12.  Home

 View article source

 Discussion (0) New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook