We will give a self-content course on the basics of Communication Complexity together with simple and elegant applications for proving lower bounds in different computational models. For instance, we will give a space time tradeoff for recognizing a palindrome on a Turing machine.