A general numerical method for the prediction of convenctive heat and mass transfer Process has been studied. The method has been designed to handle irregularshaped Domains and work with highly non-uniform grids. The formulation is based on Primitive variables. Considerable importance has been attached to the interpretation of the formulation in terms of physically meaningful qualities like fluxes, forces, and sources. In problems in discretized into three-node triangular elements. In all other problems, the domain is first discretized into six-node triangular macroelements, then each mecroelement is divided into four thrree-node triangular subelements. No restrictions are placed on either the shape or the dize of these elements.Following this domain triangulation, each node solved determines the forms of the interpolation fuctions for the dependent variables. In conduction-type problems,all interpolation functions for the interpolated linearly in each- three-node element. In problems involving fluid flow, however, special interpolation functions are used in each three node element,for all dependent variables expect pressure. These interpolation functions are exponencial in the direction of an element-averaged velocity vector and linear in a direction normal to it, they respond to an element Peclet number, reducing to a completely linear form when it approaches zero. In the formulation of the method, appropriate conservation laws are imposed on the polygonal control volumes associated with the nodes. The resulting sets of integral conservation equations are then aproximated by algenbraic equations, using the interpolation functions discussed above. These algebraic equations, which are non-linear and coupled, in general, are solved by an iterative procedure similar to the method of sucessive approximations. In each cycle of this procedure, the pressure, the velocity components, and all other Dependent variables are solved for in a sequencial manner. Test problems have been solved, and the results are very encouraging.