Alternative statement analyses the problem into two cases. Case analysis statement generalizes it to multiple cases. Case analysis splits the problem into an exhaustive set of disjoint cases. For each case, the problem is solved independently. If C1, C2, and C3 are conditions, and S1, S2, S3 and S4 are statements, a 4-case analysis statement has the form,
1. case C1
2. S1
3. case C2
4. S2
5. case C3
6. S3
7. else
8. S4
The conditions C1, C2, and C3 are evaluated in turn. For the first condition that evaluates to true, the corresponding statement is executed, and the case analysis statement ends. If none of the conditions evaluates to true, then the default case S4 is executed.
(i) The cases are exhaustive: at least one of the cases is true. If all conditions are false, the default case is true.
(ii) The cases are disjoint: only one of the cases is true. Though it is possible for more than one condition to be true, the case analysis always executes only one case, the first one that is true. If the three conditions are disjoint, then the four cases are (1) C1, (2) C2, (3) C3, (4) (not C1) and (not C2) and (not C3).

(i) f=1 i=1 f = f * i i = i+1
f = 1 x 1 = 1 i = 2
(ii) f = 1 x 2 i = 3 = 2
(iii) f = 2 × 3 i = 4 = 6
(iv) f = 6 x 4 i = 5 (loop terminates) = 24

Ans.(a)
Let a, b, c be the variables whose maximum value are 8L, 5L and 3L respectively.
Initial State

a, b, c: 4, 4,0
Specifications:
1 decant
2-inputs: a, b, c: =8,0,0
3-outputs: a, b, c: = 4, 4, 0
Algorithm:
Let us assume that a: = b denote oil in b is poured into a bottle until either "a" is full or "b" becomes empty.
1 decant (a, b, c)
2 a, b, c:=8,0,0
3 b:=a
4 --a, b, c: 3, 5, 0.
5 c:=b
6 --a, b, c: = 3, 2, 3
7 a:=c
8 -- a, b, c: = 6, 2,0
9 c:=b
10 --a, b, c:=6,0,2
11 b: a
12 a, b, c: = 1, 5, 2
13 c:=b
14 --a, b, c: 1, 4, 3
15 a: c
16 --a, b, c: = 4, 4,0

Let the variables a, b, c represent Glass A, Glass B and Glass C and a, b, c can store values APPLE, GRAPE or EMPTY.
Specification:
1 exchange (a, b)
2-inputs: a, b: APPLE, GRAPE
3-outputs: a, b: = GRAPE, APPLE
Algorithm:
1. exchange (a, b)
2. a, b, c :- APPLE, GRAPE, EMPTY.
3. c:=b
4. -- a, b, c :- APPLE, EMPTY, GRAPE,
5. b:= a
6. --a, b, c = EMPTY, APPLE, GRAPE
7. a: = c
8. --a, b, c = GRAPE, APPLE, EMPTY