Exercise

Ch. 1

P.17

8. Fibonacci numbers,

10. Ackerman's function

11. Tower of Hanoi

P.32

1. Horner's rule

2. Truth tables

P.41

O, Omega, Theta

1. (c), (d), (e), (k)

2. (b)

P.50

2. Compare performances of iterative and recursive Summings

3. Compare those of iterative and recursive Binary searches

Ch. 2

P.58

4. Matrix multiplication using dynamically allocated arrays

P.64

3. Structure for geometric objects

P.72

6. Representation of a polynomial, based on which develop readPoly, padd, pmult

P. 75

Figure 2.5 Sparse matrix and its transpose (Programs 2.8, 2.9)

P.84

6(b). Add two sparse matrices

P.86

3. Address for a[i_0][i_1] ... [i_n-1]

P.99

3. Triangular matrix (Figure 2.12)

Ch. 3

P.112

4. Railroad switching network

P.127

3. Maximum path length for an mxn maze

P.136

1. Infix to postfix: (d), (f)

P.138

8. Postfix to prefix

9. Postfix to infix (with parentheses)

Ch. 4

P.154

6. Merge two lists with nondecreasing order

P.163

Program 4.9 Add two polynomials

P.170

7. Polynomial manipulations: pread, padd, psub, pmult, peval, perase