Algorithm-Design Travelling Salesman Problem. Trying to solve an NP-hard problem (task scheduling) with heuristics. Using Dynamic Programming to solve a scheduling problem. Solving a maze problem with graph algorithms.