The following method of computing a is due to Archimedes:1. Let A = 1 and N = 62. Repeat 10 times, say:Replace N by 2Replace A by [2 – V(4 – A?)]/2Let L = NA/2Let U = L/I- A² /2Let P = (U + L)/2 (estimate of n)Let E = (U - L)/2 (estimate of error)Print N, P, E3. Stop.Write a program to implement the algorithm.

C++ Program for above Algorithm : #include <iostream> #include <math.h> using…

The following method of computing a is due to Archimedes: 1. Let A = 1 and N =6 2. Repeat 10 times, say: Replace N by 2N Replace A by [2 – V(4 – A?)]/2 Let L = NA/2 Let U = L/1-A² /2 Let P = (U+ L)/2 (estimate of n) Let E = (U - L)/2 (estimate of error) Print N, P, E 3. Stop. Write a program to implement the algorithm.

The following method of computing a is due to Archimedes: 1. Let A = 1 and N =6 2. Repeat 10 times, say: Replace N by 2N Replace A by [2 – V(4 – A?)]/2 Let L = NA/2 Let U = L/1-A² /2 Let P = (U+ L)/2 (estimate of n) Let E = (U - L)/2 (estimate of error) Print N, P, E 3. Stop. Write a program to implement the algorithm.

Computer Networking: A Top-Down Approach (7th Edition)

7th Edition

ISBN:9780133594140

Author:James Kurose, Keith Ross

Publisher:James Kurose, Keith Ross

Chapter1: Computer Networks And The Internet

Section: Chapter Questions

Problem R1RQ: What is the difference between a host and an end system? List several different types of end...

See similar textbooks

Similar questions

4. Give an analysis of the running time (Big-Oh will do). sum = 0; for( i = 0; i < n; ++i ) for( j = 0; j < n * n; ++j ) ++sum;
2) Prove divisible by 3 for any integer nzo. that n(n²+s) is divisible by 3 for Let n 1 1 (1² +5) = 1(1+5)=(6/ K(K²+5) K+ 1 ((k + 1 ) ² + 5
Given an integer say 45, to find the sum of 45 with 8 in binary form (see the figure below), we can use the TM designed in slides 79-90 of the notes "Turing Machines and Equivalent Models I" twice to find the result. A more effective way is to design a TM to do the addition with 8 directly. 1000 101101 A + = ? Such a TM can be designed by extending the TM designed in slides 79-90 of the notes "Turing Machines and Equivalent Models I". The TM has 14 instructions and 6 states: 0, 1, 2, 3, 4, and halt. Six instructions of such a TM have been given in the first and the second tables below. Fill out the remaining blanks in the first and the second tables and also blanks in the third table to show the remaining instructions of the TM (you have to use your own text boxes here)
a = 0; for i in range(N): for j in reversed(range(i,N)): a = a + i + j; O(N^N) O(N*N) O(N/2) O(logN)