Question

need help with #1 thank you!

EXERCISES Section 1.1 (Note: Solutions to odd-numbered exercises are given in the back of the book.) 1. Write an algorithm that computes the sum of the first n terms of the series 2. Write an algorithm that finds the smallest element among a, b, and c 3. Write an algorithm that finds the smallest element in the sequence s, s S, of n dis- tinct numbers. The input is the sequence, s, and the index, n, of the last term of the sequence. The output is the index of the smallest element in the sequence. 4. How might the algorithm of Example 1.1.1 be made even more general? 5. Read the instructions in a telephone book for making a long-distance call. Which of the properties of an algorithm-precision, uniqueness, finiteness, input, output generality-are present? Which properties are missing?

Answer 1

Algorithm: Sundn terms of series: LE) + 1. 2. 3. 4. Start Declare Declare Output Integus Real "Enter i, n. sum=0.0, denominator positive number for nu. 5. 6 7. Input Assign While a i=1 i <=n 7.1. denominator = (1+i)*(1+9) sum = sum + 7.2. 1 Idenominator . 8 End loop. first n terms Sum of 9. Output " 10 output sum 11. stop.