The set of eigenvalues of a graph G together with their multiplicities is called the spectrum of G. The knowledge of spectrum can be used to obtain various topological properties of graphs like connectedness, toughness and many more. In this paper we use MATLAB to completely describe the spectrum of Sierpiński graphs and Sierpiński triangles, thus adding to the classes of graphs whose spectrum is known. © 2012 IEEE.