\begin{enumerate}

\item
Correction for section 4.3, problem 18. The coefficients should be the same
as problem 17.

\item
% Section 4.4: Problems 10(too easy), 14(estimate h), 16(refined error
% estimate for simpson), 17(for trap and mid), 19 (apply above to 14).
Section 4.4: Problems 14, 16, 17, 19.

% \item
% Section 4.4: Problem 26. Do either (a) or (b) (involves Newton's. skip).

% In order to guarantee that $|x_k-x^*| < 10^{-5}$ for this problem, 
% you need to 

% \begin{itemize}
% \item  
% Estimate $|x_k-x^*|$ in terms of $f(x_k)$. 
% \item  
% Given $x_k$, estimate $n$ (the number of nodes) or $h$ it takes
% so that the $| f(x_k)-f_h(x_k) |$ is bounded by a given tolerance
% (for example, ${1\over 2}\cdot 10^{-5}$), where $f_h(x_k)$
% is the numerical approximation of $f(x_k)$ using composite trapezoidal
% rule or composite Simpson's rule.
% \end{itemize}
% The two questions above 
% are essential to the estimate of $|x_k-x^*|$.
% The answers are not unique and you don't need to find the
% best answer.
% You can also use matlab to assist you to get the estimates.
% 
% Hand in by Dec 21 in class your analysis and numerical answer.
% Also hand in your code to the homework email account by Dec 21.

\item
implement Simpson to \int_0^1 \sqrt x dx
rate of convergence

\item
Section 4.7: Problems 1(f), 2(f), 5, 7, 8.