We look at some simple PDEs with random coefficients and discuss the necessary steps to derive a numerical algorithm. This includes the finite element discretization of the PDE, the numerical treatment of the random field, and the QMC-integration of the quantify of interest. We will consider the implementational aspects as well as the theoretical foundations. Further investigations will show how sufficient smoothness of the integrands can be guaranteed to prove higher order convergence of the QMC method. We will also talk about the component-by-component algorithm together with weighted norms, which allow us to get rid of the dimension dependence. This talk consists of two parts. The first part is at 10:30am, the second part is at 1:30pm.