This talk is divided into two parts. In the first part, I will talk about a fast algorithm to compute the dilatation and invariant measured foliations of a given pseudo–Anosov braid. In the second part two algorithms regarding multicurves on surfaces are presented. The first one calculates the number of connected components of a multicurve; and the second one calculates the geometric intersection number of two multicurves. The algorithms are illustrated with Dynnikov Coordinates on the finitely punctured disk.