Let K be an uncountable compact metric space and let C(K, R d ) denote the set of continuous maps f : K → R d endowed with the maximum norm. The goal of this paper is to determine various fractal dimensions of the graph of the prevalent f ∈ C(K, R d ).As the main result of the paper we show that if K has finitely many isolated points then the lower and upper box dimension of the graph of the prevalent f ∈ C(K, R d ) are dim B K + d and dim B K + d, respectively. This generalizes a theorem of Gruslys, Jonušas, Mijovic, Ng, Olsen, and Petrykiewicz.We prove that the graph of the prevalent f ∈ C(K, R d ) has packing dimension dim P K + d, generalizing a result of Balka, Darji, and Elekes.Balka, Darji, and Elekes proved that the Hausdorff dimension of the graph of the prevalent f ∈ C(K, R d ) equals dim H K + d. We give a simpler proof for this statement based on a method of Fraser and Hyde.2010 Mathematics Subject Classification. Primary: 28A78, 28C10, 46E15, Secondary: 60B05, 54E52.