COP 4020-Spring 2002
Assignment 1
Due Date: Feb. 12

1) Solve the following questions from the textbook (page 149)
   3.4, 3.5, 3.6

2) Prove the correctness of the following algorithm by using
   axiomatic semantics program verification technique.


  INPUT: N, A[1], A[2], ..., A[N]
  PRECONDITION: N>0

  ALGORITHM:
  =========

  T=A[1];
  C=2;
  WHILE (C<=N) DO BEGIN
    IF (A[C]>T) THEN T=A[C];
    C=C+1;
  END;

  POSTCONDITION: T>=A[1],A[2],..., A[N]