In Automata Theory, if a language is recognized bay a Non-deterministic finite automaton (NFA), then we must show the existence of deterministic finite automaton (DFA) that also recognizes it. There are many idea and algorithms to convert an NFA in to an equivalent DFA that simulates the NFA. In this paper, we present an algorithm to convert an NFA to a DFA with programming by C++. This approach contains several classes and is so universal that cover converting from NFA to DFA completely.