In this paper we present an overview of contingency tables, provide an introduction to the problems of almost uniform sampling and approximate counting, and show recent results achieved through the use of Markov chains. We focus specifically on contingency tables with two rows, since as of this time little progress has been made in achieving reasonable bounds on arbitrarily sized contingency ta...