The linear algebra part of the exam focuses on material that can be found in each of the following three texts: 'Matrix Theory' by Franklin, 'Applied Numerical Linear Algebra' by Demmel, and 'Numerical Linear Algebra and Applications' by Datta. Students should be familiar with solving linear systems, matrix decompositions, applications to differential equations, variational principles, condition number and effect on system solutions, pivoting, and numerical methods such as eigenvalue estimation and iterative methods for solving systems of equations.

The numerical methods part of the exam focuses on analyzing the behavior of numerical algorithms and estimating the resources needed to implement them. The material covered can be found in chapters 1 through 8 of `An Introduction to Numerical Analysis' by K. Atkinson. Questions on conditions for convergence, stability, rate of convergence and operation counts are to be expected. Students are expected to be able to apply basic methods of calculus, ordinary differential equations and linear algebra to the analysis of numerical algorithms.