Theory of computation is been one of the challenging course from student perspective since it involves the abstract notions and mathematical backgrounds. However, there are so many applications of finite automata in real world and hence it becomes necessary to understand the working of automata. The finite automata is mainly of two types -a deterministic finite automaton (DFA)—also known as deterministic finite state machine—is a finite state machine that accepts/rejects finite strings of symbols and only produces a unique computation (or run) of the automaton for each input string. 'Deterministic' refers to the uniqueness of the computation. However there is no fixed algorithm to create a DFA. The paper proposes an algorithm to create a basic automaton.