This document outlines 10 numerical analysis problems involving root finding algorithms including the bisection method, Newton-Raphson method, and Regula Falsi method. The problems involve finding real roots of equations to various decimal places using the different methods. They also involve evaluating expressions like square roots and nth roots using Newton-Raphson iteration, showing the convergence of sequences, and proving properties like order of convergence for the root finding algorithms.