We will introduce some of the fundamental algorithms which underpin computation with finitely-presented groups. Our primary focus will be on effective practical algorithms. In particular we will illustrate aspects of coset enumeration, and discuss how to construct useful descriptions of subgroups and quotients of such groups. We will also introduce algorithms to construct finite groups.