A significant research topic in the area of Computational Social Choice is the complication of different kinds of dishonest behavior like manipulation, dominance and bribery. Whereas most of the work on this issue assumes that the opposite party has incomplete knowledge regarding every agent, they did not know the true preferences of other voters. We have analyzed the dynamics of voting rules with the help of some manipulative and non-manipulative moves. Voters have incomplete information. The voters are aware of the winner at every stage and they make short term rational decisions. The number of candidates and voters are small, and the decisions need to be made quickly. We want the better reply as low as possible while keeping the best reply as high as possible. The voting rules we have used are Plurality rule and Borda rule. We have analyzed the dynamics for these two voting rules for small number of voters and candidates.