We compare how computational effects are modelled in Classical Domain Theory and Topological Domain Theory. Both of these theories provide powerful toolkits for denotational semantics: Classical Domain Theory being introduced by Scott, and well-established and developed since; Topological Domain Theory being a generalization in which topologies more general than the Scott-topology are admitted. Computational effects can be modelled using free algebra constructions, according to Plotkin and Power, and we show that for a wide range of computational effects, including all the classical powerdomains, this free algebra construction coincides in Classical and Topological Domain Theory, when restricted to countably-based continuous domains.