The present paper continues the work begun by Anstee, Ferguson, Griggs, Kamoosi and Sali on small forbidden configurations. We define a matrix to be simple if it is a (0, 1)-matrix with no repeated columns. Let F be a k × (0, 1)-matrix (the forbidden configuration). Assume A is an m × n simple matrix which has no submatrix which is a row and column permutation of F. We define forb (m, F) as the largest n, which would depend on m and F, so that such an A exists.Define Fabcd as the (a + b + c + d) × 2 matrix consisting of a rows of [11], b rows of [10], c rows of [01] and d rows of [00]. With the exception of F2110, we compute forb (m; Fabcd) for all 4 × 2 Fabcd. A number of cases follow easily from previous results and general observations. A number follow by clever inductions based on a single column such as forb (m; F1111) = 4m − 4 and forb (m; F1210) = forb (m; F1201) = forb (m; F0310) = ( 2m )+m+ 2 (proofs are different). A different idea proves forb (m; F0220) = ( 2m ) + 2m − 1 with the forbidden configuration being related to a result of Kleitman. Our results suggest that determining forb (m; F2110) is heavily related to designs and we offer some constructions of matrices avoiding F2110 using existing designs.