We give asymptotically sharp upper bounds for the maximum diameter and radius of (i) a connected graph, (ii) a connected trangle-free graph, (iii) a connected C4-free graph with n vertices and with minimum degree δ, where n tends to infinity. Some conjectures for Kr-free graphs are also stated.